As an application of the Combinatorial Nullstellensatz, we give a short polynomial proof of the q-analogue of Dyson’s conjecture formulated by Andrews and first proved by Zeilberger and Bressoud
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. Thi...
Abstract. Tucker’s Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n = 2 was...
none3siWe announce an analogue of the celebrated theorem by Campbell, Baker, Hausdorff, and Dynkin f...
AbstractStembridge's recent short, elegant, and elementary proof of the equal parameter case of the ...
AbstractLet (y)a=(1−y)(1−qy)…(1−qa−1y). We prove that the constant term of the Laurent polynomial Π1...
AbstractDyson's conjecture, already proved by Gunson, Wilson and Good, is given a direct combinatori...
In 1962, Freeman Dyson conjectured that the constant term in the Laurent polynomial ∏1≤i≠j≤n(1 − xi/...
AbstractDyson's celebrated constant term conjecture [F.J. Dyson, Statistical theory of the energy le...
AbstractBy generalizing Gessel–Xin's Laurent series method for proving the Zeilberger–Bressoud q-Dys...
In this diploma thesis we first look at Hilbert Nullstellensatz, along with some examples. The main ...
AbstractWe present ten assorted problems which have arisen in the attempt to understand the Z-statis...
I discuss the computational methods behind the formulation of some conjectures related to variants o...
AbstractM. G. Kendall and B. Babington-Smith proved that if a tournament p′ is obtained from a tourn...
AbstractTucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem and the case n=2 was pro...
AbstractWe give a constant term orthogonality relation and a conjectured q-analogue which are relate...
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. Thi...
Abstract. Tucker’s Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n = 2 was...
none3siWe announce an analogue of the celebrated theorem by Campbell, Baker, Hausdorff, and Dynkin f...
AbstractStembridge's recent short, elegant, and elementary proof of the equal parameter case of the ...
AbstractLet (y)a=(1−y)(1−qy)…(1−qa−1y). We prove that the constant term of the Laurent polynomial Π1...
AbstractDyson's conjecture, already proved by Gunson, Wilson and Good, is given a direct combinatori...
In 1962, Freeman Dyson conjectured that the constant term in the Laurent polynomial ∏1≤i≠j≤n(1 − xi/...
AbstractDyson's celebrated constant term conjecture [F.J. Dyson, Statistical theory of the energy le...
AbstractBy generalizing Gessel–Xin's Laurent series method for proving the Zeilberger–Bressoud q-Dys...
In this diploma thesis we first look at Hilbert Nullstellensatz, along with some examples. The main ...
AbstractWe present ten assorted problems which have arisen in the attempt to understand the Z-statis...
I discuss the computational methods behind the formulation of some conjectures related to variants o...
AbstractM. G. Kendall and B. Babington-Smith proved that if a tournament p′ is obtained from a tourn...
AbstractTucker's lemma is a combinatorial analog of the Borsuk–Ulam theorem and the case n=2 was pro...
AbstractWe give a constant term orthogonality relation and a conjectured q-analogue which are relate...
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. Thi...
Abstract. Tucker’s Lemma is a combinatorial analog of the Borsuk-Ulam theorem and the case n = 2 was...
none3siWe announce an analogue of the celebrated theorem by Campbell, Baker, Hausdorff, and Dynkin f...
DOI
Add to ORKG