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

Elliptic extensions of the alpha-parameter model and the rook model for matchings

Abstract: We construct elliptic extensions of the alpha-parameter rook model introduced by Goldman and Haglund and of the rook model for matchings of Haglund and Remmel. In particular, we extend the product formulas of these models to the elliptic setting. By specializing the parameter α in our elliptic extension of the alpha-parameter model and the shape of the Ferrers board in different ways, we obtain elliptic analogues of the Stirling numbers of the first kind and of the Abel polynomials, and obtain an a, q-analogue… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
11
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 7 publications
(12 citation statements)
references
References 22 publications
1
11
0
Order By: Relevance
“…The elliptic case is more intricate than the q-case and requires a very careful choice of weights. Our factorization theorem for elliptic rook numbers for matchings of l-lazy graphs in [37] generalizes the factorization theorem by Haglund and Remmel already in the ordinary case and the q-case. In the simplest case, our formula can be used to deduce an elliptic extension of the numbers of perfect matchings of the complete graph K 2n .…”
Section: 2supporting
confidence: 61%
See 1 more Smart Citation
“…The elliptic case is more intricate than the q-case and requires a very careful choice of weights. Our factorization theorem for elliptic rook numbers for matchings of l-lazy graphs in [37] generalizes the factorization theorem by Haglund and Remmel already in the ordinary case and the q-case. In the simplest case, our formula can be used to deduce an elliptic extension of the numbers of perfect matchings of the complete graph K 2n .…”
Section: 2supporting
confidence: 61%
“…By considering rook placements on shifted Ferrers boards subject to a suitable modification of rook cancellation, Haglund and Remmel [23] developed a q-rook theory for matchings of graphs. We provide an elliptic extension of this rook theory in [37]. We actually consider a more general model there related to matchings on certain graphs which we call "l-lazy graphs" with respect to a N-dimensional vector of positive integers l = (l 1 , .…”
Section: 2mentioning
confidence: 99%
“…For an introduction to classical rook theory, see [4]. A lot of material on generalized rook theory which we survey is borrowed from our papers [18,19,20] on elliptic rook theory. As mentioned in the introduction, the (a; q)-case is just a special case of the elliptic case which admits particularly attractive closed formulas.…”
Section: (A; Q)-rook Theorymentioning
confidence: 99%
“…The left-hand side of (3.8) is the result of computing the above weight sum columnwise, and the right-hand side can be obtained by computing the weight of the cells in B and and the cells in the extended part separately. For the details, see [20].…”
Section: (A;mentioning
confidence: 99%
See 1 more Smart Citation