In this note we study a family of identities regarding divisibility properties of Kostant partition functions which first appeared in a paper of Baldoni and Vergne. To prove the identities, Baldoni and Vergne used techniques of residues and called the resulting divisibility properties “mysterious.” We prove these identities entirely combinatorially and provide a natural explanation of why the d...

In this note we study the existence of primes and of primitive divisors in function field analogues of classical divisibility sequences. Under various hypotheses, we prove that Lucas sequences and elliptic divisibility sequences over function fields defined over number fields contain infinitely many irreducible elements. We also prove that an elliptic divisibility sequence over a function field...

Trace monoids provide a powerful tool to study graphs, viewing walks as words whose letters, the edges of the graph, obey a specific commutation rule. A particular class of traces emerges from this framework, the hikes, whose alphabet is the set of simple cycles on the graph. We show that hikes characterize undirected graphs uniquely, up to isomorphism, and satisfy remarkable algebraic properti...

Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fractional r-clique decomposition or an approximate one. Together with very recent results of Bowditch and Dukes as well as Montgomery on fractional decompositions into triangles and cliques respectively, this gives the...

Two Divisibility Tests for Smarandache semigroups are given . Further, the notion of divisibility of elements in a semigroup is applied to characterize the Smarandache semigroups. Examples are provided for justification.

We give an overview of two important families of divisibility sequences: the Lehmer–Pierce family (which generalise the Mersenne sequence) and the elliptic divisibility sequences. Recent computational work is described, as well as some of the mathematics behind these sequences.

In this work we study elliptic divisibility sequences over finite fields. Morgan Ward in [11, 12] gave arithmetic theory of elliptic divisibility sequences. We study elliptic divisibility sequences, equivalence of these sequences and singular elliptic divisibility sequences over finite fields Fp, p > 3 is a prime. Keywords—Elliptic divisibility sequences, equivalent sequences, singular sequence...

When human capital accumulation generates pecuniary externalities across professions, and capital markets are imperfect, persistent inequality in utility and consumption is inevitable in any steady state. This is true irrespective of the degree of divisibility in investments. However, divisibility (or fineness of occupational structure) has implications for both the multiplicity and Pareto-effi...

The arithmetic of natural numbers with addition and divisibility has been shown undecidable as a consequence of the fact that multiplication of natural numbers can be interpreted into this theory, as shown by J. Robinson [Rob49]. The most important decidable subsets of the arithmetic of addition and divisibility are the arithmetic of addition, proved by M. Presburger [Pre29], and the purely exi...