English
Related papers

Related papers: The cap set problem: Up to dimension 7

200 papers

We develop a new simple approach to prove upper bounds for generalizations of the Heilbronn's triangle problem in higher dimensions. Among other things, we show the following: for fixed $d \ge 1$, any subset of $[0, 1]^d$ of size $n$…

Combinatorics · Mathematics 2024-03-14 Dmitrii Zakharov

Spherical caps play a crucial role in establishing a criterion for the existence of solutions to the Yamabe problem on a compact Riemannian manifold with boundary, similar to the role played by the standard sphere in the problem on a closed…

Analysis of PDEs · Mathematics 2026-05-29 Mónica Clapp , Benedetta Pellacci , Angela Pistoia

Let $P$ be a finite set of points in $\mathbb{R}^d$ or $\mathbb{C}^d$. We answer a question of Purdy on the conditions under which the number of hyperplanes spanned by $P$ is at least the number of $(d-2)$-flats spanned by $P$. In answering…

Combinatorics · Mathematics 2016-10-13 Ben Lund

We study progression-free sets in the abelian groups $G=(\mathbb{Z}_m^n,+)$. Let $r_k(\mathbb{Z}_m^n)$ denote the maximal size of a set $S \subset \mathbb{Z}_m^n$ that does not contain a proper arithmetic progression of length $k$. We give…

Combinatorics · Mathematics 2019-03-21 Christian Elsholtz , Péter Pál Pach

According to [1] an $n$-dimensional $\mathcal{N}$--set is a compact subset $A$ of $\mathbb{R}^n$ such that for every $x$ in $\mathbb{R}^n$ there is $y$ in $A$ with $y-x$ in $\mathbb{Z}^n$. We prove that every two dimensional…

Number Theory · Mathematics 2010-07-09 Lev A. Borisov , Renling Jin

A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…

Optimization and Control · Mathematics 2022-12-27 Christian Bingane

How many points can be placed in an $n\times n$ grid so that every (affine) line contains at most $k$ points? We prove that for $n \ge k \ge 10^{37}$ the maximum number of points is exactly $kn$. Our proof builds on the recent work of…

Combinatorics · Mathematics 2025-10-21 Alexandr Grebennikov , Matthew Kwan

We generalize the Guth--Katz joints theorem from lines to varieties. A special case says that $N$ planes (2-flats) in 6 dimensions (over any field) have $O(N^{3/2})$ joints, where a joint is a point contained in a triple of these planes not…

Combinatorics · Mathematics 2022-06-03 Jonathan Tidor , Hung-Hsun Hans Yu , Yufei Zhao

For every $n \in \mathbb{N}$ and every field $K$, let $N(n,K)$ be the set of the nilpotent $n \times n$ matrices over $K$ and let $D(n,K) $ be the set of the $n \times n$ matrices over $K$ which are diagonalizable over $K$. Moreover, let…

Rings and Algebras · Mathematics 2023-09-18 Elena Rubei

A double-normal pair of a finite set $S$ of points from Euclidean space is a pair of points $\{p,q\}$ from $S$ such that $S$ lies in the closed strip bounded by the hyperplanes through $p$ and $q$ that are perpendicular to $pq$. A…

Combinatorics · Mathematics 2015-09-07 János Pach , Konrad J. Swanepoel

Any non-split complex supermanifold is a deformation of a split supermanifold. These deformations are classified by group orbits in a non-abelian cohomology. For the case of a split supermanifold with no global nilpotent even vector fields,…

Complex Variables · Mathematics 2016-01-28 Matthias Kalus

We study the following two problems: (1) Given $n\ge 2$ and $\al$, how large Hausdorff dimension can a compact set $A\su\Rn$ have if $A$ does not contain three points that form an angle $\al$? (2) Given $\al$ and $\de$, how large Hausdorff…

Classical Analysis and ODEs · Mathematics 2012-04-09 Viktor Harangi , Tamás Keleti , Gergely Kiss , Péter Maga , András Máthé , Pertti Mattila , Balázs Strenner

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

This paper studies problems related to visibility among points in the plane. A point $x$ \emph{blocks} two points $v$ and $w$ if $x$ is in the interior of the line segment $\bar{vw}$. A set of points $P$ is \emph{$k$-blocked} if each point…

Combinatorics · Mathematics 2015-11-17 Greg Aloupis , Brad Ballinger , Sébastien Collette , Stefan Langerman , Attila Pór , David R. Wood

We show that, for a positive integer $r$, every minimal 1-saturating set in ${\rm PG}(r-1,2)$ of size at least ${11/36} 2^r+3$ is either a complete cap or can be obtained from a complete cap $S$ by fixing some $s\in S$ and replacing every…

Number Theory · Mathematics 2009-01-19 David J. Grynkiewicz , Vsevolod F. lev

In this paper we give a close-to-sharp answer to the basic questions: When is there a continuous way to add a point to a configuration of $n$ ordered points on a surface $S$ of finite type so that all the points are still distinct? When…

Geometric Topology · Mathematics 2019-05-22 Lei Chen

We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, $N$. This problem has been considered before only in the limit cases of circle packing inside a circle and on a sphere…

Soft Condensed Matter · Physics 2024-08-23 Paolo Amore

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…

Combinatorics · Mathematics 2020-07-21 Oswin Aichholzer , Jesús García , David Orden , Pedro Ramos

Let S be a surface in complex projective 3-space, having only nodes as singularities. Suppose that S has degree 6. We show that the maximum number of nodes which S can have is 65. An abbreviated history of this is as follows. Basset showed…

alg-geom · Mathematics 2008-02-03 David B. Jaffe , Daniel Ruberman

In this paper we study some cube packing problems. In particular we are interested in compact subsets of $\mathbb{R}^n,n\geq 2$, which contain boundaries of cubes with all side lengths in $(0,1)$. We show here that such sets must have lower…

Classical Analysis and ODEs · Mathematics 2018-01-10 Han Yu