度量几何
We show that the tools recently introduced by the first author in [9] allow to give a PDE description of p-harmonic functions in metric measure setting. Three applications are given: the first is about new results on the sheaf property of…
We study the properties of Kokotsakis polyhedra of orthodiagonal anti-involutive type. Stachel conjectured that a certain resultant connected to a polynomial system describing flexion of a Kokotsakis polyhedron must be reducible. Izmestiev…
Let $\mathcal{E}$ be an ellipsoid in $\mathbb{R}^n$. A. Gusakova and D. Zaporozhets conjectured that $\mathcal{E}$ is uniquely (up to rigid motions) determined by its intrinsic volumes. We prove this conjecture for $n = 3$.
The space of $n$-dimensional relativistic velocities normalized to $c = 1$, $$\mathbb{B} = \{\mathbf{v}\in\mathbb{R}^n\colon \|\mathbf{v}\| < 1\},$$ is naturally associated with Einstein velocity addition $\oplus_E$, which induces the…
The orthoscheme complex of a graded poset is a metrization of its order complex such that the simplex of each maximal chain is isometric to the Euclidean simplex of vertices $0, e_1,e_1+e_2,\ldots, e_1+e_2+ \cdots + e_n$. This notion was…
Let $Q_n=[0,1]^n$ be the unit cube in ${\mathbb R}^n$, $n \in {\mathbb N}$. For a nondegenerate simplex $S\subset{\mathbb R}^n$, consider the value $\xi(S)=\min \{\sigma>0: Q_n\subset \sigma S\}$. Here $\sigma S$ is a homothetic image of…
We combine geometric methods with numerical box search algorithm to show that the minimal area of a convex set on the plane which can cover every closed plane curve of unit length is at least 0.0975. This improves the best previous lower…
The line packing problem is concerned with the optimal packing of points in real or complex projective space so that the minimum distance between points is maximized. Until recently, all bounds on optimal line packings were known to be…
Recent progress in Zauner's conjecture has leveraged deep conjectures in algebraic number theory to promote numerical line packings to exact and verifiable solutions to the line packing problem. We introduce a numerical-to-exact technique…
In this note we study the maximal perimeter of a convex set in $\mathbb{R}^n$ with respect to various classes of measures. Firstly, we show that for a probability measure $\mu$ on $ \mathbb{R}^n$, satisfying very mild assumptions, there…
Log-Brunn-Minkowski inequality was conjectured by Bor\"oczky, Lutwak, Yang and Zhang \cite{BLYZ}, and it states that a certain strengthening of the classical Brunn-Minkowski inequality is admissible in the case of symmetric convex sets. It…
We investigate the class of geodesic metric discs satisfying a uniform quadratic isoperimetric inequality and uniform bounds on the length of the boundary circle. We show that the closure of this class as a subset of Gromov-Hausdorff space…
The purpose of this work is to give a direct proof of the multiplicative Brunn-Minkowski inequality in nilpotent Lie groups based on Hadwiger-Ohmann's one of the classical Brunn-Minkowski inequality in Euclidean space.
An exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle is given.
In some applications, like some areas in stochastic geometry, a convenient change of variables involves spheres. In this review we summarize formulas of Blaschke-Petkantschin type, that help to pass from integration over $k$-tuples of…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
An extension is given of a recent result of Glazyrin, showing that an orthonormal basis $\{e_{i}\}_{i=1}^{d}$ joined with the vectors $\{e_{j}\}_{j=1}^{m}$, where $1\leq m < d$ minimizes the $p$-frame potential for…
We have constructed a realization of rectilinear geodesic (in the sense of~\cite{Memoli2018}), lying in Gromov-Hausdorff space, as a shortest geodesic w.r.t. the Hausdorff distance in an ambient metric space.
A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…
A finite set of points in $\mathbb R^d$ is called almost-equidistant if among any three distinct points in the set, some two are at unit distance. We prove that an almost-equidistant set in $\mathbb R^d$ has cardinality at most $5d^{13/9}$.