Another refinement of the Bender-Knuth (ex-)Conjecture
| dc.creator | Fischer, Ilse | |
| dc.date | 2004-01-19 | |
| dc.date.accessioned | 2026-07-07T05:04:40Z | |
| dc.date.available | 2026-07-07T05:04:40Z | |
| dc.description | We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting lattice paths and generating functions for tableaux", Mem. Amer. Math. Soc. 115 (1995)] and the author's ["A method for proving polynomial enumeration formulas", preprint] refinement of the Bender-Knuth (ex-)Conjecture. The result is proved by an extension of the method for proving polynomial enumeration formulas which was introduced by the author to q-quasi-polynomials. | |
| dc.identifier | https://arxiv.org/abs/math/0401235 | |
| dc.identifier | http://arxiv.org/abs/math/0401235 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/69892 | |
| dc.subject | Combinatorics | |
| dc.title | Another refinement of the Bender-Knuth (ex-)Conjecture | |
| dc.type | text |