相关论文: On angles formed by $N$ points of the Euclidean an…
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…
We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…
We consider the characteristic problem for the ultrahyperbolic equation in the Euclidean space. The value of a solution is prescribed on the characteristic hyperplane. A well-posed set-up of the problem is discussed. We obtain a certain…
The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…
We study the problem of generating a hyperplane tessellation of an arbitrary set $T$ in $\mathbb{R}^n$, ensuring that the Euclidean distance between any two points corresponds to the fraction of hyperplanes separating them up to a…
This note concerns the area growth and bottom spectrum of complete stable minimal surfaces in a three-dimensional manifold with scalar curvature bounded from below. When the ambient manifold is the Euclidean space, by an elementary…
We present a new model of a non-Euclidean plane, in which angles in a triangle sum up to $\pi$. It is a subspace of the Cartesian plane over the field of hyperreal numbers $\mathbb{R}^*$. The model enables one to represent the negation of…
We consider the problem of finding an $N$-point configuration on the sphere $S^d\subset \RR^{d+1}$ with the smallest absolute maximum value over $S^d$ of its total potential. The potential induced by each point ${\bf y}$ in a given…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Somewhat less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear…
We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…
A simple n-gon is a polygon with n edges such that each vertex belongs to exactly two edges and every other point belongs to at most one edge. Brass, Moser and Pach asked the following question: For n > 3 odd, what is the maximum perimeter…
Theoretical background is provided towards the mathematical foundation of the minimum enclosing ball problem. This problem concerns the determination of the unique spherical surface of smallest radius enclosing a given bounded set in the…
We consider the ultrahyperbolic equation in the Euclidean space. The behavior at the infinity of a certain class of solutions is studied. We examine the issue of existence of solutions to the scattering problem: for a given asymptotics at…
We consider an isoperimetric problem involving the smallest positive and largest negative curl eigenvalues on abstract ambient manifolds, with a focus on the standard model spaces. We in particular show that the corresponding eigenvalues on…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…
The method of finding the minimal distance between smooth non crossing submanifolds in N-dimensional Euclidean space are presented. It based on solution of the equations that describe the dynamics of the pair of material points. The…
Using the method of C. V\"or\"os, we establish results on hyperbolic plane geometry, related to triangles. In this note we investigate the orthocenter, the concept of isogonal conjugate and some further center as of the symmedian of a…
We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…
We prove a lower bound for the topological complexity, in the sense of Smale, of the problem of finding a flex point on a cubic plane curve. The key is to bound the Schwarz genus of a cover associated to this problem. We also show that our…