Download:
|
unknown authors
http://www.mathe2.uni-bayreuth.de/axel/papers/./zeilberger:kathy_o_haras_constructive_proof_of_the_unimodality_of_the_gaussian_polynomials.ps.gz
Add To MetaCart
Abstract:
Kathy O'Hara[6][7] has recently solved a long-standing open problem in combinatorics: to find a direct combinatorial proof that the "Gaussian polynomials" G (b,a):=
Citations
|
283
|
The Theory of Partitions
– Andrews
- 1976
|
|
46
|
Constructive Combinatorics
– Stanton, White
- 1986
|
|
24
|
Proof techniques in the theory of finite sets
– Greene, Kleitman
- 1978
|
|
24
|
Weyl groups, the hard Lefschetz theorem, and the Sperner property
– Stanley
- 1980
|
|
10
|
Unimodality of Gaussian coefficients: a constructive proof
– O’Hara
- 1990
|
|
8
|
Solution of two difficult combinatorial problems with linear algebra
– Proctor
- 1982
|
|
5
|
Proof of the hitherto undemonstrated fundamental theorem of invariants. In The collected mathematical papers
– Sylvester
- 1973
|
|
4
|
Unimodality and Young’s lattice
– Stanton
- 1990
|
|
2
|
Proof of a conjecture about unimodal polynomials
– Almkvist
- 1989
|
|
2
|
Monotonicity and unimodality of the pattern inventory
– White
- 1980
|
|
1
|
On the set of divisors of a number, Nieuw Arch
– deBruijn, Tenbergen
- 1952
|
|
1
|
A partition of L(3,n) into saturated chains
– Lindstrom
- 1980
|
|
1
|
Optimierungprobleme auf Ordnungen, Arbeitsberichte des Instituts fur mathematische Maschinen und Datenverarbeitungen 11
– Riess, Zwei
- 1978
|
|
1
|
A symmetric chain decomposition of L(4,n
– West
- 1980
|
