Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

6

JCT
2006

favoriteEmaildiscussreport

55views more JCT 2006»

A proof of the q, t-square conjecture

13 years 4 months ago

A proof of the q, t-square conjecture

Download garsia.math.yorku.ca

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 power-sum symmetric function. The combinatorial formula enumerates lattice paths in an n

Mahir Can, Nicholas A. Loehr

Real-time Traffic

Combinatorial Formula | Et Par Pn | JCT 2006 | Loehr Et Warrington |

claim paper

Related Content

» A proof of the q tCatalan positivity conjecture

» Subcodes of the Projective Generalized ReedMuller Codes Spanned by MinimumWeight Vectors

» Optimal Penney Ante Strategy via Correlation Polynomial Identities

» Optimal Inapproximability Results for MaxCut and Other 2Variable CSPs

» The Shortest Vector in a Lattice is Hard to Approximate to Within Some Constant

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JCT
Authors	Mahir Can, Nicholas A. Loehr

Comments (0)