相关论文: On angles formed by $N$ points of the Euclidean an…
We give a universal upper bound for the total curvature of minimizing geodesic on a convex surface in the Euclidean space.
Our purpose in this article is first, following [14], to find the topological upper limits of projections of secant planes to $C^{1}$ surfaces and the topological upper limits of projections of secant hyperplanes to $C^{1}$ hypersurfaces…
Upper and lower bounds are given for the maximum Euclidean curvature among faces in Bianchi's fundamental polyhedron for $PSL_2(O)$ in the upper-half space model of hyperbolic space, where $O$ is an imaginary quadratic ring of integers with…
In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular…
A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…
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…
Two mathematical models are developed within the theoretical framework of large strain elasticity for the determination of upper and lower bounds on the total strain energy of a finitely deformed hyperelastic body in unilateral contact with…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. 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 points in the…
Let $U\subset \mathbb{R}^n$ ($n\geq 3$) be an exterior Euclidean domain with smooth boundary $\partial U$. We consider the Steklov eigenvalue problem on $U$. First we derive a sharp lower bound for the first eigenvalue in terms of the…
We show that several types of graph drawing in the hyperbolic plane require features of the drawing to be separated from each other by sub-constant distances, distances so small that they can be accurately approximated by Euclidean…
In this note we establish the existence of a new type of rigidity of symplectic embeddings coming from obligatory intersections with symplectic planes. More precisely, we prove that if a Euclidean ball is symplectically embedded in the…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…
In the Euclidean setting, Napoleon's Theorem states that if one constructs an equilateral triangle on either the outside or the inside of each side of a given triangle and then connects the barycenters of those three new triangles, the…
We extend to higher dimensions earlier sharp bounds for the area of two dimensional free boundary minimal surfaces contained in a geodesic ball of the round sphere. This follows work of Brendle and Fraser-Schoen in the euclidean case.
Conditions, related to the so-called bending problem are considered for hypersurfaces of a pseudo-Euclidean space. Corresponding theorems are proved.
Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that $n$ is a multiple of some fixed positive integer $k$. The…
Computer vision tasks such as image classification, image retrieval and few-shot learning are currently dominated by Euclidean and spherical embeddings, so that the final decisions about class belongings or the degree of similarity are made…
New isoperimetric inequalities for lower order eigenvalues of the Laplacian on closed hypersurfaces, of the biharmonic Steklov problems and of the Wentzell-Laplace on bounded domains in a Euclidean space are proven. Some open questions for…
The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular $k$-gonal tile…
A lower bound on the minimum degree of the plane algebraic curves containing every point in a large point-set $K$ of the Desarguesian plane $PG(2,q)$ is obtained. The case where $K$ is a maximal $(k,n)$-arc is considered to greater extent.