English
Related papers

Related papers: Global Rigidity of Triangulated Manifolds

200 papers

Let $M$ be a locally symmetric irreducible closed manifold of dimension $\ge 3$. A result of Borel [Bo] combined with Mostow rigidity imply that there exists a finite group $G = G(M)$ such that any finite subgroup of $\text{Homeo}^+(M)$ is…

Group Theory · Mathematics 2016-01-05 Sylvain Cappell , Alexander Lubotzky , Shmuel Weinberger

We show that fundamental groups of compact, orientable, irreducible 3-manifolds with toroidal boundary are Grothendieck rigid.

Geometric Topology · Mathematics 2017-10-23 Michel Boileau , Stefan Friedl

We prove a local splitting theorem for three-manifolds with mean convex boundary and scalar curvature bounded from below that contain certain locally area-minimizing free boundary surfaces. Our methods are based on those of Micallef and…

Differential Geometry · Mathematics 2013-09-04 Lucas C. Ambrozio

A framework is a graph and a map from its vertices to E^d (for some d). A framework is universally rigid if any framework in any dimension with the same graph and edge lengths is a Euclidean image of it. We show that a generic universally…

Metric Geometry · Mathematics 2014-06-17 Steven J. Gortler , Dylan P. Thurston

The Golodness of a simplicial complex is defined algebraically in terms of the Stanley-Reisner ring, and it has been a long-standing problem to find its combinatorial characterization. The tightness of a simplicial complex is a…

Algebraic Topology · Mathematics 2023-09-06 Kouyemon Iriye , Daisuke Kishimoto

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

Geometric Topology · Mathematics 2007-05-23 Marc Lackenby

The fundamental group of a closed irreducible 3-dimensional manifold has the Rapid Decay property if and only if it is not virtually Sol. This is proved by studying distortion of length functions in graphs of groups, and the stability of…

Group Theory · Mathematics 2024-06-11 Indira Chatterji , François Gautero

We prove that the linear matroid that defines generic rigidity of $d$-dimensional body-rod-bar frameworks (i.e., structures consisting of disjoint bodies and rods mutually linked by bars) can be obtained from the union of ${d+1 \choose 2}$…

Combinatorics · Mathematics 2012-04-26 Shin-ichi Tanigawa

We study the bar-and-joint frameworks in $\mathbb{R}^2$ such that some vertices are constrained to lie on some lines. The generic rigidity of such frameworks is characterised by Streinu and Theran (2010). Katoh and Tanigawa (2013) remarked…

Combinatorics · Mathematics 2022-12-09 Hakan Guler

In 1992, Hendrickson proved that (d+1)-connectivity and redundant rigidity are necessary conditions for a generic (non-complete) bar-joint framework to be globally rigid in $\mathbb{R}^d$. Jackson and Jordan confirmed in 2005 that these…

Combinatorics · Mathematics 2019-09-17 Viktoria E. Kaszanitzky , Bernd Schulze , Shin-ichi Tanigawa

We obtain a generic regularity result for stationary integral $n$-varifolds with only strongly isolated singularities inside $N$-dimensional Riemannian manifolds, in absence of any restriction on the dimension ($n\geq 2$) and codimension.…

Differential Geometry · Mathematics 2025-03-03 Alessandro Carlotto , Yangyang Li , Zhihan Wang

In this paper we consider the class of graphs which are redundantly $d$-rigid and $(d+1)$-connected but not globally $d$-rigid, where $d$ is the dimension. This class arises from counterexamples to a conjecture by Bruce Hendrickson. It…

Combinatorics · Mathematics 2023-07-13 Georg Grasegger

In this paper, we prove that every real analytic totally nondegenerate model CR manifold of length >= 3 has rigidity. This result was actually conjectured before by Valerii Beloshapka as the so-called "maximum conjecture". It follows that…

Differential Geometry · Mathematics 2017-02-28 Masoud Sabzevari , Amir Hashemi

For $d \geq 2$, Walkup's class ${\cal K}(d)$ consists of the $d$-dimensional simplicial complexes all whose vertex-links are stacked $(d-1)$-spheres. Kalai showed that for $d \geq 4$, all connected members of ${\cal K}(d)$ are obtained from…

Geometric Topology · Mathematics 2015-03-13 Bhaskar Bagchi , Basudeb Datta

Over the past half century, the rigidity of graphs in $R^2$ has aroused a great deal of interest. Lov\'{a}sz and Yemini (1982) proved that every $6$-connected graph is rigid in $R^2$. Jackson and Jord\'{a}n (2005) provided a similar…

Combinatorics · Mathematics 2022-05-27 Dandan Fan , Xueyi Huang , Huiqiu Lin

A tensegrity is a structure made from cables, struts and stiff bars. A $d$-dimensional tensegirty is universally rigid if it is rigid in any dimension $d'$ with $d'\geq d$. The celebrated super stability condition due to Connelly gives a…

Optimization and Control · Mathematics 2020-05-01 Ryoshun Oba , Shin-ichi Tanigawa

In 1980 Lov\'{a}sz introduced the concept of a double circuit in a matroid. The 2nd, 3rd and 4th authors recently generalised this notion to $k$-fold circuits (for any natural number $k$) and proved foundational results about these $k$-fold…

Combinatorics · Mathematics 2025-08-27 John Hewetson , Bill Jackson , Anthony Nixon , Ben Smith

The algebraic connectivity of a graph $G$ in a finite dimensional real normed linear space $X$ is a geometric counterpart to the Fiedler number of the graph and can be regarded as a measure of the rigidity of the graph in $X$. We analyse…

Combinatorics · Mathematics 2025-08-04 James Cruickshank , Sean Dewar , Derek Kitson

The notions Golodness and tightness for simplicial complexes come from algebra and geometry, respectively. We prove these two notions are equivalent for 3-manifold triangulations, through a topological characterization of a polyhedral…

Combinatorics · Mathematics 2023-08-02 Kouyemon Iriye , Daisuke Kishimoto

A graph is said to be globally rigid in $d$-dimensional space if almost all of its embeddings are unique up to isometries. If a graph has enough automorphisms to send any of its vertices into any other, then it is called vertex-transitive.…

Combinatorics · Mathematics 2026-01-19 Angelo El Saliby
‹ Prev 1 3 4 5 6 7 10 Next ›