English
Related papers

Related papers: Diameters of 3-Sphere Quotients

200 papers

We first describe a reduction from the problem of lower-bounding the number of distinct distances determined by a set $S$ of $s$ points in the plane to an incidence problem between points and a certain class of helices (or parabolas) in…

Computational Geometry · Computer Science 2010-05-07 György Elekes , Micha Sharir

The main aim of this paper is to recall the notion of the Gelfand-Tsetlin bases (GT bases for short) and to use it for an explicit construction of orthogonal bases for the spaces of spherical monogenics (i.e., homogeneous solutions of the…

Complex Variables · Mathematics 2010-10-12 S. Bock , K. Guerlebeck , R. Lavicka , V. Soucek

We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have…

Metric Geometry · Mathematics 2007-05-23 Boris D. Lubachevsky , Ronald Graham

Let $G_{m,n,k} = \mathbb{Z}_m \ltimes_k \mathbb{Z}_n$ be the split metacyclic group, where $k$ is a unit modulo $n$. We derive an upper bound for the diameter of $G_{m,n,k}$ using an arithmetic parameter called the \textit{weight}, which…

Combinatorics · Mathematics 2020-03-23 Kashyap Rajeevsarathy , Siddhartha Sarkar

Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case where truly subquadratic-time algorithms were given for simple objects such as unit-disks and…

Computational Geometry · Computer Science 2026-03-24 Timothy M. Chan , Hsien-Chih Chang , Jie Gao , Sándor Kisfaludi-Bak , Hung Le , Da Wei Zheng

We introduce a new flatness index for the boundary of an open subset $\Omega$ of $\mathbb{R}^n$, $n\ge 2$. This index provides a necessary condition for $\partial\Omega$ to be a harmonic pseudosphere and sufficient conditions for a harmonic…

Analysis of PDEs · Mathematics 2026-03-27 Andrea Buffoni , Giovanni Cupini , Ermanno Lanconelli

We improve Larman's bound on the diameter of a polytope by showing that if $\Delta$ is a normal simplicial complex, all of whose missing faces have size at most $r$, then the diameter of the facet-ridge graph of $\Delta$ is not larger than…

Combinatorics · Mathematics 2013-03-28 Isabella Novik

The combinatorial diameter $\operatorname{diam}(P)$ of a polytope $P$ is the maximum shortest path distance between any pair of vertices. In this paper, we provide upper and lower bounds on the combinatorial diameter of a random "spherical"…

Probability · Mathematics 2021-12-28 Gilles Bonnet , Daniel Dadush , Uri Grupel , Sophie Huiberts , Galyna Livshyts

We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under a discrete subgroup of $O(3)$ in several cases. We also characterize the convex bodies with the minimal volume product in each…

Metric Geometry · Mathematics 2020-10-09 Hiroshi Iriyeh , Masataka Shibata

We study the isometry groups of compact spherical orientable $3$-orbifolds $S^3/G$, where $G$ is a finite subgroup of $\mathrm{SO}(4)$, by determining their isomorphism type. Moreover, we prove that the inclusion of $\mbox{Isom}(S^3/G)$…

Geometric Topology · Mathematics 2020-05-26 Mattia Mecchia , Andrea Seppi

In a matter-filled spacetime, perhaps with positive cosmological constant, a stable marginally outer trapped 2-sphere must satisfy a certain area inequality. Namely, as discussed in the paper, its area must be bounded above by $4\pi/c$,…

General Relativity and Quantum Cosmology · Physics 2016-07-12 Gregory J. Galloway , Abraao Mendes

Let $M$ be either the 2-sphere $\SS^2 \subset\RR^3$ or the hyperbolic plane $\HH^2 \subset \RR^3$. If $\Delta(abc)$ is a geodesic triangle on $M$ with corners at $a,b,c\in M$, we denote by $\alpha, \beta, \gamma\in M$ the midpoints of their…

Differential Geometry · Mathematics 2013-07-10 Gijs M. Tuynman

Computations based on explicit 4-periodic resolutions are given for the cohomology of the finite groups G known to act freely on S^3, as well as the cohomology rings of the associated 3-manifolds (spherical space forms) M = S^3/G. Chain…

Algebraic Topology · Mathematics 2009-04-14 Satoshi Tomoda , Peter Zvengrowski

We prove a lower bound for the first eigenvalue of the sub-Laplacian on sub-Riemannian manifolds with transverse symmetries. When the manifold is of H-type, we obtain a corresponding rigidity result: If the optimal lower bound for the first…

Differential Geometry · Mathematics 2014-07-31 Fabrice Baudoin , Bumsik Kim

We investigate isoperimetric inequalities for Lipschitz 2-spheres in CAT(0) spaces, proving bounds on the volume of efficient null-homotopies. In one dimension lower, it is known that a quadratic inequality with a constant smaller than…

Metric Geometry · Mathematics 2025-02-06 Cornelia Druţu , Urs Lang , Panos Papasoglu , Stephan Stadler

Let $(M,g)$ be an $n$-dimensional asymptotically flat Riemannian manifold with nonnegative scalar curvature that admits a noncompact area-minimizing hypersurface $\Sigma \subset M$. In the case where $n = 3$, O. Chodosh and the first-named…

Differential Geometry · Mathematics 2025-06-12 Michael Eichmair , Thomas Koerber

In this paper, we associate a growth graph and a length operator to a quotient space of a semisimple compact Lie group. Under certain assumptions, we show that the spectral dimension of a homogeneous space is greater than or equal to…

Operator Algebras · Mathematics 2018-03-28 Bipul Saurabh

Let G be a finite group with a generating set A. By the (symmetric) diameter of G with respect to A we mean the maximum over g in G of the length of the shortest word in (A union A inverse)A expressing g.By the (symmetric) diameter of G we…

Group Theory · Mathematics 2022-11-17 Azizollah Azad , Nasim Karimi

Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…

Computational Complexity · Computer Science 2019-11-19 Chris Jones , Matt McPartlon

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Combinatorics · Mathematics 2022-09-16 Hariharan Narayanan , Rikhav Shah , Nikhil Srivastava