Related papers: Freeness of automata groups vs boundary dynamics
We prove that the additive group of the rationals does not have an automatic presentation. The proof also applies to certain other abelian groups, for example, torsion-free groups that are $p$-divisible for infinitely many primes $p$, or…
Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…
We make a connection between the subgroup membership and identity problems for matrix groups and extended finite automata. We provide an alternative proof for the decidability of the subgroup membership problem for $ 2 \times 2 $ integer…
In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…
We algebraically characterize free by cyclic groups that have coarse medians, and prove that this is equivalent to the a priori stronger properties of being colourable hierarchically hyperbolic groups and being quasi-isometric to CAT(0)…
Automatic groups admitting prefix closed automatic structures with uniqueness are characterized as the quotients of free groups by normal subgroups possessing sets of free generators satisfying certain language-theoretic conditions.
We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…
We study finite-state transducers and their power for transforming infinite words. Infinite sequences of symbols are of paramount importance in a wide range of fields, from formal languages to pure mathematics and physics. While finite…
Let $G=A \ast B$ be a free product of freely indecomposable groups. We explicitly construct quasimorphisms on $G$ which are invariant with respect to all automorphisms of $G$. We also prove that the space of such quasimorphisms is…
In this paper we seek geometric and invariant-theoretic characterizations of (Schur-)representation finite algebras. To this end, we introduce two classes of finite-dimensional algebras: those with the dense-orbit property and those with…
We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…
We prove that if a subgroup $H$ of the automorphism group $\mathrm{Aut}(\Sigma^{\mathbb{Z}})$ of a non-trivial full shift acts on points of finite support with a free orbit, then for every finitely-generated abelian group $A$, the abstract…
Given a group $G$ and a subset $X \subset G$, an element $g \in G$ is called quasi-positive if it is equal to a product of conjugates of elements in the semigroup generated by $X$. This notion is important in the context of braid groups,…
We prove new separability results about free groups. Namely, if $H_1, \ldots , H_k$ are infinite index, finitely generated subgroups of a non-abelian free group $F$, then there exists a homomorphism onto some alternating group $f:F…
A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…
We show that if a group $G$ acting faithfully on a rooted tree $T$ has a free subgroup, then either there exists a point $w$ of the boundary $\partial T$ and a free subgroup of $G$ with trivial stabilizer of $w$, or there exists…
The goal of this paper is to accurately describe the maximal zero-free region of the independence polynomial for graphs of bounded degree, for large degree bounds. In previous work with de Boer, Guerini and Regts it was demonstrated that…
Several abstract machines that operate on symbolic input alphabets have been proposed in the last decade, for example, symbolic automata or lattice automata. Applications of these types of automata include software security analysis and…
This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…
In a previous paper [1] [MR4101040], we initiated a systematic study of semihypergroups and had a thorough discussion about some important analytic and algebraic objects associated to this class of objects. In this paper, we investigate…