Sciweavers

6 search results - page 1 / 2
» A proof of the q, t-square conjecture
Sort
View
DM
2002
93views more  DM 2002»
14 years 10 months ago
A proof of the q, t-Catalan positivity conjecture
We present here a proof that a certain rational function Cn(q, t) which has come to be known as the "q, t-Catalan" is in fact a polynomial with positive integer coeffici...
Adriano M. Garsia, James Haglund
64
Voted
JCT
2006
55views more  JCT 2006»
14 years 10 months ago
A proof of the q, t-square conjecture
We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in (pn). Here denotes the Bergeron-Garsia nabla operator, and pn is a...
Mahir Can, Nicholas A. Loehr
DCC
2002
IEEE
15 years 9 months ago
Subcodes of the Projective Generalized Reed-Muller Codes Spanned by Minimum-Weight Vectors
We use methods of Mortimer [19] to examine the subcodes spanned by minimumweight vectors of the projective generalized Reed-Muller codes and their duals. These methods provide a p...
Peng Ding, Jennifer D. Key
COMBINATORICS
2006
101views more  COMBINATORICS 2006»
14 years 10 months ago
Optimal Penney Ante Strategy via Correlation Polynomial Identities
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
Daniel Felix
FOCS
2004
IEEE
15 years 1 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...