Related papers: Automatic Quotients of Free Groups
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of…
It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a…
A group $G$ is said to have restricted centralizers if for each $g$ in $G$ the centralizer $C_G(g)$ either is finite or has finite index in $G$. Shalev showed that a profinite group with restricted centralizers is virtually abelian. Given a…
Usually the generators of a quantum group are assumed to be commutative with the noncommuting coordinates of a quantum plane. We have relaxed the assumption and investigated its consequences. Not only does a two-parameter quantum group…
This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…
We study automatic sequences and automatic systems generated by general constant length (nonprimitive) substitutions. While an automatic system is typically uncountable, the set of automatic sequences is countable, implying that most…
In this paper we develop little further the theory of quantum finite automata (QFA). There are already few properties of QFA known, that deterministic and probabilistic finite automata do not have e.g. they cannot recognize all regular…
We define the notion of a (linearly reductive) center for a linearly reductive quantum group, and show that the quotient of a such a quantum group by its center is simple whenever its fusion semiring is free in the sense of Banica and…
We study the stabilized automorphism group of a subshift of finite type with a certain gluing property called the eventual filling property, on a residually finite group $G$. We show that the stabilized automorphism group is simply…
We define an integer-valued invariant of special cube complexes called the genus, and prove that having genus one characterizes special cube complexes with abelian fundamental group. Using the genus, we obtain a new proof that the…
A number of properties of spherical Artin groups extend to Garside groups, defined as the groups of fractions of monoids where least common multiples exist, there is no nontrivial unit, and some additional finiteness conditions are…
We study the group of type-preserving automorphisms of a right-angled building, in particular when the building is locally finite. Our aim is to characterize the proper open subgroups as the finite index closed subgroups of the stabilizers…
We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.
In this paper, we study algorithmic problems for automaton semigroups and automaton groups related to freeness and finiteness. In the course of this study, we also exhibit some connections between the algebraic structure of automaton…
We prove that a freer quantum group has smaller moments of the self-adjoint main character in the category of finitely generated discrete quantum groups. As a result, the moments are minimized precisely by the unitary free quantum groups…
This paper is devoted to the study of a natural group topology on the fundamental group which remembers local properties of spaces forgotten by covering space theory and weak homotopy type. It is known that viewing the fundamental group as…
An automorphism of a group is said to be normal if it preserves each normal subgroup. In this paper, we determine the normal automorphisms of a free metabelian nilpotent group.
We introduce the notion of multipass automata as a generalization of pushdown automata and study the classes of languages accepted by such machines. The class of languages accepted by deterministic multipass automata is exactly the Boolean…
We establish new characterizations of primitive elements and free factors in free groups, which are based on the distributions they induce on finite groups. For every finite group $G$, a word $w$ in the free group on $k$ generators induces…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…