Pappus's hexagon theorem for geodesic curves in $\SLR$ geometry

Jenő Szirmai

Home/Archive/arXiv

arXiv · 2611.08234

Pappus's hexagon theorem for geodesic curves in $\SLR$ geometry

Jenő Szirmai

View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we continue our investigation of the structure of Thurston geometries with non-constant curvature. We generalize the notion of cylinders, prove that they contain the types of geodesic curves. Moreover, we formulate and prove a statement analogous to Pappus's hexagon theorem for $\SLR$ geometry.

Explore related subjects

math.MG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Jenő Szirmai. 2026-11-05. Pappus's hexagon theorem for geodesic curves in $\SLR$ geometry. https://arxiv.org/abs/2611.08234

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

KEEP EXPLORING

Related papers

arXiv2026

Strong Negative Type of Star-shaped Manifolds

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. Finally, we prove that under similar conditions, SNT holds for almost and essentially star-shaped manifolds, and for those with incomplete radial coverage.

math.MG↗

arXiv2026

An elementary proof of a tangent-cone identity for rank-one planar Lipschitz maps

We give an elementary proof of a tangent-cone identity which might be known to specialists in geometric measure theory. It concerns Lipschitz mappings $g$ from the closed unit ball $B\subset\mathbb{R}^2$ to $\mathbb{R}^2$. Let $x$ be an interior point of differentiability of $g$ at which $Dg(x)$ has rank one. If the upper one-dimensional Hausdorff density of $g(B)$ at $g(x)$ is at most one, then the tangent cone to $g(B)$ at $g(x)$ coincides with the image of $Dg(x)$. This property is used in the proof of rigidity for the four-gradient problem. We provide a detailed, self-contained proof based on differentiability, connectedness and elementary estimates for one-dimensional Hausdorff measure, without using advanced methods from geometric measure theory.

math.MG↗

arXiv2026

Isosceles sets and two-distance sets in Euclidean space

A finite set of points in $\mathbb{R}^d$ is isosceles if every three of its points form an isosceles triangle. Erdős asked in 1946 for the largest size $\mathrm{iso}(d)$ of an isosceles set in $\mathbb{R}^d$; the answer was known for $d\le8$. Let $g(d)$ and $M(d)$ be the largest sizes of a two-distance set and of a spherical two-distance set in $\mathbb{R}^d$. We prove that $\mathrm{iso}(d)=\max\{g(d),M(d)+1,M(d-1)+3\}$ for every $d\ge2$, which reduces the problem to these two classical ones. With the recently determined values of $g(d)$ for $9\le d\le22$ we obtain $\mathrm{iso}(d)=\binom{d+1}{2}+1$ for $9\le d\le21$ and $\mathrm{iso}(22)=276$, and we show that the extremal set is unique: for $d\le21$ it is the set of midpoints of the edges of a regular simplex together with its centroid, and for $d=22$ it is the McLaughlin configuration together with its centre. For $10\le d\le22$ every isosceles set with more than $\binom d2+3$ points is a two-distance set or a spherical two-distance set together with its centre. The proofs start from Blokhuis' decomposition of isosceles sets into mutually orthogonal two-distance sets. Counting leaves one configuration open: a two-distance set with $\binom{d+1}{2}$ points in a hyperplane, the largest number allowed by Blokhuis' bound, together with two points that are mirror images of each other. We exclude it by showing that a two-distance set $T$ attaining Blokhuis' bound in $\mathbb{R}^n$ is unisolvent for quadratic polynomials and that, if $T$ lies on two concentric spheres, then apart from two exceptional cases its two layers are spherical $2$-designs whose sizes are determined by the radii. We also show that the squared distances of such a set are in ratio $(k-1):k$ with $(2k-1)^2\le n+1$ if $n\ge9$. Hence there is none for $9\le n\le23$, so that $g(23)\le299$ and $\mathrm{iso}(23)=\max\{g(23),278\}\le299$.

math.MG↗