A method for proving polynomial enumeration formulas
| dc.creator | Fischer, Ilse | |
| dc.date | 2003-01-10 | |
| dc.date | 2003-09-17 | |
| dc.date.accessioned | 2026-07-07T04:54:22Z | |
| dc.date.available | 2026-07-07T04:54:22Z | |
| dc.description | We present an elementary method for proving enumeration formulas which are polynomials in certain parameters if others are fixed and factorize into distinct linear factors over Z. Roughly speaking the idea is to prove such formulas by ``explaining'' their zeros using an appropriate combinatorial extension of the objects under consideration to negative integer parameters. We apply this method to prove a new refinement of the Bender-Knuth (ex-)Conjecture, which easily implies the Bender-Knuth (ex-)Conjecture itself. This is probably the most elementary way to prove this result currently known. Furthermore we adapt our method to q-polynomials, which allows us to derive generating function results as well. Finally we use this method to give another proof for the enumeration of semistandard tableaux of a fixed shape, which is opposed to the Bender-Knuth (ex-)Conjecture refinement a multivariate application of our method. | |
| dc.description | 23 pages | |
| dc.identifier | https://arxiv.org/abs/math/0301103 | |
| dc.identifier | http://arxiv.org/abs/math/0301103 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/66227 | |
| dc.subject | Combinatorics | |
| dc.title | A method for proving polynomial enumeration formulas | |
| dc.type | text |