English
Related papers

Related papers: Period-rigidity of one-relator groups

200 papers

A finitely generated group is lacunary hyperbolic if one of its asymptotic cones is an $\mathbb{R}$-tree. In this article we give a necessary and sufficient condition on lacunary hyperbolic groups in order to be stable under free product by…

Group Theory · Mathematics 2020-02-21 Krishnendu Khan

We obtain a bi-Lipschitz rigidity theorem for a Zariski dense discrete subgroup of a connected simple real algebraic group. As an application, we show that any Zariski dense discrete subgroup of a higher rank semisimple algebraic group $G$…

Group Theory · Mathematics 2024-05-14 Richard Canary , Hee Oh , Andrew Zimmer

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

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…

Logic · Mathematics 2019-12-19 Tapani Hyttinen , Gianluca Paolini

We prove that an infinite-ended group whose one-ended factors have finite-index subgroups and are in a family of groups with a nonzero multiplicative invariant is not quasi-isometrically rigid. Combining this result with work of the first…

Group Theory · Mathematics 2023-10-06 Nir Lazarovich , Emily Stark

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

Group Theory · Mathematics 2026-05-14 Joseph Paul MacManus

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár

We show that the virtual second Betti number of a finitely generated, residually free group $G$ is finite if and only if $G$ is either free, free abelian or the fundamental group of a closed surface. We also prove a similar statement in…

Group Theory · Mathematics 2024-05-22 Jonathan Fruchter , Ismael Morales

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

Logic · Mathematics 2026-05-15 Wojciech Aleksander Wołoszyn

For every graph that is mimimally rigid in the plane, its Galois group is defined as the Galois group generated by the coordinates of its planar realizations, assuming that the edge lengths are transcendental and algebraically independent.…

Combinatorics · Mathematics 2024-01-17 Mehdi Makhul , Josef Schicho , Audie Warren

A graph is \textit{rigid} if it only admits the identity endomorphism. We show that for every $d\ge 3$ there exist infinitely many mutually rigid $d$-regular graphs of arbitrary odd girth $g\geq 7$. Moreover, we determine the minimum order…

Combinatorics · Mathematics 2025-02-18 Kolja Knauer , Gil Puig i Surroca

The focus of this paper is to better understand the coexistence of rigidity, weak mixing, and recurrence by constructing thin sets in the product of countably many copies of the finite cyclic group of order q. A Kronecker-type set K is a…

Dynamical Systems · Mathematics 2024-07-02 Cash Cherry

Every finite simple group can be generated by two elements, and in 2000, Guralnick and Kantor resolved a 1962 question of Steinberg by proving that in a finite simple group every nontrivial element belongs to a generating pair. Groups with…

Group Theory · Mathematics 2020-07-20 Scott Harper

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

Group Theory · Mathematics 2010-04-09 Yehuda Shalom , Terence Tao

We show that (with one possible exception) there exist strongly dense free subgroups in any semisimple algebraic group over a large enough field. These are nonabelian free subgroups all of whose subgroups are either cyclic or Zariski dense.…

Group Theory · Mathematics 2011-03-28 Emmanuel Breuillard , Ben Green , Robert Guralnick , Terence Tao

We give strongly aperiodic subshifts of finite type on every hyperbolic surface group; more generally, for each pair of expansive primitive symbolic substitution systems with incommensurate growth rates, we construct strongly aperiodic…

Group Theory · Mathematics 2015-10-23 David Bruce Cohen , Chaim Goodman-Strauss

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…

Geometric Topology · Mathematics 2011-01-04 Louis Funar , Daniele Ettore Otera

We show that certain representations over fields with positive characteristic of groups having CAT(0) fixed point property ${\rm F}\mathcal{B}_{\widetilde{A}_n}$ have finite image. In particular, we obtain rigidity results for…

Group Theory · Mathematics 2018-04-23 Olga Varghese

Thurston's ending lamination conjecture proposes that a finitely generated Kleinian group is uniquely determined (up to isometry) by the topology of its quotient and a list of invariants that describe the asymptotic geometry of its ends. We…

Geometric Topology · Mathematics 2007-05-23 Yair N. Minsky

We study a modified notion of Ollivier's coarse Ricci curvature on graphs introduced by Lin, Lu, and Yau in [11]. We establish a rigidity theorem for complete graphs that shows a connected finite simple graph is complete if and only if the…

Combinatorics · Mathematics 2020-11-25 Vincent Bonini , Conor Carroll , Uyen Dinh , Sydney Dye , Joshua Frederick , Erin Pearse