English
Related papers

Related papers: Lower bounds for incidences with hypersurfaces

200 papers

Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…

Combinatorics · Mathematics 2023-08-01 Arijit Ghosh , Chandrima Kayal , Soumi Nandi , S. Venkitesh

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

Combinatorics · Mathematics 2025-06-24 Zichao Dong , Zijian Xu

Given a smooth compact hypersurface $M$ with boundary $\Sigma=\partial M$, we prove the existence of a sequence $M_j$ of hypersurfaces with the same boundary as $M$, such that each Steklov eigenvalue $\sigma_k(M_j)$ tends to zero as $j$…

Spectral Theory · Mathematics 2018-11-29 Bruno Colbois , Alexandre Girouard , Antoine Métras

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

In this paper, we study existence and uniqueness of solutions to Jenkins-Serrin type problems on domains in a Riemannian surface. In the case of unbounded domains, the study is focused on the hyperbolic plane.

Differential Geometry · Mathematics 2014-02-26 L. Mazet , M. M. Rodriguez , H. Rosenberg

A 7-dimensional area-minimizing embedded hypersurface $M$ will in general have a discrete singular set. The same is true if $M$ is stable, or has bounded index, provided $H^6(sing M) = 0$. We show that if $M_i$ are a sequence of such…

Differential Geometry · Mathematics 2022-05-23 Nick Edelen

We study the Dirichlet problem at infinity on a Cartan-Hadamard manifold for a large class of operators containing in particular the p-Laplacian and the minimal graph operator.

Differential Geometry · Mathematics 2013-11-25 Jean-Baptiste Casteras , Ilkka Holopainen , Jaime B. Ripoll

We prove bounds on approximate incidences between families of circles and families of points in the plane. As a consequence, we prove a lower bound for the dimension of circular $(u,v)$-Furstenberg sets, which is new for large $u$ and $v$.

Classical Analysis and ODEs · Mathematics 2025-02-18 John Green , Terence L. J. Harris , Yumeng Ou , Kevin Ren , Sarah Tammen

An $r$-uniform hypergraph $H$ is semi-algebraic of complexity $\mathbf{t}=(d,D,m)$ if the vertices of $H$ correspond to points in $\mathbb{R}^{d}$, and the edges of $H$ are determined by the sign-pattern of $m$ degree-$D$ polynomials.…

Combinatorics · Mathematics 2023-08-08 Zhihan Jin , István Tomon

We develop a new framework to study minimum $d$-degree conditions in $k$-uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle. Our main theoretical result deals with the typical absorption, path cover and connecting…

Combinatorics · Mathematics 2021-08-09 Richard Lang , Nicolás Sanhueza-Matamala

For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…

Data Structures and Algorithms · Computer Science 2022-10-07 Greg Bodwin , Gary Hoppenworth

In this paper, we study the restriction problem for one class of hypersurfaces with vanishing curvature in $\mathbb{R}^n$ with $n$ being odd. We obtain an $L^2-L^p$ restriction estimate, which is optimal except at the endpoint. Furthermore,…

Analysis of PDEs · Mathematics 2025-08-15 Zhuoran Li , Jiqiang Zheng

We find many examples of compact Riemannian manifolds $(M,g)$ whose closed minimal hypersurfaces satisfy a lower bound on their index that is linear in their first Betti number. Moreover, we show that these bounds remain valid when the…

Differential Geometry · Mathematics 2018-03-26 Claudio Gorodski , Ricardo A. E. Mendes , Marco Radeschi

We show that for all homogeneous polynomials $ f_{m}$ of degree $m$, in $d$ variables, and each $j = 1, \dots , d$, we have \begin{equation*} \left\langle x_{j}^{2}f_{m},f_{m}\right\rangle _{L^{2}\left( \mathbb{S}% ^{d-1}\right) } \geq…

Analysis of PDEs · Mathematics 2026-01-06 J. M. Aldaz , H. Render

In this work, we consider parabolic models with dynamic boundary conditions and parabolic bulk-surface problems in 3D. Such partial differential equations based models describe phenomena that happen both on the surface and in the…

Numerical Analysis · Mathematics 2020-02-07 Yekaterina Epshteyn , Qing Xia

Let $F$ be an $n$-point set in $\mathbb{K}^d$ with $\mathbb{K}\in\{\mathbb{R},\mathbb{Z}\}$ and $d\geq 2$. A (discrete) X-ray of $F$ in direction $s$ gives the number of points of $F$ on each line parallel to $s$. We define…

Metric Geometry · Mathematics 2015-06-12 Andreas Alpers , David G. Larman

Given an $r$-uniform hypergraph $H$ and a positive integer $n$, the weak saturation number $\mathrm{wsat}(n,H)$ is the minimum number of edges in an $r$-uniform hypergraph $F$ on $n$ vertices such that the missing edges in $F$ can be added,…

Combinatorics · Mathematics 2026-04-09 Nikolai Terekhov

The numbers of $\mathbb{F}_q$-points of nonsingular hypersurfaces of a fixed degree in an odd-dimensional projective space are investigated, and an upper bound for them is given. Also we give the complete list of nonsingular hypersurfaces…

Algebraic Geometry · Mathematics 2016-11-09 Masaaki Homma , Seon Jeong Kim

Let $P$ be a $\delta$-separated $(\delta, s, C_P)$-set of points in $B(0, 1)\subset \mathbb{R}^d$ and $\Pi$ be a $\delta$-separated $(\delta, t, C_\Pi)$-set of hyperplanes intersecting $B(0, 1)$ in $\mathbb{R}^d$. Define \[I_{C\delta}(P,…

Classical Analysis and ODEs · Mathematics 2023-04-20 Thang Pham , Chun-Yen Shen , Nguyen Pham Minh Tri

A recent upper bound by Le and Solomon [STOC '23] has established that every $n$-node graph has a $(1+\varepsilon)(2k-1)$-spanner with lightness $O(\varepsilon^{-1} n^{1/k})$. This bound is optimal up to its dependence on $\varepsilon$; the…

Data Structures and Algorithms · Computer Science 2024-09-09 Greg Bodwin , Jeremy Flics
‹ Prev 1 8 9 10 Next ›