Related papers: Bisectors and pinned distances
We present in this paper a \boundary version" for theorems about minimality of volume and energy functionals on a spherical domain of threedimensional Euclidean sphere.
New lower bounds for the binding energy of a quantum-mechanical system of interacting particles are presented. The new bounds are expressed in terms of two-particle quantities and improve the conventional bounds of the Hall-Post type. They…
We prove a result on lower bounds in large dimensions.
The problem of bounding of the distance between the two bodies of volume $\varepsilon$ located inside the $n$-dimensional body $B$ of unit volume where $n \to \infty$ is considered. In some cases such distances are bounded by function…
We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$
We show that affine coordinate subspaces of dimension at least two in Euclidean space are of Khintchine type for divergence. For affine coordinate subspaces of dimension one, we prove a result which depends on the dual Diophantine type of…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
We give bounds on geodesic distances on the Stiefel manifold, derived from new geometric insights. The considered geodesic distances are induced by the one-parameter family of Riemannian metrics introduced by H\"uper et al. (2021), which…
The "Perpendicular Bisectors Construction" is a natural way to seek a replacement for the circumcenter of a noncyclic quadrilateral in the plane. In this paper, we generalize this iterative construction to a construction on polytopes with…
In this note, we consider two types of estimates for the Harnack distance in bounded domains of a finite-dimensional Euclidean space. The first type is based on the geometric concept of the entropy of arcwise connectedness. We used this…
We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve previous bounds by Haussler. The bounds are based on a simple…
An upper bound on degrees of elements of a minimal generating system for invariants of quivers of dimension (2,...,2) is established over a field of arbitrary characteristic and its precision is estimated. The proof is based on the…
We obtain upper and lower bounds for Steklov eigenvalues of submanifolds with prescribed boundary in Euclidean space. A very general upper bound is proved, which depends only on the geometry of the fixed boundary and on the measure of the…
We consider the variational problem of minimizing an anisotropic perimeter functional under a volume constraint in a Euclidean convex domain. We extend to this setting analytical properties of the isoperimetric profile, topological features…
We derive a new bound for some bilinear sums over points of an elliptic curve over a finite field. We use this bound to improve a series of previous results on various exponential sums and some arithmetic problems involving points on…
We give an explicit upper bound for the number of equivalence classes of binary forms with rational integral coefficients of given degree and given discriminant, and with given splitting field. Further, we give an explicit upper bound for…
We study the scaling limit and prove the law of large numbers for weakly pinned Gaussian random fields under the critical situation that two possible candidates of the limits exist at the level of large deviation principle. This paper…
This paper considers overdetermined boundary problems. Firstly, we give a proof to the Payne-Schaefer conjecture about an overdetermined problem of sixth order in the two dimensional case and under an additional condition for the case of…
We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.
In this paper, we use a weighted isoperimetric inequality to give a lower bound on the first Dirichlet eigenvalue of the Laplacian on a bounded domain inside a Euclidean cone. Our bound is sharp, in that only sectors realize it. This result…