scholarly journals Elliptic Rook and File Numbers

10.37236/6121 ◽  
2017 ◽  
Vol 24 (1) ◽  
Author(s):  
Michael J. Schlosser ◽  
Meesue Yoo
Keyword(s):  
Stirling Numbers ◽  
Classical Case ◽  
Factorization Theorem ◽  
Rook Numbers ◽  
Generalized Stirling Numbers ◽  
Independent Parameters ◽  
Ferrers Boards

Utilizing elliptic weights, we construct an elliptic analogue of rook numbers for Ferrers boards. Our elliptic rook numbers generalize Garsia and Remmel's $q$-rook numbers by two additional independent parameters $a$ and $b$, and a nome $p$. The elliptic rook numbers are shown to satisfy an elliptic extension of a  factorization theorem which in the classical case was established by Goldman, Joichi and White and extended to the $q$-case by Garsia and Remmel. We obtain similar results for elliptic analogues of Garsia and Remmel's $q$-file numbers for skyline boards. We also provide an elliptic extension of the $j$-attacking model introduced by Remmel and Wachs. Various applications of our results include elliptic analogues of (generalized) Stirling numbers of the first and second kind, Lah numbers, Abel numbers, and $r$-restricted versions thereof.

scholarly journals Elliptic rook and file numbers

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Michael J. Schlosser ◽  
Meesue Yoo
Keyword(s):  
Stirling Numbers ◽  
Classical Case ◽  
Factorization Theorem ◽  
Rook Numbers ◽  
International Audience ◽  
Number Case

International audience 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.

scholarly journals On a New Family of Generalized Stirling and Bell Numbers

10.37236/564 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Toufik Mansour ◽  
Matthias Schork ◽  
Mark Shattuck
Keyword(s):  
Closed Form ◽  
Generating Function ◽  
Recursion Relation ◽  
Stirling Numbers ◽  
Combinatorial Interpretation ◽  
Bell Numbers ◽  
New Family ◽  
Exponential Generating Function ◽  
Rook Numbers ◽  
Generalized Stirling Numbers

A new family of generalized Stirling and Bell numbers is introduced by considering powers $(VU)^n$ of the noncommuting variables $U,V$ satisfying $UV=VU+hV^s$. The case $s=0$ (and $h=1$) corresponds to the conventional Stirling numbers of second kind and Bell numbers. For these generalized Stirling numbers, the recursion relation is given and explicit expressions are derived. Furthermore, they are shown to be connection coefficients and a combinatorial interpretation in terms of statistics is given. It is also shown that these Stirling numbers can be interpreted as $s$-rook numbers introduced by Goldman and Haglund. For the associated generalized Bell numbers, the recursion relation as well as a closed form for the exponential generating function is derived. Furthermore, an analogue of Dobinski's formula is given for these Bell numbers.

scholarly journals A $p,q$-analogue of a Formula of Frobenius

10.37236/1702 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Karen S. Briggs ◽  
Jeffrey B. Remmel
Keyword(s):  
Stirling Numbers ◽  
Combinatorial Interpretation ◽  
Eulerian Polynomials ◽  
Major Index ◽  
Rook Placements ◽  
Rook Numbers ◽  
Nonnegative Coefficients ◽  
Ferrers Boards

Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook configurations to give a combinatorial interpretation to the $q$-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to the Eulerian polynomials. Later, Remmel and Wachs defined generalized $p,q$-Stirling numbers of the first and second kind in terms of rook placements. Additionally, they extended their definition to give a $p,q$-analogue of rook numbers for arbitrary Ferrers boards. In this paper, we use Remmel and Wach's definition and an extension of Garsia and Remmel's proof to give a combinatorial interpretation to a $p,q$-analogue of a formula of Frobenius relating the $p,q$-Stirling numbers of the second kind to the trivariate distribution of the descent number, major index, and comajor index over $S_n$. We further define a $p,q$-analogue of the hit numbers, and show analytically that for Ferrers boards, the $p,q$-hit numbers are polynomials in $(p,q)$ with nonnegative coefficients.

scholarly journals Unimodality properties of generalized Stirling numbers

2015 ◽  
Vol 45 (9) ◽  
pp. 1583-1586
Author(s):  
Yi WANG ◽  
BaoXuan ZHU ◽  
Lily Li LIU
Keyword(s):  
Stirling Numbers ◽  
Generalized Stirling Numbers

scholarly journals On $xD$-Generalizations of Stirling Numbers and Lah Numbers via Graphs and Rooks

10.37236/6699 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Yu-Chang Liang ◽  
Tsai-Lien Wong
Keyword(s):  
Weyl Algebra ◽  
Stirling Numbers ◽  
Stirling Number ◽  
Combinatorial Structures ◽  
Normal Ordering ◽  
Rook Placements ◽  
Threshold Graphs ◽  
Combinatorial Interpretations ◽  
Ferrers Boards

This paper studies the generalizations of the Stirling numbers of both kinds and the Lah numbers in association with the normal ordering problem in the Weyl algebra $W=\langle x,D|Dx-xD=1\rangle$. Any word $\omega\in W$ with $m$ $x$'s and $n$ $D$'s can be expressed in the normally ordered form $\omega=x^{m-n}\sum_{k\ge 0} {{\omega}\brace {k}} x^{k}D^{k}$, where ${{\omega}\brace {k}}$ is known as the Stirling number of the second kind for the word $\omega$. This study considers the expansions of restricted words $\omega$ in $W$ over the sequences $\{(xD)^{k}\}_{k\ge 0}$ and $\{xD^{k}x^{k-1}\}_{k\ge 0}$. Interestingly, the coefficients in individual expansions turn out to be generalizations of the Stirling numbers of the first kind and the Lah numbers. The coefficients will be determined through enumerations of some combinatorial structures linked to the words $\omega$, involving decreasing forest decompositions of quasi-threshold graphs and non-attacking rook placements on Ferrers boards. Extended to $q$-analogues, weighted refinements of the combinatorial interpretations are also investigated for words in the $q$-deformed Weyl algebra.

scholarly journals On a Class of Combinatorial Sums Involving Generalized Factorials

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
W.-S. Chou ◽  
L. C. Hsu ◽  
P. J.-S. Shiue
Keyword(s):  
Stirling Numbers ◽  
Combinatorial Sums ◽  
Generalized Stirling Numbers

The object of this paper is to show that generalized Stirling numbers can be effectively used to evaluate a class of combinatorial sums involving generalized factorials.

The multiset partitions and the generalized Stirling numbers

2020 ◽  
Vol 31 (5-6) ◽  
pp. 813-831
Author(s):  
Miloud Mihoubi ◽  
Asmaa Rahim ◽  
Said Taharbouchet
Keyword(s):  
Stirling Numbers ◽  
Generalized Stirling Numbers

scholarly journals Modified approach to generalized Stirling numbers via differential operators

2010 ◽  
Vol 23 (1) ◽  
pp. 115-120 ◽  
Author(s):  
B.S. El-Desouky ◽  
Nenad P. Cakić ◽  
Toufik Mansour
Keyword(s):  
Differential Operators ◽  
Stirling Numbers ◽  
Generalized Stirling Numbers

scholarly journals A Newton Interpolation Approach to Generalized Stirling Numbers

2012 ◽  
Vol 2012 ◽  
pp. 1-17 ◽  
Author(s):  
Aimin Xu
Keyword(s):  
Explicit Expression ◽  
Recurrence Relation ◽  
Generating Function ◽  
Stirling Numbers ◽  
Divided Differences ◽  
Newton Interpolation ◽  
Basic Properties ◽  
Generalized Stirling Numbers

We employ the generalized factorials to define a Stirling-type pair{s(n,k;α,β,r),S(n,k;α,β,r)}which unifies various Stirling-type numbers investigated by previous authors. We make use of the Newton interpolation and divided differences to obtain some basic properties of the generalized Stirling numbers including the recurrence relation, explicit expression, and generating function. The generalizations of the well-known Dobinski's formula are further investigated.

Sign in / Sign up

Export Citation Format

Share Document