English
Related papers

Related papers: Two theorems on point-flat incidences

200 papers

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

We show that for any finite set $P$ of points in the plane and $\epsilon>0$ there exist $\displaystyle O\left(\frac{1}{\epsilon^{3/2+\gamma}}\right)$ points in ${\mathbb{R}}^2$, for arbitrary small $\gamma>0$, that pierce every convex set…

Combinatorics · Mathematics 2022-07-22 Natan Rubin

Let $\mathcal{P}$ be a set of $m$ points and $\mathcal{L}$ a set of $n$ lines in $K^2$, where $K$ is a field with char$(K)=0$. We prove the incidence bound $$\mathcal{I}(\mathcal{P},\mathcal{L})=O(m^{2/3}n^{2/3}+m+n).$$ Moreover, this bound…

Combinatorics · Mathematics 2025-10-20 Jiahe Shen

Let $S$ be a set of $n$ points in real three-dimensional space, no three collinear and not all co-planar. We prove that if the number of planes incident with exactly three points of $S$ is less than $Kn^2$ for some $K=o(n^{\frac{1}{7}})$…

Metric Geometry · Mathematics 2017-06-22 Simeon Ball

We study k-very ampleness of line bundles on blow-ups of hyperelliptic surfaces at r very general points. We obtain a numerical condition on the number of points for which a line bundle on the blow-up of a hyperelliptic surface at these r…

Algebraic Geometry · Mathematics 2016-03-22 Lucja Farnik

The Betke-Henk-Wills conjecture provides an upper bound for the lattice point enumerator $G(K, \Lambda)$ of a convex body in terms of its successive minima. While the conjecture is established for orthogonal parallelotopes, its validity for…

Metric Geometry · Mathematics 2026-03-06 Chao Wang

Given a sequence $\{\mathcal{E}_{k}\}_{k}$ of almost-minimizing clusters in $\mathbb{R}^3$ which converges in $L^{1}$ to a limit cluster $\mathcal{E}$ we prove the existence of $C^{1,\alpha}$-diffeomorphisms $f_k$ between…

Analysis of PDEs · Mathematics 2015-05-26 Gian Paolo Leonardi , Francesco Maggi

We prove some restriction theorems for flat homogeneous surfaces of codimension greater than one.

Classical Analysis and ODEs · Mathematics 2007-05-23 Laura DeCarli , Alex Iosevich

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

Combinatorics · Mathematics 2017-06-28 József Balogh , Sean Eberhard , Bhargav Narayanan , Andrew Treglown , Adam Zsolt Wagner

This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…

General Mathematics · Mathematics 2026-05-27 Steven Senger

Let $\mathbb{F}_q$ be a finite field of $q$ elements where $q$ is a large odd prime power and $Q =a_1 x_1^{c_1}+...+a_dx_d^{c_d}\in \mathbb{F}_q[x_1,...,x_d]$, where $2\le c_i\le N$, $\gcd(c_i,q)=1$, and $a_i\in \mathbb{F}_q$ for all $1\le…

Combinatorics · Mathematics 2016-08-18 Nguyen Duy Phuong , Pham Van Thang , Le Anh Vinh

Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…

Metric Geometry · Mathematics 2025-10-23 William Verreault

In this paper some results on the topology of the space of $k$-flats in $\mathbb R^n$ are proved, similar to the Borsuk-Ulam theorem on coverings of sphere. Some corollaries on common transversals for families of compact sets in $\mathbb…

Combinatorics · Mathematics 2011-07-06 R. N. Karasev

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

Number Theory · Mathematics 2019-05-10 Reynold Fregoli

Let S be a set of n >= d points in general position in R^d. An oriented (d-1)-simplex spanned by d points from S is called a k-facet iff the positive side of its affine hull contains exactly k points from S. A (<=k)-facet is simply an…

Computational Geometry · Computer Science 2017-01-16 James King

We discuss a planar variant of the Kakeya maximal function in the setting of a vector space over a finite field. Using methods from incidence combinatorics, we demonstrate that the operator is bounded from $L^p$ to $L^q$ when $1 \leq p \leq…

Combinatorics · Mathematics 2007-05-23 John Bueti

We prove a fairly general inequality that estimates the number of lattice points in a ball of positive radius in general position in a Euclidean space. The bound is uniform over lattices induced by a matrix having a bounded operator norm.

Number Theory · Mathematics 2024-02-14 Jeffrey D Vaaler

In this paper, we introduce the concepts of weaknorm, quasi-weaknorm on real vector spaces. By these concepts, we introduce the concept of quasi-locally convex topological vector spaces, which include locally convex topological vector…

Functional Analysis · Mathematics 2020-01-01 Jinlu Li

In this paper we prove, for all $d \ge 2$, that for no $s<\frac{d+1}{2}$ does $I_s(\mu)<\infty$ imply the canonical Falconer distance problem incidence bound, or the analogous estimate where the Euclidean norm is replaced by the norm…

Combinatorics · Mathematics 2010-06-09 Alex Iosevich , Steven Senger

Given a database, a common problem is to find the pairs or $k$-tuples of items that frequently co-occur. One specific problem is to create a small space "sketch" of the data that records which $k$-tuples appear in more than an $\epsilon$…

Data Structures and Algorithms · Computer Science 2014-10-13 Eric Price