English
Related papers

Related papers: Sidon sets and 2-caps in $\mathbb{F}_3^n$

200 papers

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

Combinatorics · Mathematics 2023-06-22 Akshat Mudgal

A finite set X in the Euclidean space is called an s-inner product set if the set of the usual inner products of any two distinct points in X has size s. First, we give a special upper bound for the cardinality of an s-inner product set on…

Combinatorics · Mathematics 2011-04-20 Hiroshi Nozaki

A subspace of a finite extension field is called a Sidon space if the product of any two of its elements is unique up to a scalar multiplier from the base field. Sidon spaces were recently introduced by Bachoc et al. as a means to…

Information Theory · Computer Science 2017-05-19 Ron M. Roth , Netanel Raviv , Itzhak Tamo

A cap of spherical radius $\alpha$ on a unit $d$-sphere $S$ is the set of points within spherical distance $\alpha$ from a given point on the sphere. Let $\mathcal F$ be a finite set of caps lying on $S$. We prove that if no hyperplane…

Metric Geometry · Mathematics 2022-08-10 Alexandr Polyanskii

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

Computational Geometry · Computer Science 2020-03-17 M. Sharir , C. Ziv

For a subset $A \subseteq [N]$, we define the representation function $ r_{A-A}(d) := \#\{(a,a') \in A \times A : d = a - a'\}$ and define $M_D(A) := \max_{1 \leq d < D} r_{A-A}(d)$ for $D>1$. We study the smallest possible value of…

Number Theory · Mathematics 2020-03-03 Max Wenqiang Xu

We present a simple construction of an acute set of size $2^{d-1}+1$ in $\mathbb{R}^d$ for any dimension $d$. That is, we explicitly give $2^{d-1}+1$ points in the $d$-dimensional Euclidean space with the property that any three points form…

Metric Geometry · Mathematics 2017-09-22 Balázs Gerencsér , Viktor Harangi

Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…

Combinatorics · Mathematics 2024-05-14 Eyvindur A. Palsson , Edward Yu

We show the subgroup of 20 nonzero fourth powers in the finite field of order 81 is a cap set. Similarly, the subgroup of 9 nonzero seventh powers in the field of order 64 is a cap set. These are the cases related to the card games of SET…

Combinatorics · Mathematics 2026-05-01 Anthony Kable , Melissa Mills , David J. Wright

We obtain new bounds for (a variant of) the Furstenberg set problem for high dimensional flats over $\mathbb{R}^n$. In particular, let $F\subset \mathbb{R}^n$, $1\leq k \leq n-1$, $s\in (0,k]$, and $t\in (0,k(n-k)]$. We say that $F$ is a…

Classical Analysis and ODEs · Mathematics 2025-03-14 Paige Bright , Manik Dhar

A 3-simplex is a collection of four sets A_1,...,A_4 with empty intersection such that any three of them have nonempty intersection. We show that the maximum size of a set system on n elements without a 3-simplex is $2^{n-1} +…

Combinatorics · Mathematics 2010-10-26 Michael E. Picollelli

We prove that if the Hausdorff dimension of a compact set $E \subset {\Bbb R}^2$ is greater than 7/4, then the set of {\ag three-point configurations determined by $E$ has positive three-dimensional measure}. We establish this by showing…

Classical Analysis and ODEs · Mathematics 2011-11-03 Allan Greenleaf , Alex Iosevich

We construct an oracle relative to which $\mathrm{P} = \mathrm{NP} \cap \mathrm{coNP}$, but there are no many-one complete sets in $\mathrm{UP}$, no many-one complete disjoint $\mathrm{NP}$-pairs, and no many-one complete disjoint…

Computational Complexity · Computer Science 2022-03-22 Anton Ehrmanntraut , Fabian Egidy , Christian Glaßer

We prove that for any smooth projective $3$-fold of general type with canonical volume greater than $12^6$, the image of its bicanonical map has dimension at least $2$. We also study pluricanonical maps of $3$-folds of general type with…

Algebraic Geometry · Mathematics 2026-05-19 Chen Jiang , Ziqi Liu

We introduce and study a $d$-dimensional generalization of Hamiltonian cycles in graphs - the Hamiltonian $d$-cycles in $K_n^d$ (the complete simplicial $d$-complex over a vertex set of size $n$). Those are the simple $d$-cycles of a…

Combinatorics · Mathematics 2019-07-19 Rogers Mathew , Ilan Newman , Yuri Rabinovich , Deepak Rajendraprasad

Erd\H{o}s asked the following question: given $n$ points in the plane in almost general position (no 4 collinear), how large a set can we guarantee to find that is in general position (no 3 collinear)? F\"uredi constructed a set of $n$…

Combinatorics · Mathematics 2016-01-28 Luka Milićević

The tight span $T_d$ of a metric $d$ on a finite set is the subcomplex of bounded faces of an unbounded polyhedron defined by~$d$. If $d$ is generic then $T_d$ is known to be dual to a regular triangulation of a second hypersimplex. A tight…

Metric Geometry · Mathematics 2007-05-23 Sven Herrmann , Michael Joswig

Let $P$ be a set of $n$ points in real projective $d$-space, not all contained in a hyperplane, such that any $d$ points span a hyperplane. An ordinary hyperplane of $P$ is a hyperplane containing exactly $d$ points of $P$. We show that if…

Combinatorics · Mathematics 2020-04-24 Aaron Lin , Konrad Swanepoel

There has been much work on the following question: given n how large can a subset of {1,...,n} be that has no arithmetic progressions of length 3. We call such sets 3-free. Most of the work has been asymptotic. In this paper we sketch…

Combinatorics · Mathematics 2025-01-06 William Gasarch , James Glenn , Clyde Kruskal

In 2008, Bukh, Matousek, and Nivasch conjectured that for every n-point set S in R^d and every k, 0 <= k <= d-1, there exists a k-flat f in R^d (a "centerflat") that lies at "depth" (k+1) n / (k+d+1) - O(1) in S, in the sense that every…

Computational Geometry · Computer Science 2012-05-03 Boris Bukh , Gabriel Nivasch