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 ORCID1; Meesue Yoo 1

  • 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.


Volume: DMTCS Proceedings, 28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)
Published on: April 22, 2020
Imported on: July 4, 2016
Keywords: Combinatorics,[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

7 Documents citing this article

Consultation statistics

This page has been seen 262 times.
This article's PDF has been downloaded 226 times.