Related papers: A $q$-Queens Problem. I. General Theory
We consider the problem of counting matrices over a finite field with fixed rank and support contained in a fixed set. The count of such matrices gives a $q$-analogue of the classical rook and hit numbers, known as the $q$-rook and $q$-hit…
In his list of open problems, Martin Erickson described a certain game: "Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is…
We define a counting function that is related to the binomial coefficients. An explicit formula for this function is proved. In some particular cases, simpler explicit formuls are derived. We also derive a formula for the number of…
Exact solution to many problems in mathematical physics and quantum field theory often can be expressed in terms of an algebraic curve equipped with a meromorphic differential. Typically, the geometry of the curve can be seen most clearly…
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$…
We prove a new tableaux formula for the symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ that has considerably fewer terms and simpler weights than previously existing formulas. Our formula is a sum over certain sorted non-attacking…
The N-Queens problem, placing all N queens in a N x N chessboard where none attack the other, is a classic problem for constraint satisfaction algorithms. While complete methods like backtracking guarantee a solution, their exponential time…
Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a…
We examine from an invariant theory viewpoint the monoid algebras for two monoids having large symmetry groups. The first monoid is the free left-regular band on $n$ letters, defined on the set of all injective words, that is, the words…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
We consider the problem of finding the number of matrices over a finite field with a certain rank and with support that avoids a subset of the entries. These matrices are a q-analogue of permutations with restricted positions (i.e., rook…
This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…
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…
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 study the orthogonality conditions satisfied by the classical q-orthogonal polynomials that are located at the top of the q-Hahn tableau (big q-jacobi polynomials (bqJ)) and the Nikiforov-Uvarov tableau (Askey-Wilson…
The topological quantum number Q of a superconducting or chiral insulating wire counts the number of stable bound states at the end points. We determine Q from the matrix r of reflection amplitudes from one of the ends, generalizing the…
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…
Recent advances in Quantum Topology assign $q$-series to knots in at least three different ways. The $q$-series are given by generalized Nahm sums (i.e., special $q$-hypergeometric sums) and have unknown modular and asymptotic properties.…
We discuss the problem posed by Bender, Coley, Robbins and Rumsey of enumerating the number of subspaces which have a given profile with respect to a linear operator over the finite field $\mathbb{F}_q$. We solve this problem in the case…
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…