相关论文: A $q$-Queens Problem. VI. The Bishops' Period

A bipartite graph is chordal bipartite if every cycle of length at least six has a chord in it. M$\ddot{\rm u}$ller \cite {muller1996Hamiltonian} has shown that the Hamiltonian cycle problem is NP-complete on chordal bipartite graphs by…

Consider these two distinct combinatorial objects: (1) the necklaces of length $n$ with at most $q$ colors, and (2) the multisets of integers modulo $n$ with subset sum divisible by $n$ and with the multiplicity of each element being…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…

Consider the random process that starts with $n$ vertices and no edges, where the edges of $K_n$ are added one at a time in a uniformly chosen random order $e_1, e_2,\ldots, e_{\binom{n}{2}}$. Let $T$ be the earliest time at which $e_1$…

We progress with the investigation started in article \cite{Roman2022}, namely the analysis of the asymptotic behaviour of $Q_{\mathcal{P}}(x)$ for different sets $\mathcal{P}$, where $Q_{\mathcal{P}}(x)$ is the element count of the set…

We study a statistic $\mathsf{traj}$ on the ordered pairs $(P,Q)$ of Dyck paths of size $n$, which counts the number of billiard trajectories in the grid polygon enclosed by $P$ and $-Q$, where $-Q$ is the path obtained by reflecting $Q$…

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 study k-dependence and half domination problems for king's graphs in dimension n (n>1). Various sharp bounds are provided and a few conjectures are formulated in the cases the estimates are not the best possible.

We consider a polling system: a queueing system of $N\ge 1$ queues with Poisson arrivals $Q_1,...,Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating…

We describe periods of irreducible holomorphic manifolds of $K3^{[n]}$-type with a non-symplectic automorphism of prime order $p\geq 3$. These turn out to lie on complex ball quotients and we are able to give a precise characterization of…

The well-known middle levels problem is to find a Hammiltonian cycle in the graph induced from the binary Hamming graph $\cH_2(2k+1)$ by the words of weight $k$ or $k+1$. In this paper we define the $q$-analog of the middle levels problem.…

We investigate the bi-orderability of two-bridge knot groups and the groups of knots with 12 or fewer crossings by applying recent theorems of Chiswell, Glass and Wilson. Amongst all knots with 12 or fewer crossings (of which there are…

For given posets $P$ and $Q$ and an integer $n$, the generalized Tur\'an problem for posets, asks for the maximum number of copies of $Q$ in a $P$-free subset of the $n$-dimensional Boolean lattice, $2^{[n]}$. In this paper, among other…

The positive existential theories of the sets $M_n(\mathbb N)$ without parameters build an inclusion lattice isomorhic with the lattice of divisibility. All these sets are algorithmically undecidable. In further sections some easier…

While iterating the quadratic polynomial f_{c}(x)=x^{2}+c the degree of the iterates grows very rapidly, and therefore solving the equations corresponding to periodic orbits becomes very difficult even for periodic orbits with a low period.…

The author has constructed and enumerated tours of knight having various magic properties on 4 x n and 6 x n boards. 16 magic tours of knight have been discovered on 4 x 18 board, 88 on 4 x 20 board, 464 on 4 x 22 board, 2076 on 4 x 24…

The period map for cubic fourfolds takes values in a locally symmetric variety of orthogonal type of dimension 20. We determine the image of this period map (thus confirming a conjecture of Hassett) and give at the same time a new proof of…

The billiard table is modeled as an $n$-dimensional box $[0,a_1]\times [0,a_2]\times \ldots \times [0,a_n] \subset \mathbb{R}^n$, with each side having real-valued lengths $a_i$ that are pairwise commensurable. A ball is launched from the…

We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem when G is restricted to the class of strongly orderable graphs,…