Related papers: On Erd\H{o}s covering systems in global function f…
We introduce a $2$-approximation algorithm for the minimum total covering number problem.
In \cite{st2017}, the authors introduced the so-called \emph{general divide and color models}. One of the most well-known examples of such a model is the Ising model with external field $h = 0$, which has a color representation given by the…
This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\tilde{\Omega}(n^2)$ lower bounds for cornerstone problems,…
Motivated by applications in machine learning, such as subset selection and data summarization, we consider the problem of maximizing a monotone submodular function subject to mixed packing and covering constraints. We present a tight…
Moduli of rings and quadrilaterals are frequently applied in geometric function theory, see e.g. the Handbook by K\"uhnau. Yet their exact values are known only in a few special cases. Previously, the class of planar domains with polygonal…
Sufficient conditions for an ideal $\mathcal I$ in $R\Mod$ to be covering are proved. This allows to obtain an alternative proof of the existence of phantom covers of modules. Our approach is inspired by an extension of the standard…
The monotone minimal perfect hash function (MMPHF) problem is the following indexing problem. Given a set $S= \{s_1,\ldots,s_n\}$ of $n$ distinct keys from a universe $U$ of size $u$, create a data structure $DS$ that answers the following…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
According to the Erd\H{o}s discrepancy conjecture, for any infinite $\pm 1$ sequence, there exists a homogeneous arithmetic progression of unbounded discrepancy. In other words, for any $\pm 1$ sequence $(x_1,x_2,...)$ and a discrepancy…
As part of the graph minor project, Robertson and Seymour showed in 1990 that the class of graphs that can be embedded in a given surface can be characterized by a finite set of minimal excluded minors. However, their proof, because…
A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…
A new, constructive proof with a small explicit constant is given to the Erd\H{o}s-Pyber theorem which says that the edges of a graph on $n$ vertices can be partitioned into complete bipartite subgraphs so that every vertex is covered at…
In 1914 Lebesgue defined a "universal covering" to be a convex subset of the plane that contains an isometric copy of any subset of diameter 1. His challenge of finding a universal covering with the least possible area has been addressed by…
Enumerating the extremal submodular functions defined on subsets of a fixed base set has only been done for base sets up to five elements. This paper reports the results of attempting to generate all such functions on a six-element base…
In their seminal paper from 2004, Kuhn, Moscibroda, and Wattenhofer (KMW) proved a hardness result for several fundamental graph problems in the LOCAL model: For any (randomized) algorithm, there are input graphs with $n$ nodes and maximum…
Consider the algebraic function $\Phi_{g,n}$ that assigns to a general $g$-dimensional abelian variety an $n$-torsion point. A question first posed by Kronecker and Klein asks: What is the minimal $d$ such that, after a rational change of…
We construct an Euler system -- a compatible family of global cohomology classes -- for the Galois representations appearing in the geometry of Hilbert modular surfaces. If a conjecture of Bloch and Kato on injectivity of regulator maps…
In 1973, Erd\H{o}s conjectured the existence of high girth $(n,3,2)$-Steiner systems. Recently, Glock, K\"{u}hn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erd\H{o}s' conjecture. Just this year,…
The Hodge numbers of generic elliptically fibered Calabi-Yau threefolds over toric base surfaces fill out the "shield" structure previously identified by Kreuzer and Skarke. The connectivity structure of these spaces and bounds on the Hodge…
For a prime power $q$ and a positive integer $n$, we say a subspace $U$ of ${\mathbb{F}_q^n}$ is {\em cyclically covering} if the union of the cyclic shifts of $U$ is equal to $\mathbb{F}_q^n$. We investigate the problem of determining the…