Name
Abstract | ||
|---|---|---|
In this paper, we give a combinatorial proof via lattice paths of the following result due to Andrews and Bressoud: 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. The identity is a special case of a more general theorem proved by Andrews and Bressoud using a sieve. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00225-4 | Discrete Mathematics |
Keywords | Field | DocType |
special case,following result,integer partitions,general theorem,minimum rank,lattice paths,successive rank,combinatorial proof,lattice path,lattice path approach,theorem proving,integer partition | Graph theory,Discrete mathematics,Combinatorics,Lattice (order),Lattice path,Combinatorial proof,Integer lattice,Sieve,Partition (number theory),Mathematics,Special case | Journal |
Volume | Issue | ISSN |
249 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander Burstein | 1 | 45 | 7.80 |
| Sylvie Corteel | 2 | 266 | 36.33 |
| Alexander Postnikov | 3 | 64 | 16.74 |
| Carla D. Savage | 4 | 349 | 60.16 |