English
Related papers

Related papers: Heilbronn's triangle problem in three dimensions

200 papers

We show that every planar convex body is contained in a quadrangle whose area is less than $(1 - 2.6 \cdot 10^{-7}) \sqrt{2}$ times the area of the original convex body, improving the best known upper bound by W. Kuperberg.

Metric Geometry · Mathematics 2026-04-13 Ferenc Fodor , Florian Grundbacher

We show that a generic real projective $n$-dimensional hypersurface of odd degree $d$, such that $4(n-2)=\binom{d+3}3$, contains "many" real 3-planes, namely, in the logarithmic scale their number has the same rate of growth, $d^3\log d$,…

Algebraic Geometry · Mathematics 2015-07-30 Sergey Finashin , Viatcheslav Kharlamov

We show that a realization of a closed connected PL-manifold of dimension n-1 in n-dimensional Euclidean space (n>2) is the boundary of a convex polyhedron (finite or infinite) if and only if the interior of each (n-3)-face has a point,…

Computational Geometry · Computer Science 2007-05-23 Konstantin Rybnikov

The three distance theorem (also known as the three gap theorem or Steinhaus problem) states that, for any given real number $\alpha$ and integer $N$, there are at most three values for the distances between consecutive elements of the…

Number Theory · Mathematics 2021-07-12 Alan Haynes , Jens Marklof

It is shown that the volume entropy of a Hilbert geometry associated to an $n$-dimensional convex body of class $C^{1,1}$ equals $n-1$. To achieve this result, a new projective invariant of convex bodies, similar to the centro-affine area,…

Differential Geometry · Mathematics 2010-05-21 Gautier Berck , Andreas Bernig , Constantin Vernicos

We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…

Combinatorics · Mathematics 2018-12-05 Stefan Glock

A celebrated result of Mantel shows that every graph on $n$ vertices with $\lfloor n^2/4 \rfloor + 1$ edges must contain a triangle. A robust version of this result, due to Rademacher, says that there must in fact be at least $\lfloor n/2…

Combinatorics · Mathematics 2019-10-22 David Conlon , Jacob Fox , Benny Sudakov

It follows from known results that every regular tripartite hypergraph of positive degree, with $n$ vertices in each class, has matching number at least $n/2$. This bound is best possible, and the extremal configuration is unique. Here we…

Combinatorics · Mathematics 2017-01-24 Penny Haxell , Lothar Narins

According to a classical result of Spencer, Szemer\'edi, and Trotter (1984), the maximum number of times the unit distance can occur among $n$ points in the plane is $O(n^{4/3})$. This is far from Erd\H{o}s's lower bound, $n^{1+O(1/\log\log…

Combinatorics · Mathematics 2025-07-22 János Pach , Orit E. Raz , József Solymosi

Let P be a d-dimensional n-point set. A Tverberg-partition of P is a partition of P into r sets P_1, ..., P_r such that the convex hulls conv(P_1), ..., conv(P_r) have non-empty intersection. A point in the intersection of the conv(P_i)'s…

Computational Geometry · Computer Science 2020-07-02 Wolfgang Mulzer , Daniel Werner

Given any convex $n$-gon, in this article, we: (i) prove that its vertices can form at most $n^2/2 + \Theta(n\log n)$ isosceles trianges with two sides of unit length and show that this bound is optimal in the first order, (ii) conjecture…

Computational Geometry · Computer Science 2010-09-16 Amol Aggarwal

We study the Hilbert series of a family of ideals J_\phi generated by powers of linear forms in k[x_1,...,x_n]. Using the results of Emsalem-Iarrobino, we formulate this as a question about fatpoints in P^{n-1}. In the three variable case…

Algebraic Geometry · Mathematics 2007-05-23 Hal Schenck

We consider non-orientable hyperbolic 3-manifolds of finite volume $M^3$. When $M^3$ has an ideal triangulation $\Delta$, we compute the deformation space of the pair $(M^3, \Delta)$ (its Neumann Zagier parameter space). We also determine…

Geometric Topology · Mathematics 2024-03-27 Juan Luis Durán Batalla , Joan Porti

A celebrated result of Alon and F\"{u}redi gives a tight lower bound on the number of hyperplanes required to cover all points of the Boolean cube $B^n$ except the origin $\bm{0}$. Recent breakthroughs by Sauermann and Wigderson generalized…

Combinatorics · Mathematics 2026-04-21 Zihao Huang , Miao Wang , Suijie Wang

Given positive integers $m_1, m_2, ..., m_n$, and $n$ general points $p_i$ of ${\bf CP}^2$, bounds are given for the least degree $t$ among plane curves passing through each point $p_i$ with multiplicity at least $m_i$, and for the least…

Algebraic Geometry · Mathematics 2007-05-23 Brian Harbourne , Joaquim Roé

We consider bounded solutions of the nonlocal Allen-Cahn equation $$ (-\Delta)^s u=u-u^3\qquad{\mbox{ in }}{\mathbb{R}}^3,$$ under the monotonicity condition $\partial_{x_3}u>0$ and in the genuinely nonlocal regime in…

Analysis of PDEs · Mathematics 2017-11-07 Serena Dipierro , Alberto Farina , Enrico Valdinoci

This is a follow-up of a previous article where we proved local stability estimates for a potential in a Schr\"odinger equation on an open bounded set in dimension $n=3$ from the Dirichlet-to-Neumann map with partial data. The region under…

Analysis of PDEs · Mathematics 2014-05-07 David Dos Santos Ferreira , Pedro Caro , Alberto Ruiz

This paper investigates solution strategies for nonlinear problems in Hilbert spaces, such as nonlinear partial differential equations (PDEs) in Sobolev spaces, when only finite measurements are available. We formulate this as a nonlinear…

Numerical Analysis · Mathematics 2025-06-06 Daozhe Lin , Qiang Du

We consider the Hardy-H\'enon system $-\Delta u =|x|^a v^p$, $-\Delta v =|x|^b u^q$ with $p,q>0$ and $a,b\in {\mathbb R}$ and we are concerned in particular with the Liouville property, i.e. the nonexistence of positive solutions in the…

Analysis of PDEs · Mathematics 2018-10-08 Quoc Hung Phan

Alon and F\"{u}redi (1993) showed that the number of hyperplanes required to cover $\{0,1\}^n\setminus \{0\}$ without covering $0$ is $n$. We initiate the study of such exact hyperplane covers of the hypercube for other subsets of the…

Combinatorics · Mathematics 2021-07-02 James Aaronson , Carla Groenland , Andrzej Grzesik , Tom Johnston , Bartłomiej Kielak
‹ Prev 1 8 9 10 Next ›