Related papers: Erd\H{o}s covering systems
Entropy numbers and covering numbers of sets and operators are well known geometric notions, which found many applications in various fields of mathematics, statistics, and computer science. Their values for finite-dimensional embeddings…
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…
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…
One of the central problems in additive combinatorics is to determine how large a subset of the first $N$ integers can be before it is forced to contain $k$ elements forming an arithmetic progression. Around 25 years ago, Gowers proved the…
We prove a new lower bound for the almost 20 year old problem of determining the smallest possible size of an essential cover of the $n$-dimensional hypercube $\{\pm 1\}^n$, i.e. the smallest possible size of a collection of hyperplanes…
Let $F_g$ be a closed orientable surface of genus $g$. A set $\Omega = \{ \gamma_1, \dots, \gamma_s\}$ of pairwise non-homotopic simple closed curves on $F_g$ is called a \emph{filling system} or simply a \emph{filling} of $F_g$, if…
In 1965, Paul Erd\H{o}s asked about the largest family $Y$ of $k$-sets in $\{ 1, \ldots, n \}$ such that $Y$ does not contain $s+1$ pairwise disjoint sets. This problem is commonly known as the Erd\H{o}s Matching Conjecture. We investigate…
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…
Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of…
A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in extremal set theory with relations and applications to many…
Let $X,Y$ be finite sets, $r,s,h, \lambda \in \mathbb{N}$ with $s\geq r, X\subsetneq Y$. By $\lambda \binom{X}{h}$ we mean the collection of all $h$-subsets of $X$ where each subset occurs $\lambda$ times. A coloring of…
The Erd\H{o}s distance problem concerns the least number of distinct distances that can be determined by $N$ points in the plane. The integer lattice with $N$ points is known as \textit{near-optimal}, as it spans $\Theta(N/\sqrt{\log(N)})$…
An edge colouring of a multigraph can be thought of as a partition of the edges into matchings (a matching meets each vertex at most once). Analogously, an edge cover colouring is a partition of the edges into edge covers (an edge cover…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
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…
A method is provided for computing an upper bound of the complexity of a module over a local ring, in terms of vanishing of certain cohomology modules. We then specialize to complete intersections, which are precisely the rings over which…
There exist irreducible exact covering systems (ECS). These are ECS which are not a proper split of a coarser ECS. However, an ECS admiting a maximal modulus which is divisible by at most two distinct primes, primely splits a coarser ECS.…
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,…
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]$…
We prove the following variant of the Erd\H{o}s distinct subset sums problem. Given $t \ge 0$ and sufficiently large $n$, every $n$-element set $A$ whose subset sums are distinct modulo $N=2^n+t$ satisfies $$\max A \ge…