AbstractObjects lying in four different boxes are rearranged in such a way that the number of objects in each box stays the same. Askey, Ismail, and Koornwinder proved that the cardinality of the set of rearrangements for which the number of objects changing boxes is even exceeds the cardinality of the set of rearrangements for which that number is odd. We give a simple counting proof of this fact
Arithmetic Combinatorics, Combinatorial Number Theory, Structural Additive Theory and Additive Numbe...
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It...
The Collatz conjecture maintains that each natural number $n$ is a node in the Collatz tree with a r...
AbstractA binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric...
100 people leave their hats at the door at a party and pick up a completely random hat when they lea...
Let Sn and Gn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n...
AbstractThe number of alternating permutations with specified peak set is calculated. A recent resul...
The "pancake problem" asks how many prefix reversals are sufficient to sort any permutation $\pi \in...
The well-known Rogers-Ramanujan identities have been a rich source of mathematical study over the la...
AbstractGiven integers 0 < k ⩽ n and a permutation α mapping the set of integers from 1 to n onto it...
International audienceIn their study of the densest jammed configurations for theater models, Krapiv...
AbstractThe Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hou...
AbstractWe construct an ordered set I of cardinality N1, such that its square is the union of N0 cha...
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving m...
AbstractWe complete the solution of a combinatorial problem concerning multisets of equivalence rela...
Arithmetic Combinatorics, Combinatorial Number Theory, Structural Additive Theory and Additive Numbe...
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It...
The Collatz conjecture maintains that each natural number $n$ is a node in the Collatz tree with a r...
AbstractA binomial coefficient identity equivalent to Saalschutz's summation of a 3F2 hypergeometric...
100 people leave their hats at the door at a party and pick up a completely random hat when they lea...
Let Sn and Gn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n...
AbstractThe number of alternating permutations with specified peak set is calculated. A recent resul...
The "pancake problem" asks how many prefix reversals are sufficient to sort any permutation $\pi \in...
The well-known Rogers-Ramanujan identities have been a rich source of mathematical study over the la...
AbstractGiven integers 0 < k ⩽ n and a permutation α mapping the set of integers from 1 to n onto it...
International audienceIn their study of the densest jammed configurations for theater models, Krapiv...
AbstractThe Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hou...
AbstractWe construct an ordered set I of cardinality N1, such that its square is the union of N0 cha...
A possible upgrade of a curriculum in undergraduate course in combinatorics is presented by giving m...
AbstractWe complete the solution of a combinatorial problem concerning multisets of equivalence rela...
Arithmetic Combinatorics, Combinatorial Number Theory, Structural Additive Theory and Additive Numbe...
Enumerative Combinatorics focusses on the exact and asymptotic counting of combinatorial objects. It...
The Collatz conjecture maintains that each natural number $n$ is a node in the Collatz tree with a r...