English
Related papers

Related papers: A new upper bound for the Heilbronn triangle probl…

200 papers

A recent generalization of the Erd\H{o}s Unit Distance Problem, proposed by Palsson, Senger and Sheffer, asks for the maximum number of unit distance paths with a given number of vertices in the plane and in $3$-space. Studying a variant of…

Combinatorics · Mathematics 2023-01-23 Nora Frankl , Dora Woodruff

Let $(R,\m)$ be a formally unmixed local ring of positive prime characteristic and dimension $d$. We examine the implications of having small Hilbert-Kunz multiplicity (i.e., close to 1). In particular, we show that if $R$ is not regular,…

Commutative Algebra · Mathematics 2008-04-07 Ian M. Aberbach , Florian Enescu

Zarankiewicz's problem asks for the largest possible number of edges in a graph that does not contain a $K_{u,u}$ subgraph for a fixed positive integer $u$. Recently, Fox, Pach, Sheffer, Sulk and Zahl considered this problem for…

Combinatorics · Mathematics 2018-10-02 Thao Do

A classical result of Honsberger states that the number of incongruent triangles with integer sides and perimeter $n$ is the nearest integer to $\frac{n^2}{48}$ ($n$ even) or $\frac{(n+3)^2}{48}$ ($n$ odd). We solve the analogous problem…

Combinatorics · Mathematics 2019-07-10 James East , Ron Niles

We prove a new kind of estimate that holds on any manifold with lower Ricci bounds. It relates the geometry of two small balls with the same radius, potentially far apart, but centered in the interior of a common minimizing geodesic. It…

Differential Geometry · Mathematics 2011-09-23 Tobias Colding , Aaron Naber

In this survey article, we are interested on minimal triangulations of closed pl manifolds. We present a brief survey on the works done in last 25 years on the following: (i) Finding the minimal number of vertices required to triangulate a…

Geometric Topology · Mathematics 2007-05-23 Basudeb Datta

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

Mantel's theorem states that every $n$-vertex graph with $\lfloor \frac{n^2}{4} \rfloor +t$ edges, where $t>0$, contains a triangle. The problem of determining the minimum number of triangles in such a graph is usually referred to as the…

Combinatorics · Mathematics 2021-06-14 József Balogh , Felix Christian Clemen

Various inequalities exist between the area of a triangle, the perimeter squared $(a+b+c)^2$ and the isoperimetric deficit $Q=(a-b)^2+(b-c)^2+(c-a)^2$. The direct and reverse Finsler-Hadwiger inequalities correspond to the best linear…

Optimization and Control · Mathematics 2025-08-11 Beniamin Bogosel

The space of unitary $C_{0}$-semigroups on separable infinite dimensional Hilbert space, when viewed under the topology of uniform weak convergence on compact subsets of $\mathbb{R}_{+}$, is known to admit various interesting residual…

Functional Analysis · Mathematics 2023-02-02 Raj Dahya

We prove a structural theorem that provides a precise local picture of how a sequence of closed embedded minimal hypersurfaces with uniformly bounded index (and volume if the ambient dimension is greater than three) in a Riemannian manifold…

Differential Geometry · Mathematics 2019-07-01 Otis Chodosh , Daniel Ketover , Davi Maximo

Fix an arbitrary compact orientable surface with a boundary and consider a uniform bipartite random quadrangulation of this surface with $n$ faces and boundary component lengths of order $\sqrt n$ or of lower order. Endow this…

Probability · Mathematics 2025-09-16 Jérémie Bettinelli , Grégory Miermont

The Erd\H os unit distance conjecture in the plane says that the number of pairs of points from a point set of size $n$ separated by a fixed (Euclidean) distance is $\leq C_{\epsilon} n^{1+\epsilon}$ for any $\epsilon>0$. The best known…

Classical Analysis and ODEs · Mathematics 2017-09-26 Alex Iosevich

A simplicial complex of dimension $d-1$ is said to be balanced if its graph is $d$-colorable. Juhnke-Kubitzke and Murai proved an analogue of the generalized lower bound theorem for balanced simplicial polytopes. We establish a…

Combinatorics · Mathematics 2016-08-30 Martina Juhnke-Kubitzke , Satoshi Murai , Isabella Novik , Connor Sawaske

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 perform a refined blow up analysis of finite energy approximated solutions to a Nirenberg type problem on half spheres. The later consists of prescribing, under minimal boundary conditions, the scalar curvature to be a…

Analysis of PDEs · Mathematics 2022-09-13 Mohameden Ahmedou , Mohamed Ben Ayed

The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…

Combinatorics · Mathematics 2013-10-29 Francisco Santos

We study min-max theory for area functional among hypersurfaces constrained in a smooth manifold with boundary. A Schoen-Simon-type regularity result is proved for integral varifolds which satisfy a variational inequality and restrict to a…

Differential Geometry · Mathematics 2020-10-27 Zhihan Wang

We extend (and somewhat simplify) the algebraic proof technique of Guth and Katz \cite{GK}, to obtain several sharp bounds on the number of incidences between lines and points in three dimensions. Specifically, we show: (i) The maximum…

Computational Geometry · Computer Science 2009-05-12 György Elekes , Haim Kaplan , Micha Sharir

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Combinatorics · Mathematics 2018-01-19 Larry Guth , Joshua Zahl
‹ Prev 1 8 9 10 Next ›