English
Related papers

Related papers: Lower bounds for incidences with hypersurfaces

200 papers

The first purpose of this paper is to solve completely the finite field cone restriction conjecture in four dimensions with $-1$ non-square. The second is to introduce a new approach to study incidence problems via restriction theory. More…

Classical Analysis and ODEs · Mathematics 2021-07-15 Doowon Koh , Sujin Lee , Thang Pham

Given feasible strongly regular graph parameters $(v,k,\lambda,\mu)$ and a non-negative integer $d$, we determine upper and lower bounds on the order of a $d$-regular induced subgraph of any strongly regular graph with parameters…

Combinatorics · Mathematics 2022-02-22 Rhys J. Evans

Here we prove that the Hilbert-Kunz mulitiplicity of a quadric hypersurface of dimension $d$ and odd characteristic $p\geq 2d-4$ is bounded below by $1+m_d$, where $m_d$ is the $d^{th}$ coefficient in the expansion of…

Algebraic Geometry · Mathematics 2021-01-12 Vijaylaxmi Trivedi

In this paper, we study closed embedded minimal hypersurfaces in a Riemannian $(n+1)$-manifold ($2\le n\le 6$) that minimize area among such hypersurfaces. We show they exist and arise either by minimization techniques or by min-max…

Differential Geometry · Mathematics 2015-03-20 Laurent Mazet , Harold Rosenberg

Among the nondegenerate C^4 hypersurfaces M in R^n, we characterize the rational quadrics as the hypersurfaces that are the least well approximated by rational points. Given M other than a rational quadric, we prove a heuristically sharp…

Number Theory · Mathematics 2025-12-02 Alexander Smith

We consider certain estimates involving averaging operators over curves and hypersurfaces that can be cast into a combinatorial framework. We show that hypersurfaces with nonzero rotational curvature satisfy the usual restricted weak-type…

Classical Analysis and ODEs · Mathematics 2007-05-23 W. Schlag

In this paper we study the number of incidences between $m$ points and $n$ varieties in $\mathbb{F}^d$, where $\mathbb{F}$ is an arbitrary field, assuming the incidence graph contains no copy of $K_{s,s}$. We also consider the analogous…

Combinatorics · Mathematics 2024-03-14 Aleksa Milojević , Benny Sudakov , István Tomon

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

It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…

Combinatorics · Mathematics 2011-04-05 Steven Klee

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

Given $m$ points and $n$ hyperplanes in $\mathbb{R}^d$, if there are many incidences, we expect to find a big cluster $K_{r,s}$ in their incidence graph. Apfelbaum and Sharir found lower and upper bounds for the largest size of $rs$, which…

Combinatorics · Mathematics 2018-10-04 Thao T. Do

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

Combinatorics · Mathematics 2025-10-01 Doowon Koh , Ben Lund , Chuandong Xu , Semin Yoo

We study a wide spectrum of incidence problems involving points and curves or points and surfaces in $\mathbb R^3$. The current (and in fact the only viable) approach to such problems, pioneered by Guth and Katz [2010,2015], requires a…

Combinatorics · Mathematics 2017-05-01 Micha Sharir , Noam Solomon

We prove a new, tight upper bound on the number of incidences between points and hyperplanes in Euclidean d-space. Given n points, of which k are colored red, there are O_d(m^{2/3}k^{2/3}n^{(d-2)/3} + kn^{d-2} + m) incidences between the k…

Combinatorics · Mathematics 2012-01-10 Ben D. Lund , George B. Purdy , Justin W. Smith

Let $n, r, k$ be positive integers such that $3\leq k < n$ and $2\leq r \leq k-1$. Let $m(n, r, k)$ denote the maximum number of edges an $r$-uniform hypergraph on $n$ vertices can have under the condition that any collection of $i$ edges,…

Discrete Mathematics · Computer Science 2012-10-05 Niranjan Balachandran , Srimanta Bhattacharya

We prove three theorems giving extremal bounds on the incidence structures determined by subsets of the points and blocks of a balanced incomplete block design (BIBD). These results generalize and strengthen known bounds on the number of…

Combinatorics · Mathematics 2016-12-28 Ben Lund , Shubhangi Saraf

We prove a point-wise and average bound for the number of incidences between points and hyper-planes in vector spaces over finite fields. While our estimates are, in general, sharp, we observe an improvement for product sets and sets…

Classical Analysis and ODEs · Mathematics 2007-07-31 Derrick Hart , Alex Iosevich , Doowon Koh , Misha Rudnev

In this note we propose a min-max theory for embedded hypersurfaces with a fixed boundary and apply it to prove several theorems about the existence of embedded minimal hypersurfaces with a given boundary. A simpler variant of these…

Analysis of PDEs · Mathematics 2017-05-19 Camillo De Lellis , Jusuf Ramic

We show that the number of incidences between $m$ distinct points and $n$ distinct lines in ${\mathbb R}^4$ is $O\left(2^{c\sqrt{\log m}} (m^{2/5}n^{4/5}+m) + m^{1/2}n^{1/2}q^{1/4} + m^{2/3}n^{1/3}s^{1/3} + n\right)$, for a suitable…

Combinatorics · Mathematics 2015-03-26 Micha Sharir , Noam Solomon

We prove a new upper bound for the number of incidences between points and lines in a plane over an arbitrary field $\mathbb{F}$, a problem first considered by Bourgain, Katz and Tao. Specifically, we show that $m$ points and $n$ lines in…

Combinatorics · Mathematics 2017-08-16 Sophie Stevens , Frank de Zeeuw