Michael J. Schlosser ; Meesue Yoo
-
Elliptic rook and file numbers
dmtcs:6362 -
Discrete Mathematics & Theoretical Computer Science,
April 22, 2020,
DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
-
https://doi.org/10.46298/dmtcs.6362
Elliptic rook and file numbersArticle
Authors: Michael J. Schlosser 1; Meesue Yoo 1
0000-0002-2612-2431##NULL
Michael J. Schlosser;Meesue Yoo
1 Fakultät für Mathematik [Wien]
In this work, we construct elliptic analogues of the rook numbers and file numbers by attaching elliptic weights to the cells in a board. We show that our elliptic rook and file numbers satisfy elliptic extensions of corre- sponding factorization theorems which in the classical case were established by Goldman, Joichi and White and by Garsia and Remmel in the file number case. This factorization theorem can be used to define elliptic analogues of various kinds of Stirling numbers of the first and second kind as well as Abel numbers. We also give analogous results for matchings of graphs, elliptically extending the result of Haglund and Remmel.
Jang Soo Kim;Michael J. Schlosser;Meesue Yoo, 2023, Enumeration of standard barely set-valued tableaux of shifted shapes, arXiv (Cornell University), 112, pp. 103727, 10.1016/j.ejc.2023.103727, http://arxiv.org/abs/2006.03253.
Matthias Schork, 2022, File Placements, Fractional Matchings, and Normal Ordering, Annals of Combinatorics, 26, 4, pp. 857-871, 10.1007/s00026-022-00599-y.
Michael J. Schlosser;Koushik Senapati;Ali K. Uncu, 2020, Log-concavity results for a biparametric and an elliptic extension of the q-binomial coefficients, arXiv (Cornell University), 17, 03, pp. 787-804, 10.1142/s1793042120400187, https://arxiv.org/abs/2002.07796.