English
Related papers

Related papers: Period-rigidity of one-relator groups

200 papers

A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point…

Group Theory · Mathematics 2015-08-18 David Bruce Cohen

We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…

Dynamical Systems · Mathematics 2023-07-21 Sebastián Barbieri

We show that Cayley graphs of finitely generated Abelian groups are rather rigid. As a consequence we obtain that two finitely generated Abelian groups admit isomorphic Cayley graphs if and only if they have the same rank and their torsion…

Group Theory · Mathematics 2012-08-20 Clara Loeh

Let $A$ be a finite set and $G$ a group. A closed subset $X$ of $A^G$ is called a subshift if the action of $G$ on $A^G$ preserves $X$. If $K$ is a closed subset of $A^G$ such that membership in $K$ is determined by looking at a fixed…

Group Theory · Mathematics 2018-02-05 David Bruce Cohen

We prove the dichotomy that every Coxeter group either has a strongly solid group von Neumann algebra or contains the product of an infinite cyclic group and a free group of rank 2. This generalizes the same dichotomy for right-angled…

Operator Algebras · Mathematics 2025-12-02 Martín Blufstein , Katherine Goldman , Koichi Oyakawa

A constant spinal group is a subgroup of the automorphism group of a regular rooted tree, generated by a group of rooted automorphisms $A$ and a group of directed automorphisms $B$ whose action on a subtree is equal to the global action. We…

Group Theory · Mathematics 2021-12-24 Jan Moritz Petschick

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

A bar-joint framework $(G,p)$ is the combination of a finite simple graph $G=(V,E)$ and a placement $p:V\rightarrow \mathbb{R}^d$. The framework is rigid if the only edge-length preserving continuous deformations of the vertices arise from…

Combinatorics · Mathematics 2023-12-18 Anthony Nixon , Bernd Schulze , Joseph Wall

It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

A practical approach is proposed to construct short presentations for Euclidean crystallographic groups in terms of generators and relations. For our purposes a short presentation is the one with a small number of short relators for a given…

Group Theory · Mathematics 2025-08-27 Igor A. Baburin

We study $2$-dimensional Artin groups of hyperbolic type from the viewpoint of measure equivalence, and establish rigidity theorems. We first prove that they are boundary amenable. So is every group acting discretely by simplicial…

Group Theory · Mathematics 2021-10-11 Camille Horbez , Jingyin Huang

Given a group G, we consider its classifying space for the family of virtually cyclic subgroups. We show for many groups, including for example, one-relator groups, acylindrically hyperbolic groups, 3-manifold groups and CAT(0) cube groups,…

Group Theory · Mathematics 2019-04-09 Timm von Puttkamer , Xiaolei Wu

A relative one-relator presentation has the form P = < X,H ; R > where X is a set, H is a group, and R is a group word on X and H. We show that if the group word on X obtained from R by deleting all the terms from H has what we call the…

Group Theory · Mathematics 2007-06-25 Stephen J Pride

The concept of matrix rigidity was first introduced by Valiant in 1977. Roughly speaking, a matrix is rigid if its rank cannot be reduced significantly by changing a small number of entries. There has been extensive interest in rigid…

Combinatorics · Mathematics 2021-01-06 Zeev Dvir , Allen Liu

We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…

Formal Languages and Automata Theory · Computer Science 2014-02-27 Francesca Fiorenzi

We show that every finitely-generated non-amenable linear group over a field of characteristic zero admits an ergodic action which is rigid in the sense of Popa. If this group has trivial solvable radical, we prove that these actions can be…

Dynamical Systems · Mathematics 2016-06-21 Mohamed Bouljihad

We develop a rigidity theory for frameworks in $\mathbb{R}^3$ which have two coincident points but are otherwise generic and only infinitesimal motions which are tangential to a family of cylinders induced by the realisation are considered.…

Combinatorics · Mathematics 2016-07-08 Bill Jackson , Viktoria Kaszanitzky , Anthony Nixon

We show that the group $\langle a,b,c,t : a^t=b,b^t=c,c^t=ca^{-1} \rangle$ is profinitely rigid amongst free-by-cyclic groups, providing the first example of a hyperbolic free-by-cyclic group with this property.

Group Theory · Mathematics 2025-08-06 Naomi Andrew , Paige Hillen , Robert Alonzo Lyman , Catherine Eva Pfaff

We prove that the subgroup graph of a finite group $G$ is regular if and only if $G$ is cyclic with square-free order.

Group Theory · Mathematics 2025-04-17 Andrea Lucchini

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