AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to the Eulerian polynomials is given here a combinatorial interpretation. This leads to a number of results and conjectures concerning certain polynomials which may be viewed as q-analogues of the classical rook numbers. The latter count configurations of non-taking rooks in a given chess board
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractA statistic is found to combinatorially generate the cycle-counting q-hit numbers, defined a...
AbstractBriggs and Remmel [K.S. Briggs, J.B. Remmel, A p,q-analogue of a formula of Frobenius, Elect...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook con gurations to give a combinatorial inte...
AbstractIn ordinary rook theory, rook placements are associated to permutations of the symmetric gro...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
In this dissertation, we will study some generalizations of classical rook theory. The main focus is...
In this dissertation, we will study some generalizations of classical rook theory. The main focus is...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractIn ordinary rook theory, rook placements are associated to permutations of the symmetric gro...
In this paper, we define two natural (p, q)-analogues of the generalized Stirling numbers of the fir...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
AbstractBriggs and Remmel [K.S. Briggs, J.B. Remmel, A p,q-analogue of a formula of Frobenius, Elect...
AbstractWe study Garsia and Remmel'sq-analogue of the rook numbers and hit numbers associated with a...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractA statistic is found to combinatorially generate the cycle-counting q-hit numbers, defined a...
AbstractBriggs and Remmel [K.S. Briggs, J.B. Remmel, A p,q-analogue of a formula of Frobenius, Elect...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook con gurations to give a combinatorial inte...
AbstractIn ordinary rook theory, rook placements are associated to permutations of the symmetric gro...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
In this dissertation, we will study some generalizations of classical rook theory. The main focus is...
In this dissertation, we will study some generalizations of classical rook theory. The main focus is...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractIn ordinary rook theory, rook placements are associated to permutations of the symmetric gro...
In this paper, we define two natural (p, q)-analogues of the generalized Stirling numbers of the fir...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
AbstractBriggs and Remmel [K.S. Briggs, J.B. Remmel, A p,q-analogue of a formula of Frobenius, Elect...
AbstractWe study Garsia and Remmel'sq-analogue of the rook numbers and hit numbers associated with a...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractA statistic is found to combinatorially generate the cycle-counting q-hit numbers, defined a...
AbstractBriggs and Remmel [K.S. Briggs, J.B. Remmel, A p,q-analogue of a formula of Frobenius, Elect...
DOI
Add to ORKG