English
Related papers

Related papers: Homological methods in rigidity theory using graph…

200 papers

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Group Theory · Mathematics 2015-06-11 Montserrat Casals-Ruiz

A natural problem in combinatorial rigidity theory concerns the determination of the rigidity or flexibility of bar-joint frameworks in $\mathbb{R}^d$ that admit some non-trivial symmetry. When $d=2$ there is a large literature on this…

Combinatorics · Mathematics 2025-09-30 Sean Dewar , Georg Grasegger , Eleftherios Kastis , Anthony Nixon

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

Group Theory · Mathematics 2024-12-17 Murray Elder , Giles Gardam , Adam Piggott , Davide Spriano , Kane Townsend

We relate homological properties of a binomial edge ideal $\mathcal{J}_G$ to invariants that measure the connectivity of a simple graph $G$. Specifically, we show if $R/\mathcal{J}_G$ is a Cohen-Macaulay ring, then graph toughness of $G$ is…

Commutative Algebra · Mathematics 2016-05-03 Arindam Banerjee , Luis Núñez-Betancourt

We study the large scale geometry of mapping class groups MCG(S), using hyperbolicity properties of curve complexes. We show that any self quasi-isometry of MCG(S) (outside a few sporadic cases) is a bounded distance away from a…

Geometric Topology · Mathematics 2010-04-12 Jason Behrstock , Bruce Kleiner , Yair Minsky , Lee Mosher

PhD thesis concerning cohomological finiteness conditions of infinite discrete groups. Much of the material in this thesis has also appeared in arXiv:1311.7629, arXiv:1310.6262, arXiv:1311.6156, and arXiv:1207.1597.

Group Theory · Mathematics 2014-10-17 Simon St John-Green

Given a finitely generated group $G$ that is relatively finitely presented with respect to a collection of peripheral subgroups, we prove that every infinite subgroup $H$ of $G$ that is bounded in the relative Cayley graph of $G$ is…

Group Theory · Mathematics 2024-07-10 Eduard Schesler

Gromov asked if the bi-invariant metrics on a compact Lie group are extremal compared to any other metrics. In this note, we prove that the bi-invariant metrics on a compact connected semi-simple Lie group $G$ are extremal (in fact rigid)…

Differential Geometry · Mathematics 2020-07-28 Yukai Sun , Xianzhe Dai

Let G be a group acting geometrically on a CAT(0) cube complex X. We prove first that G is hyperbolic relative to the collection P of subgroups if and only if the simplicial boundary of X is the disjoint union of a nonempty discrete set,…

Group Theory · Mathematics 2016-06-15 Jason Behrstock , Mark F. Hagen

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

Logic in Computer Science · Computer Science 2025-06-26 Georg Schindling

We establish rigidity theorems for graph product von Neumann algebras $M_\Gamma=*_{v,\Gamma}M_v$ associated to finite simple graphs $\Gamma$ and families of tracial von Neumann algebras $(M_v)_{v\in\Gamma}$. We consider the following three…

Operator Algebras · Mathematics 2025-09-09 Camille Horbez , Adrian Ioana

We show that if the joints of a bar and joint framework $(G,p)$ are positioned as `generically' as possible subject to given symmetry constraints and $(G,p)$ possesses a `fully-symmetric' infinitesimal flex (i.e., the velocity vectors of…

Metric Geometry · Mathematics 2009-11-13 Bernd Schulze

We exhibit an analogy between the problem of pushing forward measurable sets under measure preserving maps and linear relaxations in combinatorialoptimization. We show how invariance of hyperfiniteness of graphings under local isomorphism…

Combinatorics · Mathematics 2021-02-17 László Lovász

We study skew-product dynamics for a large class of finitely-generated semi--hyperbolic semigroups of rational maps acting on the Riemann sphere, which generalizes both the theory of iteration of a single rational map of a single complex…

Dynamical Systems · Mathematics 2022-09-27 Jason Atnip , Hiroki Sumi , Mariusz Urbański

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

Group Theory · Mathematics 2022-07-18 Édouard Bonnet , Colin Geniet , Romain Tessera , Stéphan Thomassé

We completely classify the locally finite, infinite graphs with pure mapping class groups admitting a coarsely bounded generating set. We also study algebraic properties of the pure mapping class group: We establish a semidirect product…

Group Theory · Mathematics 2025-08-06 George Domat , Hannah Hoganson , Sanghoon Kwak

This thesis develops the theory of sheaves and cosheaves with an eye towards applications in science and engineering. To provide a theory that is computable, we focus on a combinatorial version of sheaves and cosheaves called cellular…

Algebraic Topology · Mathematics 2014-12-18 Justin Curry

In this article we prove that the set of torsion-free groups acting by isometries on a hyperbolic metric space whose entropy is bounded above and with a compact quotient is finite. The number of such groups can be estimated in terms of the…

Group Theory · Mathematics 2021-11-09 Gérard Besson , Gilles Courtois , Sylvestre Gallot , Andrea Sambusetti

We prove that the cohomology groups of an etale Q_p-local system on a smooth proper rigid analytic space are finite-dimensional Q_p-vector spaces, provided that the base field is either a finite extension of Q_p or an algebraically closed…

Number Theory · Mathematics 2016-11-22 Kiran S. Kedlaya , Ruochuan Liu

We prove that a graph has an infinitesimally rigid placement in a non-Euclidean normed plane if and only if it contains a $(2,2)$-tight spanning subgraph. The method uses an inductive construction based on generalised Henneberg moves and…

Metric Geometry · Mathematics 2024-01-18 Sean Dewar