English
Related papers

Related papers: VC dimension and a union theorem for set systems

200 papers

We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to find a minimum cardinality subset of F such that each point p in P is covered by (contained…

Computational Geometry · Computer Science 2009-09-04 Chandra Chekuri , Kenneth L. Clarkson , Sariel Har-Peled

Let $\mbox{$\cal F$}\subseteq 2^{[n]}$ be a fixed family of subsets. Let $D(\mbox{$\cal F$})$ stand for the following set of Hamming distances: $$ D(\mbox{$\cal F$}):=\{d_H(F,G):~ F, G\in \mbox{$\cal F$},\ F\neq G\}. $$ $\mbox{$\cal F$}$ is…

Combinatorics · Mathematics 2023-05-02 Gábor Hegedüs

Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of…

Combinatorics · Mathematics 2014-03-04 Gyula O. H. Katona , Dániel T. Nagy

Given a metric space $(V, d)$ along with an integer $k$, the $k$-Median problem asks to open $k$ centers $C \subseteq V$ to minimize $\sum_{v \in V} d(v, C)$, where $d(v, C) := \min_{c \in C} d(v, c)$. While the best-known approximation…

Data Structures and Algorithms · Computer Science 2024-01-26 Aditya Anand , Euiwoong Lee

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Classical Analysis and ODEs · Mathematics 2024-09-23 Jonathan M. Fraser

Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in $d$-space into constant-complexity subcells. In this paper, we settle in the affirmative a few long-standing open…

Computational Geometry · Computer Science 2023-11-06 Pankaj K. Agarwal , Esther Ezra , Micha Sharir

A $(d,k)$-set is a subset of $\mathbb{R}^d$ containing a $k$-dimensional unit ball of all possible orientations. Using an approach of D.~Oberlin we prove various Fourier dimension estimates for compact $(d,k)$-sets. Our main interest is in…

Classical Analysis and ODEs · Mathematics 2022-10-11 Jonathan M. Fraser , Terence L. J. Harris , Nicholas G. Kroon

For a positive integer $d$, a set of points in $d$-dimensional Euclidean space is called almost-equidistant if for any three points from the set, some two are at unit distance. Let $f(d)$ denote the largest size of an almost-equidistant set…

Metric Geometry · Mathematics 2020-02-25 Martin Balko , Attila Pór , Manfred Scheucher , Konrad Swanepoel , Pavel Valtr

Let $C^{2k}_r$ be the $2k$-uniform hypergraph obtained by letting $P_1,...,P_r$ be pairwise disjoint sets of size $k$ and taking as edges all sets $P_i \cup P_j$ with $i \neq j$. This can be thought of as the `$k$-expansion' of the complete…

Combinatorics · Mathematics 2007-05-23 Peter Keevash , Benny Sudakov

Let K be a field of characteristic different from 2 and let V be a vector space of dimension n over K. Let M be a non-zero subspace of symmetric bilinear forms defined on V x V and let r=rank(M) denote the set of different positive integers…

Rings and Algebras · Mathematics 2018-01-26 Rod Gow

We resolve a few questions regarding the uniformity and size of microsets of subsets of Euclidean space. First, we construct a compact set $K\subset\mathbb{R}^d$ with Assouad dimension arbitrarily close to $d$ such that every microset of…

Metric Geometry · Mathematics 2025-10-22 Richárd Balka , Vilma Orgoványi , Alex Rutar

We study the Vapnik-Chervonenkis (VC) dimension of the set of quadratic residues (i.e. squares) in finite fields, $\mathbb F_q$, when considered as a subset of the additive group. We conjecture that as $q \to \infty$, the squares have the…

Combinatorics · Mathematics 2024-08-02 Brian McDonald , Anurag Sahay , Emmett L. Wyman

In this paper, we give the Assouad dimension formula and the upper bound of the lower dimension for homogeneous Moran sets under the condition $\sup_{k\ge 1}\{n_{k}\}<+\infty$. We also give the Assouad spectrum and the lower spectrum…

General Topology · Mathematics 2025-01-17 Yanzhe Li , Jun Li , Shuang Liang , Manli Lou

Three $k$-dimensional subspaces $A$, $B$, and $C$ of an $n$-dimensional vector space $V$ over a finite field are called a $3$-cluster if $A \cap B \cap C = \{\mathbf{0}_V\}$ and yet $\dim(A+B+C) \leq 2k$. A special kind of $3$-cluster,…

Combinatorics · Mathematics 2024-03-11 Gabriel Currier , Shahriar Shahriari

We consider the dimensional reduction of a CFT, breaking multiplets of the d-dimensional conformal group SO(d+1,1) up into multiplets of SO(d,1). This leads to an expansion of d-dimensional conformal blocks in terms of blocks in d-1…

High Energy Physics - Theory · Physics 2016-09-21 Matthijs Hogervorst

The convex dimension of a $k$-uniform hypergraph is the smallest dimension $d$ for which there is an injective mapping of its vertices into $\mathbb{R}^d$ such that the set of $k$-barycenters of all hyperedges is in convex position. We…

Combinatorics · Mathematics 2024-07-11 Leonardo Martínez-Sandoval , Arnau Padrol

We show that certain families of sets in $\mathbb{R}^2$ (or $\mathbb{R}^n$) which are neither definable nor have bounded VC-dimension are nonetheless uniformly approximately definable in the real field, an o-minimal structure.

Logic · Mathematics 2026-05-12 Leonardo N. Coregliano , Maryanthe Malliaris

A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…

Combinatorics · Mathematics 2010-03-04 Greg Martin , Kevin O'Bryant

A family $\mathcal{F}\subset 2^G$ of subsets of an abelian group $G$ is a Sidon system if the sumsets $A+B$ with $A,B\in \mathcal{F}$ are pairwise distinct. Cilleruelo, Serra and the author previously proved that the maximum size $F_k(n)$…

Combinatorics · Mathematics 2024-02-20 Maximilian Wötzel

We study a higher-dimensional analogue of the {Random Travelling Salesman Problem}: let the complete $d$-dimensional simplicial complex $K_n^{d}$ on $n$ vertices be equipped with i.i.d.\ volumes on its facets, uniformly random in $[0,1]$.…

Probability · Mathematics 2024-09-04 Agelos Georgakopoulos , John Haslegrave , Joel Larsson Danielsson