AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinatorial models and a new class of rook polynomials. Connections are established with absolute Stirling numbers and permutations, Bessel polynomials, matchings, multiset permutations, hypergeometric functions, Abel polynomials and forests, and polynomial sequences of binomial type. Factorization and reciprocity theorems are proved and a q-analogue is given
AbstractSuppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boar...
AbstractIn classical rook theory there is a fundamental relationship between the rook numbers and th...
In this paper, we studied the game of chess, the rook and its movements to capture pieces in the sam...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
AbstractIn ordinary rook theory, rook placements are associated to permutations of the symmetric gro...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
AbstractConnections betweenq-rook polynomials and matrices over finite fields are exploited to deriv...
Abstract. There are a number of so-called factorization theorems for rook polynomials that have appe...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractA theorem contained in the paper ‘A combinatoric formula’ by Wang, Lee and Tan (J. Math. Ana...
Rook polynomials count number of ways of placing non-attacking rooks on a board. One application of ...
Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook con gurations to give a combinatorial inte...
AbstractIn 1987, Garsia and Remmel proved a theorem that two Ferrers boards share the same rook poly...
AbstractSuppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boar...
AbstractSuppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boar...
AbstractIn classical rook theory there is a fundamental relationship between the rook numbers and th...
In this paper, we studied the game of chess, the rook and its movements to capture pieces in the sam...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
AbstractIn ordinary rook theory, rook placements are associated to permutations of the symmetric gro...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
AbstractConnections betweenq-rook polynomials and matrices over finite fields are exploited to deriv...
Abstract. There are a number of so-called factorization theorems for rook polynomials that have appe...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractA theorem contained in the paper ‘A combinatoric formula’ by Wang, Lee and Tan (J. Math. Ana...
Rook polynomials count number of ways of placing non-attacking rooks on a board. One application of ...
Garsia and Remmel (JCT. A 41 (1986), 246-275) used rook con gurations to give a combinatorial inte...
AbstractIn 1987, Garsia and Remmel proved a theorem that two Ferrers boards share the same rook poly...
AbstractSuppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boar...
AbstractSuppose μ and ν are integer partitions of n, and N>n. It is well known that the Ferrers boar...
AbstractIn classical rook theory there is a fundamental relationship between the rook numbers and th...
In this paper, we studied the game of chess, the rook and its movements to capture pieces in the sam...