Add to ORKGRook polynomials count number of ways of placing non-attacking rooks on a board. One application of these polynomials is to count number of ways of matching two sets of objects, such as tasks with employees. In this talk, we consider a special type of boards called the Ferrers boards in which from left to the right the column heights do not decrease. The rook polynomials of these boards can be calculated easily using the column heights, which makes these boards special. In this talk we will investigate generalizations of Ferrers boards in higher dimensions
AbstractBy a simple trick we may generalise the rook polynomial for an n×n chessboard to various two...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
Abstract. By means of the Ehrhart theory of inside-out polytopes we establish a general counting the...
AbstractA theorem contained in the paper ‘A combinatoric formula’ by Wang, Lee and Tan (J. Math. Ana...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractIn classical rook theory there is a fundamental relationship between the rook numbers and th...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
Partition the rows of a board into sets of m rows called levels. An m-level rook placement is a subs...
AbstractIn this paper we provide the first general expressions for the rook and factorial polynomial...
In this paper, we studied the game of chess, the rook and its movements to capture pieces in the sam...
It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching ...
AbstractChung and Graham's cover polynomial is a generalization of the factorial rook polynomial in ...
AbstractFan Chung and Ron Graham (J. Combin. Theory Ser. B 65 (1995) 273–290) introduced the cover p...
AbstractBy a simple trick we may generalise the rook polynomial for an n×n chessboard to various two...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
Abstract. By means of the Ehrhart theory of inside-out polytopes we establish a general counting the...
AbstractA theorem contained in the paper ‘A combinatoric formula’ by Wang, Lee and Tan (J. Math. Ana...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractGeneralizing the notion of placing rooks on a Ferrers board leads to a new class of combinat...
AbstractIn classical rook theory there is a fundamental relationship between the rook numbers and th...
AbstractIn this paper we introduce invisible permutations and rook length polynomials. We prove a re...
Partition the rows of a board into sets of m rows called levels. An m-level rook placement is a subs...
AbstractIn this paper we provide the first general expressions for the rook and factorial polynomial...
In this paper, we studied the game of chess, the rook and its movements to capture pieces in the sam...
It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching ...
AbstractChung and Graham's cover polynomial is a generalization of the factorial rook polynomial in ...
AbstractFan Chung and Ron Graham (J. Combin. Theory Ser. B 65 (1995) 273–290) introduced the cover p...
AbstractBy a simple trick we may generalise the rook polynomial for an n×n chessboard to various two...
Rook theory is the study of permutations described using terminology from the game of chess. In rook...
Abstract. By means of the Ehrhart theory of inside-out polytopes we establish a general counting the...