Related papers: A $q$-Queens Problem. III. Nonattacking Partial Qu…
The goal is to make a global study of the family QsnSN of all real quadratic polynomial differential systems which have a finite semi-elemental saddle-node and an infinite saddle-node formed by the collision of two infinite singular points.…
The algebraic area probability distribution of closed planar random walks of length N on a square lattice is considered. The generating function for the distribution satisfies a recurrence relation in which the combinatorics is encoded. A…
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 study a random polynomial of degree $n$ over the finite field $\mathbb{F}_q$, where the coefficients are independent and identically distributed and uniformly chosen from the squares in $\mathbb{F}_q$. Our main result demonstrates that…
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…
Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have shown that these games can be solved in quasi-polynomial time. We show that their algorithm can be implemented efficiently: we use their…
In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…
We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…
In this work, we consider a class of $n$-dimensional, $n\geq2$, piecewise linear discontinuous maps that can exhibit a new type of attractor, called a weird quasiperiodic attractor. While the dynamics associated with these attractors may…
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…
An arrangement of $n$ curves in the plane is given. The query is a point $q$ and the goal is to find the face of the arrangement that contains $q$. A data-structure for point-location, preprocesses the curves into a data structure 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…
We consider $m$-divisible non-crossing partitions of $\{1,2,\ldots,mn\}$ with the property that for some $t\leq n$ no block contains more than one of the first $t$ integers. We give a closed formula for the number of multi-chains of such…
We observe that a class of quarter-BPS dyons in N=4 theories with charge vector (Q, P) and with nontrivial values of the arithmetic duality invariant I := gcd (Q wedge P) are nonperturbative in one frame but perturbative in another frame.…
Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…
We investigate the superposition of four different quantum states based on the $q$-oscillator. These quantum states are expressed by means of Rogers-Szeg\"o polynomials. We show that such a superposition has the properties of the quantum…
This paper addresses the problem of finding $Q_{m,t}\left(n\right)$, the number of possible ways to partition any member $n$ of the cyclic group $\mathbb{Z}/m\mathbb{Z}$ into $t$ distinct parts. When $m$ is odd, it was previously known that…
1. We first show a lower bound of 2N/3-1 for the connected minimum queen domination (or cover) problem on the NXN chessboard - the upper bound is only 2 higher at most and is easy to show. 2. We then define the k-colored connected minimum…
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 probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…