Skip to main content
archive Search
Submit Donate Log in

Press Enter to search · Advanced search

Metric Geometry

  • New submissions
  • Cross-lists
  • Replacements

See recent articles

Showing new listings for Monday, 16 November 2026

Total of 17 entries
Showing up to 2000 entries per page: fewer | more | all

New submissions (showing 5 of 5 entries)

[1] arXiv:2611.17375 [pdf, html, other]
Title: The four-dimensional Borsuk number is five or six
Logan R. Chalmers
Comments: The main theorem is formalised in Lean 4 using only the standard axioms of propositional extensionality, classical choice, and quotient soundness. Available at doi:https://doi.org/10.5281/zenodo.23966881
Subjects: Metric Geometry (math.MG)

Can every set of diameter one in four dimensions be split into at most five parts of smaller diameter? Three parts suffice in the plane and four in three-dimensional space. In four dimensions five parts are sometimes necessary. We prove that six always suffice, improving the previous upper bound of seven. For small circumradius we use six cones. For large circumradius five balls meet every diametral pair of a compact set. At intermediate radii we bound the diameter of each part by the diameter of a rational polytope. The theorem is formalised in Lean.

[2] arXiv:2611.17926 [pdf, html, other]
Title: A solution to Petty's polar projection problem
Yiqian Zhang
Comments: 6 pages,1 figure
Subjects: Metric Geometry (math.MG)

In 1971, Petty asked whether a convex body in $\mathbb{R}^n$, $n\geqslant 3$, must be an ellipsoid if its projection body is a dilate of its polar. In this paper, we give an affirmative answer to this question.

[3] arXiv:2611.18138 [pdf, html, other]
Title: Universal Spaces for Coarsely Light Maps
David Hume, Harsh Patil
Comments: 9 pages
Subjects: Metric Geometry (math.MG); Group Theory (math.GR)

Coarsely light maps were introduced by Dydak--Weighill as a large-scale analogue of light maps. We show that a proper metric space has asymptotic dimension at most $n$ if and only if it admits a coarsely light map to $\mathbb R^n$. As an application, we resolve two questions of Benjamini--Schramm--Timár concerning semi-regular maps.

[4] arXiv:2611.18216 [pdf, html, other]
Title: On weakly m-convex sets, m=1,...,n-1, in n-dimensional Euclidean spaces
Tetiana M. Osipchuk
Comments: 7 pages, 2 figures
Subjects: Metric Geometry (math.MG)

We study general topological properties of open and closed weakly $m$-convex sets, $m=1,\ldots, n-1$, in the real $n$-dimensional Euclidean space $\mathbb{R}^n$, $n\geqslant2$. An open set in $\mathbb{R}^n$ is called weakly $m$-convex if, through every boundary point of the set, there passes an $m$-dimensional plane that does not intersect the set. A closed set in $\mathbb{R}^n$ is weakly $m$-convex if it can be approximated from the outside by a countably decreasing family of open weakly $m$-convex sets. The set of all points in the complement of a given subset of $\mathbb{R}^n$ through each of which every $m$-dimensional plane intersects the subset is called the $m$-nonconvexity-point set corresponding to the given subset. We prove that the nonempty $m$-nonconvexity-point set corresponding to an open weakly $m$-convex set is itself open and weakly $m$-convex, and that the interior of every closed weakly $m$-convex set with nonempty interior is weakly $m$-convex for every $m=1,\ldots, n-1$.

[5] arXiv:2611.18381 [pdf, html, other]
Title: Fourier Harmonics and Pentagonal Rigidity in the Planar Ulam Floating Body Problem
Oleg Asipchuk, Maksim Kosmakov
Subjects: Metric Geometry (math.MG)

We give a new proof that the disk is the only strictly convex planar body floating in equilibrium in every orientation at perimetral densities $\sigma=1/5$ and $\sigma=2/5$. The proof uses the Fourier harmonics of the chord-angle function and the closure relations of the associated pentagonal carousel. Their combination gives inequalities that force the body to be a disk.

Cross submissions (showing 1 of 1 entries)

[6] arXiv:2611.17496 (cross-list from math.DG) [pdf, html, other]
Title: Wasserstein geometry of analytic cycle spaces
Fabio Cavalletti, Lorenzo Cecchi, Antonio Lerario
Subjects: Differential Geometry (math.DG); Algebraic Geometry (math.AG); Metric Geometry (math.MG)

We use optimal transport to define an intrinsic distance on connected components of the Barlet space of analytic cycles on a compact Kähler manifold, by associating to each cycle its normalized volume measure. We prove that any two cycles in the same connected component can be joined by a deformation of finite Wasserstein length, and that the resulting metric is complete and geodesic. On the locus of smooth reduced cycles at regular parameter points, Wasserstein lengths and energies coincide with those of the normalized Weil--Petersson metric. The construction thus gives a transport interpretation of Weil--Petersson geometry and extends beyond it to components containing no smooth reduced cycles.

Replacement submissions (showing 11 of 11 entries)

[7] arXiv:2607.29458 (replaced) [pdf, html, other]
Title: Optimal MM* bounds for convex bodies
Pierre Bizeul
Comments: journal version
Subjects: Metric Geometry (math.MG); Functional Analysis (math.FA); Probability (math.PR)

Let $K\subset\R^n$ be a convex body in isotropic position. We prove the optimal mean-width estimate \[
M^*(K)\leq C\sqrt{n\log n}. \] The main new ingredient is a geometric inequality relating the Gaussian mean of the support function to its mean under the uniform measure on $K$, obtained through a heat-flow argument. Combined with the Gaussian-log-concave comparison of Eldan and Lehec and the newly available dimension-free bound on the third-moment parameter $\kappa_n$, this yields the result. The boundedness of $\kappa_n$ also makes the mean-norm estimate of Bizeul and Klartag sharp. Combining both estimates yields \[
M(K)M^*(K)\leq C\log n, \] extending Pisier's $MM^*$ estimate to non-symmetric convex bodies and to the isotropic position.

[8] arXiv:2608.14013 (replaced) [pdf, html, other]
Title: Kusner's conjecture on equilateral sets is false
Logan R. Chalmers
Comments: The counterexample (Theorem 1) has been formalised in Lean from standard axioms. Lean proof: this https URL
Subjects: Metric Geometry (math.MG); Combinatorics (math.CO); Numerical Analysis (math.NA)

We disprove Kusner's 1983 conjecture that every equilateral set in $\ell_p^n$ with $2<p<\infty$ has at most $n+1$ points: there exist $58$ points in $\mathbb{R}^{56}$ whose pairwise $\ell_5$ distances are all equal, so the maximum equilateral-set size satisfies $e(\ell_5^{56})\ge58>57$. This is the first equilateral set of more than $n+1$ points in $\ell_p^n$ for any finite $p\ge2$. The construction persists on an open interval of exponents around $5$. The configuration is specified by the unique solution of an explicit polynomial system with rational coefficients in a rational box; existence and uniqueness are proved by exact integer inequalities. The existence of the $58$-point equilateral set in $\ell_5^{56}$ has been formalised in Lean from standard axioms.

[9] arXiv:2611.12866 (replaced) [pdf, html, other]
Title: Coarse Embeddings Beyond Doubling: Persistence Diagrams and Multiparameter Modules
Sushovan Majhi, Atish Mitra, Žiga Virk
Comments: 23 pages, 3 figures. Companion paper: arXiv:2611.16965
Subjects: Metric Geometry (math.MG); Algebraic Topology (math.AT)

We study coarse embeddings into Hilbert space and the asymptotic dimension of spaces of persistence diagrams and multiparameter persistence modules. We build coarse embeddings from admissible tent covers of bounded multiplicity at every scale, which doubling spaces carry but which do not require doubling: stacking them across dyadic scales gives an explicit $1$-Lipschitz coarse embedding, with lower gauge $c\sqrt{\tau t}$, or nearly linear for slowly decaying weights, and the same covers bound the asymptotic dimension by the multiplicity. The spaces of persistence diagrams are not doubling but carry such covers, and for diagrams with at most $n$ points our covers improve the constant of the known landmark embedding by a factor exponential in $n$. Slice by slice, the construction embeds multiparameter modules with boundedly many bars per slice under the matching distance on any finite net of slices, a class that contains the modules with at most $n$ generators. Under the continuous distances, bounding bars or persistent Betti numbers does not suffice: two-parameter modules with one bar on every slice have infinite asymptotic dimension, and neither they nor the modules of bounded support and bounded rank admit a coarse embedding into Hilbert space, under the matching or the interleaving distance.

[10] arXiv:2611.14277 (replaced) [pdf, html, other]
Title: Thales's theorem in higher dimensions
Jan Pavlík
Comments: 23 pages, 6 figures V2: references updated, figures improved for greyscale printing
Subjects: Metric Geometry (math.MG); Combinatorics (math.CO)

In the Euclidean plane, Thales's theorem is equivalent to the statement that a quadrilateral with two opposite right angles has a circumscribed circle. We generalize the latter to higher dimensions: a convex polytope with two distinguished vertices, the \emph{poles}, such that the faces spanned by the two poles are perpendicular, is inscribed in the sphere whose diameter joins its poles. These \emph{orthogonally bipolar} polytopes are exactly the bipolar polytopes of a companion paper that arise as cutouts by orthogonal projections. As an application we show that for a polytope $P$ and a point $B$, the balls with diameters $[V,B]$, $V$ a vertex of $P$, cover $P$, and that the power diagram of their boundary spheres refines this covering to a tiling. Further, we investigate the properties of orthogonally bipolar polytopes, their characterization, and their application to tilings: in dimension three, the cutouts of $P$ by the orthogonal projections of $B$ onto its faces tile $P$ by orthogonally bipolar polytopes exactly when every such projection lies in the relative interior of its face. Finally, we propose an interpretation of the topic in political science.

[11] arXiv:2611.15672 (replaced) [pdf, html, other]
Title: Nagata dimension, separation modulus and stochastic embeddings into trees
Ramón J. Aliaga, Rubén Medina
Comments: 18 pages, 1 figure
Subjects: Metric Geometry (math.MG); Functional Analysis (math.FA)

The separation modulus of a metric space, introduced by Bartal in 1996, is related to different notions of dimensionality. Most generally, Naor and Silberman gave in 2011 an upper bound on the separation modulus in terms of Nagata dimension. We prove that this bound cannot be reversed; that is, there are metric spaces with arbitrarily high Nagata dimension and stochastically embeddable into trees with uniform distortion, which therefore have uniformly bounded separation modulus. Similarly, we construct spaces with arbitrarily high Nagata dimension whose spaces of probability measures endowed with the Earth Mover's Distance (equivalently, their Lipschitz-free spaces) are embeddable into $L_1$ with uniformly bounded distortion. By gluing these spaces together, we obtain infinite Nagata dimensional metric spaces whose separation modulus is finite and whose Lipschitz-free space is isomorphic to $\ell_1$, respectively. Finally, we provide relations between separation modulus and stochastic embeddability into trees, also known as random approximability by tree metrics, in particular for the case of snowflake metrics.

[12] arXiv:2506.11628 (replaced) [pdf, html, other]
Title: Two Tiling is Undecidable
Jack Stade
Comments: 38 pages, 48 figures
Subjects: Computational Geometry (cs.CG); Combinatorics (math.CO); Metric Geometry (math.MG)

We show that the following problem is undecidable: given two polygonal prototiles, determine whether the plane can be tiled with rotated and translated copies of them. This improves a result of Demaine and Langerman [SoCG 2025], who showed undecidability for three tiles.
Along the way, we show that tiling with one prototile is undecidable if there can be edge-to-edge matching rules. This is the first result to show undecidability for monotiling with only local matching constraints.

[13] arXiv:2602.17982 (replaced) [pdf, html, other]
Title: Bestvina metric and tree reduction for $K(π,1)$-conjecture
Jingyin Huang
Comments: 57 pages, 5 figures
Subjects: Group Theory (math.GR); Geometric Topology (math.GT); Metric Geometry (math.MG)

We reduce the $K(\pi,1)$-conjecture for all Artin groups to properties of Artin groups whose Coxeter diagrams are trees, from which we deduce new classes of Artin groups satisfying the $K(\pi,1)$-conjecture. This relies on constructing actions of Artin groups on Bestvina complexes of suitable Garside groupoids.

[14] arXiv:2602.17983 (replaced) [pdf, html, other]
Title: From Trees to Tripods: Proof of $K(π,1)$ for Artin groups with $ABI$-type spherical parabolics
Nima Hoda, Jingyin Huang
Comments: Add new results about contractibility criterion for certain simplicial complexes, and applications to Shephard groups.58 page, 9 figures
Subjects: Group Theory (math.GR); Geometric Topology (math.GT); Metric Geometry (math.MG)

We describe contractibility criteria for typed simplicial complexes modeled on Coxeter diagrams. Such complexes include buildings and also arise as coset complexes of groups with strongly admissible parabolic systems, including Shephard groups, which generalize both Artin and Coxeter groups. Our result applies to a large class of complexes modeled on \emph{tree Coxeter diagrams} and implies deformation retraction onto a nonpositively curved subcomplex.
As an application, we reduce the $K(\pi,1)$-conjecture for all Artin groups with tree Coxeter diagrams to properties of Artin groups with tripod-shaped Coxeter diagrams. Combining this reduction theorem and properties of braid groups in previous works of Charney, Crisp-McCammond, Haettel and the second named author, we deduce that the $K(\pi,1)$-conjecture holds for every Artin group whose spherical parabolic subgroups avoid type $D_n$ ($n \ge 4$) and the exceptional types. We give an analogous tree to tripod reduction for Shephard groups.
Our proof relies on two ingredients of independent interest: a notion of combinatorial convexity and a Bestvina-type inequality in certain injective orthoscheme complexes. These ingredients further rely on the use of structural properties of bi-Helly graphs developed in joint work of the first named author with this http URL bi-Helly graphs (also known as absolute bipartite retracts) developed in joint work of the first named author with Munro.

[15] arXiv:2609.11598 (replaced) [pdf, html, other]
Title: Liouville regular Jordan curves
Tomohiro Asano, Yuichi Ike
Comments: 27 pages, v2:Revised
Subjects: Classical Analysis and ODEs (math.CA); Metric Geometry (math.MG)

We investigate Liouville regular Jordan curves, which were introduced in our previous paper as "Jordan curves that admit continuous Legendrian lifts". We prove that a Jordan curve satisfying certain variation conditions in a neighborhood of each point is Liouville regular. We also prove that the boundary of a Jordan domain is Liouville regular if the images of the radial tails under a conformal mapping have uniformly vanishing length. Together with our previous result, these criteria show that each such Jordan curve admits an inscribed rectangle in every prescribed similarity class.

[16] arXiv:2610.12392 (replaced) [pdf, html, other]
Title: Tiling 3D Space by (Translates of) a Single Polycube is Undecidable
Erik D. Demaine, Stefan Langerman
Comments: 10 pages, 2 figures, 2 tables, 15 snippets. Added rotation/reflection results and corresponding table
Subjects: Computational Geometry (cs.CG); Combinatorics (math.CO); Metric Geometry (math.MG)

We prove co-RE-completeness, and thus undecidability, of the following problem: given a single (connected) polycube, decide whether it tiles 3D Euclidean space by translations. The same result holds if we also allow rotations and/or reflections. We reduce from Wang tiling using the decorated two-prime Sudoku construction of Greenfeld and Tao and a cyclic encoding adapted from OpenAI's 3D aperiodic tile, and apply a reduction of Kim to make the prototile connected (via faces). Dimension three is optimal: translational monotiling is known to be decidable in $\mathbb{Z}^2$ and for a single (possibly disconnected) polyomino in $\mathbb{R}^2$.

[17] arXiv:2610.26523 (replaced) [pdf, html, other]
Title: Counting Lattice Points in Translations: Uniqueness and Existence Results
Ansgar Freyer, Georg C. Hofstätter
Subjects: Combinatorics (math.CO); Metric Geometry (math.MG)

Generalizing a recent theorem by Higashitani et al. (Comb. Theory 2025), it is shown that a convex body $K$ is uniquely described up to integer translation by the function $\mathrm{t}_K(v) = |(K-v)\cap\mathbb{Z}^n|$, $v\in\mathbb{R}^n$. For a lattice polytope $P$ the function $\mathrm{t}_P$ is decomposed into homogeneous components $\mathrm{t}_{P,i}$, similar to the Ehrhart polynomial. It is shown that the functions $\mathrm{t}_{P,i}$ are simultaneous eigenfunctions of a family of linear operators introduced by Kubert and Lang in (Math. Z. 1976) and that, conversely, the linear spaces of piecewise constant eigenfunctions are generated by the respective coefficients $\mathrm{t}_{P,i}$. A structure theorem for the simultaneous eigenspace corresponding to the $(n-1)$st coefficient in the decomposition of $\mathrm{t}_P$ is obtained. This leads to an explicit description of the set of functions $\mathrm{t}_P$, where $P$ ranges over all lattice polygons, as well as to inequalities for the number of lattice points in dilated and translated lattice polytopes.

Total of 17 entries
Showing up to 2000 entries per page: fewer | more | all
We gratefully acknowledge support from our major funders, member institutions, , and all contributors.
About · Help · Contact · Subscribe · Copyright · Privacy · Accessibility · Operational Status (opens in new tab)