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

We present an efficient quantum algorithm for the exact evaluation of either the fully ferromagnetic or anti-ferromagnetic q-state Potts partition function Z for a family of graphs related to irreducible cyclic codes. This problem is…

A remarkable extension of Rayleigh-Schroedinger perturbation method is found. Its (N+q) x (N+1) - dimensional Hamiltonians (as emerging, e.g., during quasi-exact constructions of bound states) are non-square matrices at q > 1. The role of…

Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…

Domineering is a two player game played on a checkerboard in which one player places dominoes vertically and the other places them horizontally. We give bivariate generating polynomials enumerating Domineering positions by the number of…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

In this work, we have introduced two innovative quantum algorithms: the Direct Column Algorithm and the Quantum Backtracking Algorithm to solve N-Queens problem, which involves the arrangement of $N$ queens on an $N \times N$ chessboard…

The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…

We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…

We develop algorithms for writing a polynomial as sums of powers of low degree polynomials. Consider an $n$-variate degree-$d$ polynomial $f$ which can be written as $$f = c_1Q_1^{m} + \ldots + c_s Q_s^{m},$$ where each $c_i\in…

The Macdonald polynomials expanded in terms of a modified Schur function basis have coefficients called the $q,t$-Kostka polynomials. We define operators to build standard tableaux and show that they are equivalent to creation operators…

We introduce a homological approach to exhibiting instances of Stembridge's q=-1 phenomenon. This approach is shown to explain two important instances of the phenomenon, namely that of partitions whose Ferrers diagrams fit in a rectangle of…

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…

Let $f(x)\in \mathbb{F}_q[x]$ be an irreducible polynomial of degree $m$ and exponent $e$, and $n$ be a positive integer such that $\nu_p(q-1)\ge \nu_{p}(e)+\nu_p(n)$ for all $p$ prime divisor of $n$. We show a fast algorithm to determine…

Planar quadratic differential systems occur in many areas of applied mathematics. Although more than one thousand papers have been written on these systems, a complete understanding of this family is still missing. Classical problems, and…

We compute the dimension $d_{n,r}(q) = \dim(\IR_q^r)$ of the defining module $\IR_q^r$ for the $q$-partition algebra. This module comes from $r$-iterations of Harish-Chandra restriction and induction on $\GL_n(\FF_q)$. This dimension is a…

The space of $n \times m$ complex matrices can be regarded as an algebraic variety on which the group ${\bf GL}_n \times {\bf GL}_m$ acts. There is a rich interaction between geometry and representation theory in this example. In an…

The representations of dimension vector $\alpha$ of the quiver Q can be parametrised by a vector space $R(Q,\alpha)$ on which an algebraic group $\Gl(\alpha)$ acts so that the set of orbits is bijective with the set of isomorphism classes…

Define $QC(n)$ to be the number of quasiplatonic topological actions of the cyclic group $C_n$ on surfaces of genus at least two. We use formulas of Benim and Wootton to give an explicit formula for $QC(n)$. In addition, we relate the…

We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…