Related papers: Erd\H{o}s covering systems
Finite covers are a technique for building new structures from simpler ones. The original motivation to study finite covers is in the Ladder theorem of Zilber which describes how totally categorical structures are built from strictly…
We determine the structure of the Hodge ring, a natural object encoding the Hodge numbers of all compact Kaehler manifolds. As a consequence of this structure, there are no unexpected relations among the Hodge numbers, and no essential…
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.
We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…
Ends and end cohomology are powerful invariants for the study of noncompact spaces. We present a self-contained exposition of the topological theory of ends and prove novel extensions including the existence of an exhaustion of a proper…
This paper aims to undertake an exploration of the behavior of the moduli space of line arrangements while establishing its combinatorial interplay with the incidence structure of the arrangement. In the first part, we investigate…
The study of embedded minimal surfaces in $\RR^3$ is a classical problem, dating to the mid 1700's, and many people have made key contributions. We will survey a few recent advances, focusing on joint work with Tobias H. Colding of MIT and…
The triangle covering number of a graph is the minimum number of vertices that hit all triangles. Given positive integers $s,t$ and an $n$-vertex graph $G$ with $\lfloor n^2/4 \rfloor +t$ edges and triangle covering number $s$, we determine…
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…
A packing by a body $K$ is collection of congruent copies of $K$ (in either Euclidean or hyperbolic space) so that no two copies intersect nontrivially in their interiors. A covering by $K$ is a collection of congruent copies of $K$ such…
This is a survey of some of Erd\H os's work on bases in additive number theory.
We show that the properties of the lower part of the spectrum of the Helmholtz equation for an heterogeneous system in a finite region in $d$ dimensions, where the solutions to the homogeneous problems are known, can be systematically…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
We show that in any two-coloring of the positive integers there is a color for which the set of positive integers that can be represented as a sum of distinct elements with this color has upper logarithmic density at least $(2+\sqrt{3})/4$…
Let $X$ be a smooth, connected complex projective curve of genus at least $2$. A Higgs coherent system is an augmented bundle $(E,V)$, where $E$ is a holomorphic vector bundle, and $V$ is a linear subspace of the spaces of Higgs bundles of…
We devise a Hybrid High-Order (HHO) method for highly oscillatory elliptic problems that is capable of handling general meshes. The method hinges on discrete unknowns that are polynomials attached to the faces and cells of a coarse mesh;…
Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…
In the framework of the Hough transform technique to detect curves in images, we provide a bound for the number of Hough transforms to be considered for a successful optimization of the accumulator function in the recognition algorithm.…
This paper surveys the theory of multiple packings and coverings. The study of multiple arrangements started in the 60s of the last century, and it was restricted mostly to lattice arrangements on the plane or of general arrangements of…
Expansions in non-integer bases have been investigated abundantly since their introduction by R\'enyi. It was discovered by Erd\H{o}s et al. that the sets of numbers with a unique expansion have a much more complex structure than in the…