Related papers: The N-queens Problem on a symmetric Toeplitz matri…
A famous (and hard) chess problem asks what is the maximum number of safe squares possible in placing $n$ queens on an $n\times n$ board. We examine related problems from placing $n$ rooks. We prove that as $n\to\infty$, the probability…
In this paper we study queen's graphs, which encode the moves by a queen on an $n\times m$ chess board, through the lens of chip-firing games. We prove that their gonality is equal to $nm$ minus the independence number of the graph, and…
We study different domination problems of attacking and non-attacking rooks and queens on polyominoes and polycubes of all dimensions. Our main result proves that maximum independent domination is NP-complete for non-attacking queens and…
It is well known that square matrices with independent and identically distributed (iid) random entries are typically well conditioned. A natural question is whether this favorable behavior persists for random matrices whose entries obey…
Some preliminary results are reported on the equivalence of any n-queens problem with the roots of a Boolean valued quadratic form via a generic dimensional reduction scheme. It is then proven that the solutions set is encoded in the…
We derive recurrences and closed-form expressions for counting nonattacking placements of two types of chess pieces with unbounded straight-line moves, namely the bishop (two diagonal moves) and the anassa (one horizontal or vertical move…
Using a bijective proof, we show the number of ways to arrange a maximum number of nonattacking pawns on a $2m\times 2m$ chessboard is ${2m\choose m}^2$, and more generally, the number of ways to arrange a maximum number of nonattacking…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
We consider banded block Toeplitz matrices $T_n$ with $n$ block rows and columns. We show that under certain technical assumptions, the normalized eigenvalue counting measure of $T_n$ for $n\to\infty$ weakly converges to one component of…
Graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem, i.e., if two vertices are adjacent, their assigned colors must be the same or at least one of them is…
In this paper, we derive simple closed-form expressions for the $n$-queens problem and three related problems in terms of permanents of $(0,1)$ matrices. These formulas are the first of their kind. Moreover, they provide the first method…
We consider real orthogonal $n\times n$ matrices whose diagonal entries are zero and off-diagonal entries nonzero, which we refer to as $\mathrm{OMZD}(n)$. We show that there exists an $\mathrm{OMZD}(n)$ if and only if $n\neq 1,\ 3$, and…
The $m \times n$ king graph consists of all locations on an $m \times n$ chessboard, where edges are legal moves of a chess king. %where each vertex represents a square on a chessboard and each edge is a legal move. Let $P_{m \times n}(z)$…
The "square peg problem" or "inscribed square problem" of Toeplitz asks if every simple closed curve in the plane inscribes a (non-degenerate) square, in the sense that all four vertices of that square lie on the curve. By a variety of…
We study linear preserver problems on the linear space of $n\times n$ Toeplitz matrices over the real field or the complex field. In particular, characterizations are given for linear preservers of rank one matrices and linear preservers of…
We study the domination number $\gamma(Q_n^3)$ of the three-dimensional $n \times n \times n$ queen graph. The main result is a stratified theorem computing, for each position type -- corner, edge, face, or interior -- the number of…
We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…
In this paper, we study the matrix period and the competition period of Toeplitz matrices over a binary Boolean ring $\mathbb{B} = \{0,1\}$. Given subsets $S$ and $T$ of $\{1,\ldots,n-1\}$, an $n\times n$ Toeplitz matrix $A=T_n\langle S ; T…
This paper is concerned with a covering problem of Euclidean space by a particular arrangement of cones that are not necessarily full and are allowed to overlap. The problem provides an equivalent geometric reformulation of the solvability…
For each non-negative integer $n$ let $\mathcal{A}_n$ be an $n+1$ by $n+1$ Toeplitz matrix over a finite field, $F$, and suppose for each $n$ that $\mathcal{A}_n$ is embedded in the upper left corner of $\mathcal{A}_{n+1}$. We study the…