2012
DOI: 10.1016/j.aam.2012.06.002
|View full text |Cite
|
Sign up to set email alerts
|

Narayana polynomials and Hall–Littlewood symmetric functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2020
2020

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 23 publications
0
6
0
Order By: Relevance
“…It is known that the generalized Narayana numbers associated with finite Coxeter groups have only real roots, see [21, §5.2]. Remark 6.13 The polynomials z p,p+1 and z p,p , as well as the polynomials F for forks seem to appear in the article [14], which deals with symmetric functions. The relationship with the present work is not clear to us.…”
Section: Conjecture 611mentioning
confidence: 99%
“…It is known that the generalized Narayana numbers associated with finite Coxeter groups have only real roots, see [21, §5.2]. Remark 6.13 The polynomials z p,p+1 and z p,p , as well as the polynomials F for forks seem to appear in the article [14], which deals with symmetric functions. The relationship with the present work is not clear to us.…”
Section: Conjecture 611mentioning
confidence: 99%
“…Using known results about generating functions [37,38], we have For more details we refer to [21] and references therein.…”
Section: Leading Termsmentioning
confidence: 99%
“…The formula of Lassalle for the Narayana polynomials. It has been observed by M. Lassalle [10] that the Narayana polynomials c n (q) could be expressed in the form (85) qc n (q) = 1 n + 1 h n ((n + 1)q) in λ-ring notation, with the assumption that x = 1 − q is of rank 1. Otherwise said,…”
Section: 1mentioning
confidence: 99%
“…Finally, we illustrate the idea that combinatorial series derived by means of Lagrange inversion should come from some character of the algebra of parking functions. First, we generalize Lassalle's expression [10] of the Narayana polynomials c n (t) to super-Narayana polynomials P n (t, q) counting signed parking functions according to certain statistics, and such that P n (t, 0) = (1 + t)c n (1 + t). This last polynomial is known to count Schröder paths according to the number of horizontal steps [26, A060693].…”
Section: Introductionmentioning
confidence: 99%