Related papers: Heilbronn's triangle problem in three dimensions

Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…

Let $X$ be a very general degree $d\geq 5$ hypersurface in $\mathbb{P}^3$. We compute the ample cone of the Hilbert scheme $X^{[n]}$ of $n$ points on $X$ for various small values of $n$ (the answer is already known for large $n$). We obtain…

The three-dimensional quasi-geostrophic equation is considered over a cylindrical domain with a multiply connected horizontal cross-section. Homogeneous Neumann boundary conditions, tantamount to homogeneous density fields, are imposed on…

Neumann-Lara and Urrutia showed in 1985 that in any set of n points in the plane in general positionthere is always a pair of points such that any circle through them contains at least (n-2)/60 points. In a series of papers, this result was…

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

In 1973, Brown, Erd\H{o}s and S\'os proved that if $\mathcal{H}$ is a 3-uniform hypergraph on $n$ vertices which contains no triangulation of the sphere, then $\mathcal{H}$ has at most $O(n^{5/2})$ edges, and this bound is the best possible…

We prove that bounded solutions to an overdetermined fully nonlinear free boundary problem in the plane are one dimensional. Our proof relies on maximum principle techniques and convexity arguments.

The aim of this paper is to consider the Lobachevskii geometry analog of a well-known Euclidian problem; namely: to find a triangle with two fixed sides and the maximum area

We determine the maximal non-central hyperplane sections of the n-dimensional $l_1$-ball if the fixed distance of the hyperplane to the origin is between $1 / \sqrt 3$ and $1 / \sqrt 2$. This adds to a result of Liu and Tkocz who considered…

Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…

In this paper we classify the solutions to the geometric Neumann problem for the Liouville equation in the upper half-plane or an upper half-disk, with the energy condition given by finite area. As a result, we classify the conformal…

Let $H_n$ be the minimal number of smaller homothetic copies of an $n$-dimensional convex body required to cover the whole body. Equivalently, $H_n$ can be defined via illumination of the boundary of a convex body by external light sources.…

We prove that for any nonlinear $f \in C^{1,\alpha}([0,1])$, the union of lines covering its graph has a Hausdorff dimension of at least $1+\alpha$, and this dimension bound is sharp. We then apply these geometric results to mathematical…

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

In 1946, Erd\H{o}s posed the distinct distance problem, which seeks to find the minimum number of distinct distances between pairs of points selected from any configuration of $n$ points in the plane. The problem has since been explored…

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the…

We resolve a conjecture posed by Covella, Frati and Patrignani by proving the straight-line orthogonal drawing of the complete ternary tree with $n$ nodes satisfying the subtree separation property with smallest area has area…

The maximum number of non-crossing straight-line perfect matchings that a set of $n$ points in the plane can have is known to be $O(10.0438^n)$ and $\Omega^*(3^n)$. The lower bound, due to Garc\'ia, Noy, and Tejel (2000) is attained by the…

This note is motivated by the Question 16 of http://cubics.wikidot.com: Which configurations of 15 points in the projective 3-space arise as eigenpoints of a cubic surface? We prove that a general eigenscheme in the projective n-space is…

The three gap theorem, also known as the Steinhaus conjecture or three distance theorem, states that the gaps in the fractional parts of $\alpha,2\alpha,\ldots, N\alpha$ take at most three distinct values. Motivated by a question of…