Related papers: On Erd\H{o}s covering systems in global function f…

Given a collection S of subsets of some set U, and M a subset of U, the set cover problem is to find the smallest subcollection C of S such that M is a subset of the union of the sets in C. While the general problem is NP-hard to solve,…

A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…

We characterize the limiting behavior of partial sums of multiplicative functions $f:\mathbb{F}_q[t]\to S^1$. In contrast to the number field setting, the characterization depends crucially on whether the notion of discrepancy is defined…

Error bounds have been studied for more than seventy years, beginning with the seminal result of Hoffman (1952) [{\it J. Res. Natl. Bur. Standards}, 49 (1952), 263--265], which establishes an upper bound for the distance from an arbitrary…

In this paper, we study a novel problem, Minimum Robust Multi-Submodular Cover for Fairness (MinRF), as follows: given a ground set $V$; $m$ monotone submodular functions $f_1,...,f_m$; $m$ thresholds $T_1,...,T_m$ and a non-negative…

For an integer $s\ge 1$, let $\mathcal{C}_s(q_0)$ be the generalized Zetterberg code of length $q_0^s+1$ over the finite field $\F_{q_0}$ of odd characteristic. Recently, Shi, Helleseth, and \"{O}zbudak (IEEE Trans. Inf. Theory 69(11):…

We employ analytic number theoretic techniques, specifically character sums and Weil type estimates, to study the covering radius of the generalized Zetterberg codes over all finite fields. Although the even and odd field cases require…

Erd\H{o}s asked many mathematical questions. Some lead to exciting research, others turned out to be easily solved. In this article, we provide evidence that one of his questions, Erd\H{o}s problem \#278 , has no general answer. We do so by…

In the submodular cover problem, we are given a non-negative monotone submodular function $f$ over a ground set $E$ of items, and the goal is to choose a smallest subset $S \subseteq E$ such that $f(S) = Q$ where $Q = f(E)$. In the…

Enochs' conjecture asserts that each covering class of modules (over any fixed ring) has to be closed under direct limits. Although various special cases of the conjecture have been verified, the conjecture remains open in its full…

This article is an extended version of preprint math.AG/9902104. We find an explicit formula for the number of topologically different ramified coverings of a sphere by a genus g surface with only one complicated branching point in terms of…

Let $S_g$ be a closed orientable surface of genus $g\geq 2$. A collection $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $S_g$ such that $\gamma_i$ and $\gamma_j$ are in minimal position, is…

We investigate the densities of the sets of abundant numbers and of covering numbers, integers $n$ for which there exists a distinct covering system where every modulus divides $n$. We establish that the set $\mathcal{C}$ of covering…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…

P. Erd\H{o}s conjectured in 1962 that on the ring $\mathbb{Z}$, every set of $n$ congruence classes in $\mathbb{Z}$ that covers the first $2^n$ positive integers also covers the ring $\mathbb{Z}$. This conjecture was first confirmed in 1970…

In the MINIMUM CONVEX COVER (MCC) problem, we are given a simple polygon $\mathcal P$ and an integer $k$, and the question is if there exist $k$ convex polygons whose union is $\mathcal P$. It is known that MCC is $\mathsf{NP}$-hard…

Let $\Lambda$ be the limit set of an infinite conformal iterated function system and let $F$ denote the set of fixed points of the maps. We prove that the box dimension of $\Lambda$ exists if and only if \[ \overline{\dim}_{\mathrm B} F\leq…

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…

A set cover of a hypergraph $H$ is a set of vertices intersecting every hyperedge. In the minimum sum set cover problem, vertices are selected one by one; each edge pays the position of the first vertex that hits it, and the objective is to…