Related papers: A $q$-Queens Problem. IV. Attacking Configurations…

A new approach to the theory of polynomial solutions of q - difference equations is proposed. The approach is based on the representation theory of simple Lie algebras and their q - deformations and is presented here for U_q(sl(n)). First a…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…

The n-queens puzzle is a well-known combinatorial problem that requires to place n queens on an n x n chessboard so that no two queens can attack each other. Since the 19th century, this problem was studied by many mathematicians and…

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…

Given q non-attacking riders with r moves, the number of combinatorial types has not been found for r greater than 2 and q greater than 3. This paper aims to create upper and lower bound functions which can be applied to any q and r,…

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular,…

We consider the number \bar N(q) of points in the projective complement of graph hypersurfaces over \F_q and show that the smallest graphs with non-polynomial \bar N(q) have 14 edges. We give six examples which fall into two classes. One…

In this paper, we get the generating functions of q-Chebyshev polynomials using operator. Also considering explicit formulas of q-Chebyshev polynomials, we give new generalizations of q-Chebyshev polynomials called incomplete q-Chebyshev…

We study a class polynomials obtained from an enumeration of the number of queen paths. In particular, we find the generating function for the diagonal sequence of this table and the zero distribution of a sequence of related polynomials.

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…

In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of ways to place a fixed set of polyominos on an $n\times n$…

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 study the ring of quasisymmetric polynomials in $n$ anticommuting (fermionic) variables. Let $R_n$ denote the polynomials in $n$ anticommuting variables. The main results of this paper show the following interesting facts about…

This survey paper contains a tutorial introduction to distance-regular graphs, with an emphasis on the subconstituent algebra and the $Q$-polynomial property.

We determine the structure of the partition algebra $P_n(Q)$ (a generalized Temperley-Lieb algebra) for specific values of $Q \in \C$, focusing on the quotient which gives rise to the partition function of $n$ site $Q$-state Potts models…

We determine the minimal bi-degree(s) of an irreducible filling curve over $\mathbb{F}_q$ for $\mathbb{P}^1\times \mathbb{P}^1$. It is $(q+1, q+1)$ if $q\neq 2$, and they are $(4,3)$ and $(3,4)$ if $q=2$.

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

The q-state Potts model can be defined on an arbitrary finite graph, and its partition function encodes much important information about that graph, including its chromatic polynomial, flow polynomial and reliability polynomial. The complex…

This paper aims to study the graph radii and diameters induced by the $k$-dimensional versions of the well-known six international chess pieces on every finite $\{n \times n \times \dots \times n\} \subseteq \mathbb{Z}^k$ lattice since they…