English
Related papers

Related papers: Upper bounds for Heilbronn's triangle problem in h…

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

Let $M$ be a compact $n$-dimensional Riemannian manifold with nonnegative Ricci curvature and mean convex boundary $\partial M$. Assume that the mean curvature $H$ of the boundary $\partial M$ satisfies $H \geq (n-1) k >0$ for some positive…

Differential Geometry · Mathematics 2020-01-06 Martin Li

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

Let $k,d,\lambda \geqslant 1$ be integers with $d\geqslant \lambda $ and let $X$ be a finite set of points in $\mathbb{R}^{d}$. A $(d-\lambda)$-plane $L$ transversal to the convex hulls of all $k$-sets of $X$ is called Kneser transversal.…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

Computational Geometry · Computer Science 2014-02-04 Adrian Dumitrescu , Sariel Har-Peled , Csaba D. Tóth

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

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Combinatorics · Mathematics 2025-09-03 Wei-Chun Chen , Wei-Hsuan Yu

In the course of classifying generic sparse polynomial systems which are solvable in radicals, Esterov recently showed that the volume of the Minkowski sum $P_1+\dots+P_d$ of $d$-dimensional lattice polytopes is bounded from above by a…

Metric Geometry · Mathematics 2020-12-22 Gennadiy Averkov , Christopher Borger , Ivan Soprunov

Let \((a_n)_{n \in \mathbb{N}}\) be a lacunary sequence of integers satisfying the Hadamard gap condition. For any fixed dimension $d \geq 1$, we establish asymptotic upper bounds for the maximal gap in the set of dilates…

Number Theory · Mathematics 2025-08-26 Eduard Stefanescu

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

Metric Geometry · Mathematics 2025-08-26 Travis Dillon

We derive upper and lower bounds on the gradients of Wachspress coordinates defined over any simple convex d-dimensional polytope P. The bounds are in terms of a single geometric quantity h_*, which denotes the minimum distance between a…

Numerical Analysis · Mathematics 2022-02-22 Michael Floater , Andrew Gillette , N. Sukumar

In 1992, Kalai and Kleitman proved that the diameter of a $d$-dimensional polyhedron with $n$ facets is at most $n^{2+\log_2 d}$. In 2014, Todd improved the Kalai-Kleitman bound to $(n-d)^{\log_2 d}$. We improve the Todd bound to…

Optimization and Control · Mathematics 2017-09-29 Noriyoshi Sukegawa

For every fixed dimension $d$ and sufficiently large $n$, we determine the maximum possible diameter of a strongly connected $d$-dimensional simplicial complex on $n$ vertices. This improves on a sequence of previous results and settles a…

Combinatorics · Mathematics 2026-02-25 Stefan Glock , Olaf Parczyk , Silas Rathke , Tibor Szabó

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak

Higher-dimensional Dedekind sums are defined as a generalization of a recent 1-dimensional probability model of Dilcher and Girstmair to a d-dimensional cube. The analysis of the frequency distribution of marked lattice points leads to new…

Number Theory · Mathematics 2007-05-23 Matthias Beck , Sinai Robins , Shelemyahu Zacks

In this paper, we study the potential singular points of interior and boundary suitable weak solutions to the 3D Navier--Stokes equations. It is shown that upper box dimension of interior singular points and boundary singular points are…

Analysis of PDEs · Mathematics 2020-01-08 Yanqing Wang , Minsuk Yang

Let $S$ be a $k$-colored (finite) set of $n$ points in $\mathbb{R}^d$, $d\geq 3$, in general position, that is, no {$(d + 1)$} points of $S$ lie in a common $(d - 1)$}-dimensional hyperplane. We count the number of empty monochromatic…

Combinatorics · Mathematics 2012-10-29 Oswin Aichholzer , Ruy Fabila-Monroy , Thomas Hackl , Clemens Huemer , Jorge Urrutia

For n > d/2, the Sobolev (Bessel potential) space H^n(R^d, C) is known to be a Banach algebra with its standard norm || ||_n and the pointwise product; so, there is a best constant K_{n d} such that || f g ||_{n} <= K_{n d} || f ||_{n} || g…

Functional Analysis · Mathematics 2007-05-23 Carlo Morosi , Livio Pizzocchero

Bounding the number of rational points of height at most $H$ on irreducible algebraic plane curves of degree $d$ has been an intense topic of investigation since the work by Bombieri and Pila. In this paper we establish optimal dependence…

Number Theory · Mathematics 2023-09-21 Gal Binyamini , Raf Cluckers , Dmitry Novikov

Let $Q_n$ be the cube of side length one centered at the origin in $\mathbb{R}^n$, and let $F$ be an affine $(n-d)$-dimensional subspace of $\mathbb{R}^n$ having distance to the origin less than or equal to $\frac 1 2$, where $0<d<n$. We…

Metric Geometry · Mathematics 2019-11-20 Hermann König , Mark Rudelson