English
Related papers

Related papers: Dynamics and Obstructions for Self-Similar Groups …

200 papers

Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…

Group Theory · Mathematics 2024-08-28 Dominik Francoeur , Alejandra Garrido

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…

Group Theory · Mathematics 2025-05-29 Charles Garnet Cox , Anitha Thillaisundaram

We give a geometric description of the Poisson boundaries of certain extensions of free and hyperbolic groups. In particular, we get a full description of the Poisson boundaries of free-by-cyclic groups. We rely upon the description of…

Probability · Mathematics 2011-01-10 François Gautero , Frédéric Mathéus

The transitivity degree of a group $G$ is the supremum of all integers $k$ such that $G$ admits a faithful $k$-transitive action. Few obstructions are known to impose an upper bound on the transitivity degree for infinite groups. The…

Group Theory · Mathematics 2022-03-09 Adrien Le Boudec , Nicolás Matte Bon

By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…

Group Theory · Mathematics 2025-08-11 Lucy Koch-Hyde , Siobhan O'Connor , Eamonn Olive , Vladimir Shpilrain

We extend results on transitive self-similar abelian subgroups of the group of automorphisms $\mathcal{A}_m$ of an $m$-ary tree $\mathcal{T}_m$ in \cite{BS}, to the general case where the permutation group induced on the first level of the…

Group Theory · Mathematics 2021-10-07 Alex C. Dantas , Tulio M. G. Santos , Said N. Sidki

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

Dynamical Systems · Mathematics 2014-03-04 Van Cyr , Bryna Kra

Given a countable group $G$, we develop a method to construct an overgroup $H$ that is finitely generated, highly transitive and mixed identity free. Our construction can be controlled to ensure that some fundamental group theoretic…

Group Theory · Mathematics 2025-09-15 James Hyde , Yash Lodha

We show that, if $H$ is a random subgroup of a finitely generated free group $F_k$, only inner automorphisms of $F_k$ may leave $H$ invariant. A similar result holds for random subgroups of toral relatively hyperbolic groups, more generally…

Group Theory · Mathematics 2019-06-26 Vincent Guirardel , Gilbert Levitt

We show that if $G$ is a non-archimedean, Roelcke precompact, Polish group, then $G$ has Kazhdan's property (T). Moreover, if $G$ has a smallest open subgroup of finite index, then $G$ has a finite Kazhdan set. Examples of such $G$ include…

Group Theory · Mathematics 2015-09-03 David M. Evans , Todor Tsankov

The aim of this paper is to investigate whether the class of automaton semigroups is closed under certain semigroup constructions. We prove that the free product of two automaton semigroups that contain left identities is again an automaton…

Group Theory · Mathematics 2015-10-09 Tara Brough , Alan J. Cain

It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its…

Group Theory · Mathematics 2010-12-10 Zoran Sunic

We investigate the orbits of automaton semigroups and groups to obtain algorithmic and structural results, both for general automata but also for some special subclasses. First, we show that a more general version of the finiteness problem…

Formal Languages and Automata Theory · Computer Science 2020-07-21 Daniele D'Angeli , Dominik Francoeur , Emanuele Rodaro , Jan Philipp Wächter

We start by studying the distribution of (cyclically reduced) elements of the free groups with respect to their abelianization. We derive an explicit generating function, and a limiting distribution, by means of certain results (of…

Combinatorics · Mathematics 2007-05-23 Igor Rivin

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

Dynamical Systems · Mathematics 2020-01-28 Yair Hartman , Bryna Kra , Scott Schmieding

Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…

Group Theory · Mathematics 2020-09-22 Igor Dolinka

We generalize the classical definition of effectively closed subshift to finitely generated groups. We study classical stability properties of this class and then extend this notion by allowing the usage of an oracle to the word problem of…

Group Theory · Mathematics 2019-04-26 Nathalie Aubrun , Sebastián Barbieri , Mathieu Sablik

We investigate accessible subgroups of a profinite group $G$, i.e. subgroups $H$ appearing as vertex groups in a graph of profinite groups decomposition of $G$ with finite edge groups. We prove that any accessible subgroup $H \leq G$ arises…

Group Theory · Mathematics 2024-10-23 Julian Wykowski

To any free group automorphism, we associate a real pretree with several nice properties. First, it has a rigid/non-nesting action of the free group with trivial arc stabilizers. Secondly, there is an expanding pretree-automorphism of the…

Group Theory · Mathematics 2024-05-29 Jean Pierre Mutanguha

We prove that an arbitrary compact metrizable group can be realized as the automorphism group of a graphing; this is a continuous analogue to Frucht's theorem recovering arbitrary finite groups are automorphism groups of finite graphs. The…

Group Theory · Mathematics 2022-06-27 Alexandru Chirvasitu