English
Related papers

Related papers: Infinite words and universal free actions

200 papers

In this paper we survey recent developments in the theory of groups acting on $\Lambda$-trees. We are trying to unify all significant methods and techniques, both classical and recently developed, in an attempt to present various faces of…

Group Theory · Mathematics 2013-05-07 Olga Kharlampovich , Alexei Myasnikov , Denis Serbin

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

Group Theory · Mathematics 2009-07-21 Olga Kharlampovich , Alexei Miasnikov , Vladimir Remeslennikov , Denis Serbin

A group is called $\Lambda$-free if it has a free Lyndon length function in an ordered abelian group $\Lambda$, which is equivalent to having a free isometric action on a $\Lambda$-tree. A group has a regular free length function in…

Group Theory · Mathematics 2015-03-13 O. Kharlampovich , A. Myasnikov , D. Serbin

We initiate the study of affine actions of groups on $\Lambda$-trees for a general ordered abelian group $\Lambda$; these are actions by dilations rather than isometries. This gives a common generalisation of isometric action on a…

Group Theory · Mathematics 2013-02-13 Shane O Rourke

Let $\Lambda$ be an ordered abelian group, $\mathrm{Aut}^+(\Lambda)$ the group of order-preserving automorphisms of $\Lambda$, $G$ a group and $\alpha:G\to\mathrm{Aut}^+(\Lambda)$ a homomorphism. An $\alpha$-affine action of $G$ on a…

Group Theory · Mathematics 2020-09-01 Shane O Rourke

In the present paper we continue studying regular free group actions on $\mathbb{Z}^n$-trees. We show that every finitely generated $\mathbb{Z}^n$-free group $G$ can be embedded into a finitely generated $\mathbb{Z}^n$-free group $H$ acting…

Group Theory · Mathematics 2021-08-12 Olga Kharlampovich , Alexei Miasnikov , Denis Serbin

We investigate translation length functions for two-generated groups acting by isometries on $\Lambda$-trees, where $\Lambda$ is a totally ordered abelian group. In this context, we provide an explicit formula for the translation length of…

Group Theory · Mathematics 2026-02-25 Kamil Orzechowski

For a finitely generated lawless group $\Gamma$ and $n \in \mathbb{N}$, let $\mathcal{A}_{\Gamma} (n)$ be the minimal positive integer $M_n$ such that for all nontrivial reduced words $w$ of length at most $n$ in the free group of fixed…

Group Theory · Mathematics 2026-04-14 Henry Bradford , Jacob Willis

Let $\Gamma$ be a finitely generated torsion free nilpotent group, and let $A^\omega$ be the space of infinite words over a finite alphabet $A$. We investigate two types of self-similar actions of $\Gamma$ on $A^\omega$, namely the…

Group Theory · Mathematics 2021-01-28 Olivier Mathieu

I. M. Chiswell has asked whether every group that admits a free isometric action (without inversions) on a $\Lambda$-tree is orderable. We give an example of a multiple HNN extension $\Gamma$ which acts freely on a $\mathbb{Z}^2$-tree but…

Group Theory · Mathematics 2012-12-10 Shane O. Rourke

Let $\Lambda_0$ be an ordered abelian group. We show how an $\mathrm{ATF}(\mathbb{Z}\times\Lambda_0)$ group -- that is, a group admitting a free affine action without inversions on a $\mathbb{Z}\times\Lambda_0$-tree -- admits a natural…

Group Theory · Mathematics 2016-03-22 Shane O Rourke

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

Group Theory · Mathematics 2021-02-23 Yanis Amirou

An algebraic $\Gamma$-action is an action of a countable group $\Gamma$ on a compact abelian group $X$ by continuous automorphisms of $X$. We prove that any expansive algebraic action of a finitely generated nilpotent group $\Gamma$ on a…

Dynamical Systems · Mathematics 2017-06-20 Siddhartha Bhattacharya

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

Group Theory · Mathematics 2021-05-26 Pierre Fima , Soyoung Moon , Yves Stalder

A $\Lambda$-tree is a $\Lambda$-metric space satisfying three axioms (1), (2) and (3). We give a characterization of those ordered abelian groups $\Lambda$ for which axioms (1) and (2) imply axiom (3). As a special case, it follows that for…

Group Theory · Mathematics 2024-07-31 Raphael Appenzeller

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

This paper is the first of a sequence of three papers, where the concept of an $\mathbb R$-tree dual to a measured geodesic lamination in a hyperbolic surface is generalized to arbitrary $\mathbb R$-trees provided with a (very small) action…

Group Theory · Mathematics 2014-02-26 Thierry Coulbois , Arnaud Hilion , Martin Lustig

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

Consider a lattice $\Gamma$ in a group $G = SL_2(\R), SO(1,n), SU(1,n)$, $SL_2(\Q_p)$. We discuss actions of $\Gamma$ by affine isometric transformations of Hilbert spaces. We show that for irreducible affine isometric action of $G$ its…

dg-ga · Mathematics 2013-01-15 Yurii A. Neretin

This is Chapter 24 in the "AutoMathA" handbook. Finite automata have been used effectively in recent years to define infinite groups. The two main lines of research have as their most representative objects the class of automatic groups…

Formal Languages and Automata Theory · Computer Science 2015-03-17 Laurent Bartholdi , Pedro V. Silva
‹ Prev 1 2 3 10 Next ›