Related papers: Covering systems with odd moduli
This exploratory paper considers the notion of a covering of a configuration and $G$-coverings which are coverings that are quotients under a semi-regular group action. We consider prime configurations, those which cannot $G$-cover other…
An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…
The odd-red bipartite perfect matching problem asks to find a perfect matching containing an odd number of red edges in a given red-blue edge-colored bipartite graph. While this problem lies in $\mathsf{P}$, its polyhedral structure remains…
We exhibit a new application of two dimensional covering systems, examples of integer pairs $a,b$ for which $a^m-b^n$ has a prime divisor from some given finite set of primes, for every pair of integers $m,n\geq 0$. This leads us to…
We study the wall-crossing for moduli spaces of coherent systems of dimension one and order one on a smooth projective variety over the complex numbers. We compute the topological Euler characteristic of the moduli spaces in the particular…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
In a research seminar in $2006$, M. Filaseta, O. Trifonov, and G. Yu showed for each integer $n\geq3$ there is no distinct covering with all moduli in the interval $[n, 6n]$. In $2022$, this interval was subsequently improved to $[n, 8n]$…
This is a contribution to the number theory of the dimer problem. The number of dimer coverings (i.e., perfect matchings) of a square lattice graph is discussed modulo powers of 2.
In 2007, Zhi-Wei Sun defined a \emph{covering number} to be a positive integer $L$ such that there exists a covering system of the integers where the moduli are distinct divisors of $L$ greater than 1. A covering number $L$ is called…
Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…
There have been major developments in the theory of moduli of varieties in the past decade, essentially settling the construction of moduli spaces of log canonically polarized slc pairs and moduli spaces of K-polystable log Fano pairs.…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
Hub Covering Problems arise in various practical domains, such as urban planning, cargo delivery systems, airline networks, telecommunication network design, and e-mobility. The task is to select a set of hubs that enable tours between…
In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…
In 1859, Ernst E. Kummer \cite{erns} introduced the concept prime ideal and after that in 1983 this concept was generalized to prime submodules by R. McCasland \cite{mcca}. In this article, by considering complexes as a generalization of…
Let $X$ be a smooth projective algebraic curve of genus $g\geq 2$ defined over a field $K$. We show that $X$ can be defined over its field of moduli if it has odd signature, i.e. if the signature of the covering $X\to X/\Aut(X)$ is of type…
Around 1970 Griffiths introduced the moduli of polarized Hodge structures/the period domain $D$ and described a dream to enlarge $D$ to a moduli space of degenerating polarized Hodge structures. Since in general $D$ is not a Hermitian…
A variant of the well-known Set Covering Problem is studied in this paper, where subsets of a collection have to be selected, and pairwise conflicts among subsets of items exist. The selection of each subset has a cost, and the inclusion of…
The aim of this work is to study the structure and properties of the binary LCD codes having an automorphisms of odd prime order and to present a method for their construction.
The study of the moduli of covers of the projective line leads to the theory of Hurwitz varieties covering configuration varieties. Certain one-dimensional slices of these coverings are particularly interesting Belyi maps. We present…