Radhika Venkatraman

Learn More
It follows from 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-rowed plane partitions. The bijection yields several reenements of(More)
(English) It follows from 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 numberof partitions of n with no part of size 2 ; t. However, no simple combinatorial explanation of this fact has appeared in the literature. We give a simple bijection for this identity which generalizes a(More)
  • 1