English
Related papers

Related papers: The VC-dimension and point configurations in ${\Bb…

200 papers

We say that two partial orders on $[n]$ are compatible if there exists a partial order that refines both of them. This compatibility relation induces a natural set system structure between the collection $\mathcal{F}$ of all partial orders…

Combinatorics · Mathematics 2026-02-10 Boyan Duan , Minghui Ouyang , Zheng Wang

Let $V$ denote an $r$-dimensional vector space over $\mathbb{F}_{q^n}$, the finite field of $q^n$ elements. Then $V$ is also an $rn$-dimension vector space over $\mathbb{F}_q$. An $\mathbb{F}_q$-subspace $U$ of $V$ is $(h,k)_q$-evasive if…

Combinatorics · Mathematics 2021-04-14 Daniele Bartoli , Bence Csajbók , Giuseppe Marino , Rocco Trombetti

The VC-dimension of a set system is a way to capture its complexity and has been a key parameter studied extensively in machine learning and geometry communities. In this paper, we resolve two longstanding open problems on bounding the…

Machine Learning · Computer Science 2018-07-23 Monika Csikos , Andrey Kupavskii , Nabil H. Mustafa

We evaluate the shattering dimension of various classes of linear functionals on various symmetric convex sets. The proofs here relay mostly on methods from the local theory of normed spaces and include volume estimates, factorization…

Probability · Mathematics 2007-05-23 Shahar Mendelson , Gideon Schechtman

Dimensions of level sets of generic continuous functions and generic H\"older functions defined on a fractal $F$ encode information about the geometry, ``the thickness" of $F$. While in the continuous case this quantity is related to a…

Classical Analysis and ODEs · Mathematics 2024-10-10 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

Let $G=(V,E)$ be a graph. A $k$-neighborhood in $G$ is a set of vertices consisting of all the vertices at distance at most $k$ from some vertex of $G$. The hypergraph on vertex set $V$ which edge set consists of all the $k$-neighborhoods…

Combinatorics · Mathematics 2014-12-05 Nicolas Bousquet , Stéphan Thomassé

In the realm of machine learning theory, to prevent unnatural coding schemes between teacher and learner, No-Clash Teaching Dimension was introduced as provably optimal complexity measure for collusion-free teaching. However, whether…

Information Theory · Computer Science 2026-04-02 Jiahua Liu , Benchong Li

Since its introduction by Vapnik and Chervonenkis in the 1960s, the VC dimension and its variants have played a central role in numerous fields. In this paper, we investigate several variants of the VC dimension and their applications to…

Combinatorics · Mathematics 2025-04-04 Guorong Gao , Jie Ma , Mingyuan Rong , Tuan Tran

We introduce the problem Partial VC Dimension that asks, given a hypergraph $H=(X,E)$ and integers $k$ and $\ell$, whether one can select a set $C\subseteq X$ of $k$ vertices of $H$ such that the set $\{e\cap C, e\in E\}$ of distinct…

Data Structures and Algorithms · Computer Science 2019-05-29 Cristina Bazgan , Florent Foucaud , Florian Sikora

The concept of Vapnik-Chervonenkis (VC) density is pivotal across various mathematical fields, including discrete geometry, probability theory and model theory. In this paper, we introduce a topological generalization of VC-density. Let $Y$…

Logic · Mathematics 2025-06-04 Saugata Basu , Deepam Patel

In this paper, we prove the identity $\dim_{\textrm H}(F)=d\cdot \dim_{\textrm H}(\alpha^{-1}(F))$, where $\dim_{\textrm H}$ denotes Hausdorff dimension, $F\subseteq \mathbb{R}^d$, and $\alpha:[0,1]\to [0,1]^d$ is a function whose…

Metric Geometry · Mathematics 2019-03-29 M. A. Sánchez-Granero , M. Fernández-Martínez

The Vapnik-Chervonenkis (VC) dimension of the set of half-spaces of R^d with frontiers parallel to the axes is computed exactly. It is shown that it is much smaller than the intuitive value of d. A good approximation based on the Stirling's…

Statistics Theory · Mathematics 2016-10-21 Servane Gey

Hausdorff dimensions of level sets of generic continuous functions defined on fractals were considered in two papers by R. Balka, Z. Buczolich and M. Elekes. In those papers the topological Hausdorff dimension of fractals was defined. In…

Classical Analysis and ODEs · Mathematics 2022-08-26 Zoltán Buczolich , Balázs Maga , Gáspár Vértesy

Let $V$ be an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. We call an $\mathbb{F}_q$-subspace $U$ of $V$ $h$-scattered if $U$ meets the $h$-dimensional $\mathbb{F}_{q^n}$-subspaces of $V$ in $\mathbb{F}_q$-subspaces of dimension at most…

Combinatorics · Mathematics 2025-01-27 Bence Csajbók , Giuseppe Marino , Olga Polverino , Ferdinando Zullo

We prove that, for any $d$ linearly independent functions from some set into a $d$-dimensional vector space over any field, the family of zero sets of all non-trivial linear combination of these functions has VC-dimension and Littlestone…

Logic · Mathematics 2021-09-13 Vincent Guingona , Alexei Kolesnikov , Julie Nierwinski , Richard Soucy

Following recent work on the VC-dimension of subsets of various pseudorandom graphs, we study the VC-dimension of Hamming graphs, which have proved somewhat resistant to the standard techniques in the literature. Our methods are elementary,…

Combinatorics · Mathematics 2025-05-21 Christopher Housholder , Layna Mangiapanello , Steven Senger

The geometric dimension $g$ of a Vector Addition System with States (VASS) is the dimension of the vector space generated by cycles in the VASS; this parameter refines the standard dimension $d$, the number of counters. Recently, it was…

Formal Languages and Automata Theory · Computer Science 2026-02-18 Wojciech Czerwiński , Roland Guttenberg , Łukasz Orlikowski , Henry Sinclair-Banks , Yangluo Zheng

We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions. Our main complexity-theoretic…

Combinatorics · Mathematics 2020-05-25 Shay Moran , Cyrus Rashtchian

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

Symbolic Computation · Computer Science 2021-06-15 Piere Lairez , Mohab Safey El Din

One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this…

Machine Learning · Computer Science 2014-02-04 J. Hyam Rubinstein , Benjamin I. P. Rubinstein , Peter L. Bartlett