Strong Negative Type of Star-shaped Manifolds

Hang Liu; Ziyan Xu

Home/Archive/arXiv

arXiv · 2610.20023

Strong Negative Type of Star-shaped Manifolds

Hang Liu·Ziyan Xu

View original source ↗Read source document ↗Export metadata ↓

Abstract

Metric spaces of negative type (NT) and strong negative type (SNT) are fundamental in wide applications across computer science and statistics. It is well-known that spheres equipped with geodesic distance are of NT, and subsets of a sphere that contain at most one pair of antipodal points (e.g. an open hemisphere) are of SNT. In this paper, we extend these results to a class of star-shaped manifolds. By constructing a metric $d$ based on layer-wise radial projections, we prove that every star-shaped manifold, equipped with $d$, is of NT. Moreover, we prove that a subset of a star-shaped manifold is of SNT under certain injectivity and directional asymmetry conditions. In particular, for a subset of a single layer, it is of SNT if it contains exactly one point from each preimage of an open hemisphere (a fully directional asymmetry); moreover, it is of SNT if and only if it contains at most one opposite-directional pair.

Explore related subjects

math.MG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Hang Liu, Ziyan Xu. 2026-10-14. Strong Negative Type of Star-shaped Manifolds. https://arxiv.org/abs/2610.20023

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Insertion and expansion of cylinders around the unit ball

A unit ball is surrounded with a ring of $n$ equal infinite circular cylinders. Each cylinder touches the ball and its two neighbors. Can one more cylinder of the same radius be added if the configuration may be rearranged? Can the $n$ cylinders instead be enlarged, and by how much? We prove that insertion is impossible for $3\le n\le7$ and possible for $n\ge9$. The case $n=8$ remains open. The case $n=6$ is Kuperberg's problem from 1990, which was resolved recently. We prove that the ring of four cylinders cannot be expanded. This settles a conjecture of Ogievetsky and Shlosman from 2018. For $n\ge5$ the largest possible expansion radius remains unknown.

math.MG↗

arXiv2026

Quasiconformal uniformization and extension for planar trees

A classical uniformization theorem of Ahlfors from 1963 asserts that every bounded turning planar arc is the image of the unit segment under a quasiconformal self-map of the plane. We prove an analogous uniformization theorem for planar trees by showing that every planar quasiconformal tree with uniform branch separation is quasiconformally equivalent to a quasiconvex planar tree with uniform branch separation and Hausdorff dimension arbitrarily close to 1. Along the way, we show that every quasisymmetric (resp. bi-Lipschitz) homeomorphism between planar quasiconformal trees that respects the counterclockwise orientation of the branches at every branch point can be extended quasisymmetrically (resp. bi-Lipschitz) to the whole plane. As a corollary of the extension theorem we construct a large class of quadrivalent quasiconformal trees, which includes the Vicsek fractal, so that each tree in this class is the Julia set of a uniformly quasiregular map of $\mathbb{R}^2$.

math.MG↗

arXiv2026

A short open space curve of unit width

In this work, we propose a curve to be a minimum of length among rectifiable, continuous curves of unit width in three-dimensional Euclidean space. We show that a previously conjectured minimizer of that problem is not of unit width, give the numerical derivation of a candidate family of unit width curves, prove that it admits a strict local minimum within that candidate family and that this minimum is of unit width and length $3.905124162243593\ldots$. The curve consists of eight straight segments, two cone geodesics, and three circular helices. Its parameters are specified by a uniquely isolated solution of the joining and stationarity equations. To establish unit width in every direction, we combine analytic estimates with interval arithmetic on a finite covering of the remaining directions. We conjecture that the curve is globally minimizing. We supplement this work with the programs used to identify the candidates, replicate the computer-assisted parts of our proof, as well as a formalization of our proof in Lean.

math.MG↗