Mathematics – Combinatorics
Scientific paper
2003-01-10
Mathematics
Combinatorics
23 pages
Scientific paper
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.
No associations
LandOfFree
A method for proving polynomial enumeration formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A method for proving polynomial enumeration formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A method for proving polynomial enumeration formulas will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-231543