2011
DOI: 10.1093/imrn/rnr132
|View full text |Cite
|
Sign up to set email alerts
|

Two Parking Function Bijections: A Sharpening of the q,t-Catalan and Shröder Theorems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
11
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 7 publications
1
11
0
Order By: Relevance
“…These identities combined with two beautiful parking function bijections proved by Angela Hicks in [18] yield the following combinatorial result.…”
Section: More Preciselymentioning
confidence: 85%
“…These identities combined with two beautiful parking function bijections proved by Angela Hicks in [18] yield the following combinatorial result.…”
Section: More Preciselymentioning
confidence: 85%
“…Denote v = (1 + u) m+1 u −m , and let the series u i be defined as above. Denote A i = A(u i ), where A(u) is given by (25). Then…”
Section: Proposition 12mentioning
confidence: 99%
“…A desirable approach to proving (1.2) would be to determine a recursive formula for D α pX; q, tq, and interpret the result in terms of some commutation relations for ∇. Indeed, this approach has been applied in some important special cases, see [GH02,GXZ12,Hic12]. In [GXZ12], for instance, the authors devise a recursive formula (Proposition 3.12) to prove the Catalan case of the compositional conjecture, extending the results of [GH02].…”
Section: Introductionmentioning
confidence: 99%