AbstractFor the study of the distribution of like objects on chessboards, i.e., rectangular arrays of square cells, with no lines (rows or columns) of the boards empty, the enumerators Ar, s(t) = ∑tmA(m; r, s) of r by s rectangles by number of objects, defined by (1+t)xy∑r,s=0(xr)(ys)Ar,s(t) are shown to hold a central position. Their properties and uses are examined at length
Wythoff queens is a classical combinatorial game related to very interesting mathematical results. A...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
Represent each square on a chessboard of arbitrary size by a point ( vertex ) and then, for every pa...
AbstractFor a unified approach to the study of the distributions of like objects on chessboards, the...
AbstractA recursion for determining exact numbers μ(m, n) of monomer-dimer configurations on m × n r...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
In this article it is shown how famous numbers like Pascal’s triangle, the Fibonaccinumbers, Catalan...
It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching ...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...
Puzzles on the chessboard have long been studied by mathematicians. Nat-urally, we do not restrict o...
AbstractA configuration of queens on an m × m chessboard is said to dominate the board if every squa...
Given a 2^k×2^k chessboard in which all white squares lie in the upper half and all black squares li...
AbstractRecently Chung, Graham, Morrison and Odlyzko [1] studied some combinatorial and asymptotic e...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
The classic puzzle of finding a closed knight’s tour on a chessboard consists of moving a knight fro...
Wythoff queens is a classical combinatorial game related to very interesting mathematical results. A...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
Represent each square on a chessboard of arbitrary size by a point ( vertex ) and then, for every pa...
AbstractFor a unified approach to the study of the distributions of like objects on chessboards, the...
AbstractA recursion for determining exact numbers μ(m, n) of monomer-dimer configurations on m × n r...
This master thesis discusses various mathematical problems related to the placement of chess pieces....
In this article it is shown how famous numbers like Pascal’s triangle, the Fibonaccinumbers, Catalan...
It is shown how the placement of non-attacking bishops on a chessboard C is related to the matching ...
Abstract. The function that counts the number of ways to place nonattacking identical chess or fairy...
Puzzles on the chessboard have long been studied by mathematicians. Nat-urally, we do not restrict o...
AbstractA configuration of queens on an m × m chessboard is said to dominate the board if every squa...
Given a 2^k×2^k chessboard in which all white squares lie in the upper half and all black squares li...
AbstractRecently Chung, Graham, Morrison and Odlyzko [1] studied some combinatorial and asymptotic e...
AbstractWe present some new solutions to the problem of arranging n queens on an n × n chessboard wi...
The classic puzzle of finding a closed knight’s tour on a chessboard consists of moving a knight fro...
Wythoff queens is a classical combinatorial game related to very interesting mathematical results. A...
AbstractThe q-analogue of a formula of Frobenius relating the Stirling numbers of the second kind to...
Represent each square on a chessboard of arbitrary size by a point ( vertex ) and then, for every pa...