A bijection for partitions with initial repetitions
โ Scribed by William J. Keith
- Publisher
- Springer US
- Year
- 2011
- Tongue
- English
- Weight
- 239 KB
- Volume
- 27
- Category
- Article
- ISSN
- 1382-4090
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
It follows from the work of Andrews and Bressoud that for t 1, the number of partitions of n with all successive ranks at least t is equal to the number of partitions of n with no part of size 2&t. We give a simple bijection for this identity which generalizes a result of Cheema and Gordon for 2-row
An explicit bijection is constructed between partitions of a positive integer n with exactly j even parts which are all different, and bipartitions (x1; n2) of n into distinct parts such that 1(n2)=j and max n2 <I(aI); this implies an identity due to Lebesgue. The construction is inspired by a versi
Loopless triangulations of a polygon with k vertices in k + 2n triangles (with interior points and possibly multiple edges) were enumerated by Mullin in 1965, using generating functions and calculations with the quadratic method. In this article we propose a simple bijective interpretation of Mulli