2013
DOI: 10.1007/s10801-013-0423-3
|View full text |Cite
|
Sign up to set email alerts
|

Remarks on the paper “Skew Pieri rules for Hall–Littlewood functions” by Konvalinka and Lauve

Abstract: Abstract. In a recent paper Konvalinka and Lauve proved several skew Pieri rules for Hall-Littlewood polynomials. In this note we show that q-analogues of these rules are encoded in a q-binomial theorem for Macdonald polynomials due to Lascoux and the author. The Konvalinka-Lauve formulas and their q-analoguesWe refer the reader to [14] for definitions concerning Hall-Littlewood and Macdonald polynomials.Let P λ/µ = P λ/µ (X; t) and Q λ/µ = Q λ/µ (X; t) be the skew Hall-Littlewood polynomials, e r = P (1 r ) t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 13 publications
(12 citation statements)
references
References 18 publications
(15 reference statements)
0
12
0
Order By: Relevance
“…Specifically, they give an expression for the product of the skew Hall-Littlewood polynomial P λ/µ times h r as a signed sum of skew Hall-Littlewood polynomials, and do the same with e r or q r := (1 − t)P r in place of h r . Finally, in [War13], Warnaar shows that q-analogues of these three results from [KL13] can be derived from a q-binomial theorem for Macdonald polynomials of Lascoux and himself [LW11].…”
Section: A Skew Generalization Of the Rsk Algorithmmentioning
confidence: 97%
“…Specifically, they give an expression for the product of the skew Hall-Littlewood polynomial P λ/µ times h r as a signed sum of skew Hall-Littlewood polynomials, and do the same with e r or q r := (1 − t)P r in place of h r . Finally, in [War13], Warnaar shows that q-analogues of these three results from [KL13] can be derived from a q-binomial theorem for Macdonald polynomials of Lascoux and himself [LW11].…”
Section: A Skew Generalization Of the Rsk Algorithmmentioning
confidence: 97%
“…Similarly, f λ/µ (n) is the number of down walks from λ to µ of length n in βY. For example, F (21), (2) (2) = −3, f (211),(1) (2) = 2. Enumerator of the down graph of µY is g λ/µ .…”
Section: Enumerative Identitiesmentioning
confidence: 99%
“…The functions φ λ/β (q, t), Ω β/μ (q, t) have interpretations in terms of skew Macdonald polynomials (in parameters q, t) with plethystic substitutions. In particular, we have [12]), and both these quantities have nice factorized forms.…”
Section: Background On Symmetric Function Theorymentioning
confidence: 99%
“…We recall that, as mentioned in the introduction, there is a p-adic interpretation for coefficients sk λ/µ (t) and thus for c λ,µ (t). More precisely, sk λ/µ (t) = t n(λ)−n(µ) α λ (µ; t −1 ); where α λ (µ; p) is the number of subgroups of type µ in a finite abelian p-group of type λ, see [12] for example, and the references therein.…”
Section: The Q → 0 Limitmentioning
confidence: 99%
See 1 more Smart Citation