English
Related papers

Related papers: VC-Dimension of Hyperplanes over Finite Fields

200 papers

The VC-dimension of a family of sets is a measure of its combinatorial complexity used in machine learning theory, computational geometry, and even model theory. Computing the VC-dimension of the $k$-fold union of geometric set systems has…

Combinatorics · Mathematics 2025-01-20 Pantelis E. Eleftheriou , Aris Papadopoulos , Francis Westhead

Given $E \subset {\Bbb R}^d$, define the \emph{volume set} of $E$, ${\mathcal V}(E)= \{det(x^1, x^2, ... x^d): x^j \in E\}$. In $\R^3$, we prove that ${\mathcal V}(E)$ has positive Lebesgue measure if either the Hausdorff dimension of…

Classical Analysis and ODEs · Mathematics 2011-11-01 Allan Greenleaf , Alex Iosevich , Mihalis Mourgoglou

A vector space over a field $\mathbb{F}$ is a set $V$ together with two binary operations, called vector addition and scalar multiplication. It is standard practice to think of a Euclidean space $\mathbb{R}^n$ as an $n$-dimensional real…

Classical Analysis and ODEs · Mathematics 2013-07-29 Piyush Ahuja , Subiman Kundu

Let $\mathbb F_q^d$ be the $d$-dimensional vector space over the finite field $\mathbb F_q$ with $q$ elements. Given $k$ sets $E_j\subset \mathbb F_q^d$ for $j=1,2,\ldots, k$, the generalized $k$-resultant modulus set, denoted by…

Combinatorics · Mathematics 2017-07-18 David Covert , Doowon Koh , Youngjin Pi

We prove that if a subset of the d-dimensional vector space over a finite field is large enough, then it contains many k-tuples of mutually orthogonal vectors.

Combinatorics · Mathematics 2008-07-04 Alex Iosevich , Steve Senger

Fix positive integers $k$ and $d$. We show that, as $n\to\infty$, any set system $\mathcal{A} \subset 2^{[n]}$ for which the VC dimension of $\{ \triangle_{i=1}^k S_i \mid S_i \in \mathcal{A}\}$ is at most $d$ has size at most…

Combinatorics · Mathematics 2018-10-16 Stijn Cambie , António Girão , Ross J. Kang

Ballico proved that a smooth projective variety $X$ of degree $d$ over a finite field of $q$ elements admits a smooth hyperplane section if $q\geq d(d-1)^{\dim X}$. In this paper, we refine this criterion for higher codimensional linear…

Algebraic Geometry · Mathematics 2024-02-28 Shamil Asgarli , Lian Duan , Kuan-Wen Lai

We study the existence of plane substructures in drawings of the $d$-dimensional hypercube graph $Q_d$. We construct drawings of $Q_d$ which contain no plane subgraph with more than $2d-2$ edges, no plane path with more than $2d-3$ edges,…

Computational Geometry · Computer Science 2026-03-06 Todor Antić , Niloufar Fuladi , Anna Margarethe Limbach , Pavel Valtr

For any affine hypersurface defined by a complete symmetric polynomial in $k\geq 3$ variables of degree $m$ over the finite field $\mathbb{F}_{q}$ of $q$ elements, a special case of our theorem says that this hypersurface has at least…

Number Theory · Mathematics 2020-07-23 Jun Zhang , Daqing Wan

The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…

Metric Geometry · Mathematics 2018-11-30 Ákos G. Horváth

We determine the number of ${\mathbb{F}}_q$-rational points of hyperplane sections of classical determinantal varieties defined by the vanishing of minors of a fixed size of a generic matrix, and identify sections giving the maximum number…

Combinatorics · Mathematics 2018-09-14 Peter Beelen , Sudhir R. Ghorpade

We discuss the question when a finite-dimensional diffeological vector space is, or turns out not to be, the coproduct of its subspaces in the category of diffeological vector spaces, after reviewing the same question in some other…

Differential Geometry · Mathematics 2022-12-06 Ekaterina Pervova

In recent years, sum-product estimates in Euclidean space and finite fields have been studied using a variety of combinatorial, number theoretic and analytic methods. Erdos type problems involving the distribution of distances, areas and…

Combinatorics · Mathematics 2008-03-31 David Covert , Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

We study the following two-parameter variant of the Erd\H os-Falconer distance problem. Given $E,F \subset {\Bbb F}_q^{k+l}$, $l \geq k \ge 2$, the $k+l$-dimensional vector space over the finite field with $q$ elements, let $B_{k,l}(E,F)$…

Classical Analysis and ODEs · Mathematics 2017-02-09 Philipp Birklbauer , Alex Iosevich

Let ${\Bbb F}_q$ be a finite field of order $q.$ We prove that if $d\ge 2$ is even and $E \subset {\Bbb F}_q^d$ with $|E| \ge 9q^{\frac{d}{2}}$ then $$ {\Bbb F}_q=\frac{\Delta(E)}{\Delta(E)}=\left\{ \frac{a}{b}: a \in \Delta(E), b \in…

Classical Analysis and ODEs · Mathematics 2019-05-29 A. Iosevich , D. Koh , H. Parshall

Let $(P,E)$ be a $(d+1)$-uniform geometric hypergraph, where $P$ is an $n$-point set in general position in $\mathbb{R}^d$ and $E\subseteq {P\choose d+1}$ is a collection of $\epsilon{n\choose d+1}$ $d$-dimensional simplices with vertices…

Combinatorics · Mathematics 2024-03-04 Natan Rubin

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

Erd\H{o}s asked what is the maximum number $\alpha(n)$ such that every set of $n$ points in the plane with no four on a line contains $\alpha(n)$ points in general position. We consider variants of this question for $d$-dimensional point…

Combinatorics · Mathematics 2014-10-15 Jean Cardinal , Csaba D. Tóth , David R. Wood

Let $\mathbb{F}_q$ be a finite field of order $q$ and $\mathcal{E}$ be a set in $\mathbb{F}_q^d$. The distance set of $\mathcal{E}$, denoted by $\Delta(\mathcal{E})$, is the set of distinct distances determined by the pairs of points in…

Combinatorics · Mathematics 2019-01-01 Thang Pham , Andrew Suk

Given a set $X$ and a function $h:X\longrightarrow\{0,1\}$ which labels each element of $X$ with either $0$ or $1$, we may define a function $h^{(s)}$ to measure the similarity of pairs of points in $X$ according to $h$. Specifically, for…

Machine Learning · Computer Science 2015-02-26 Mark Herbster , Paul Rubenstein , James Townsend