Related papers: On (bi)reversible automata generating lamplighter …
For each group G which decomposes into a finitary direct product of free groups of finite rank we construct a regular band B such that the free idempotent generated semigroup over B contains a maximal subgroup isomorphic to G. In…
We present a new algorithm to construct a deterministic Rabin automaton for an LTL formula $\varphi$. The automaton is the product of a master automaton and an array of slave automata, one for each $G$-subformula of $\varphi$. The slave…
It is shown that any finite group $A$ is realizable as the automizer in a finite perfect group $G$ of an abelian subgroup whose conjugates generate $G$. The construction uses techniques from fusion systems on arbitrary finite groups, most…
We prove that a wreath product of an abelian group and a non-amenable group is not strongly Ulam stable. Previously this was known for groups containing free subgroups, due to work of Burger, Ozawa and Thom, and for some surface groups, due…
In this article, we completely characterize the asymptotic behavior of conjugacy separability for the lamplighter groups. More generally, we give exponential upper and lower bounds for all wreath products of finitely generated abelian…
A condition characterizing the class of regular languages which have several nonisomorphic minimal reversible automata is presented. The condition concerns the structure of the minimum automaton accepting the language under consideration.…
In this article we gave the notion of particular type of functions on a group termed as class assigned functions . Using class assigned functions, we have constructed several right gyrogroup structures on a given non-abelian group.
We consider the question of when a random walk on a finite abelian group with a given step distribution can be used to reconstruct a binary labeling of the elements of the group, up to a shift. Matzinger and Lember (2006) give a sufficient…
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…
The Clifford group associated with a finite abelian group gives rise to a natural extension by the corresponding symplectic group. We prove that this extension splits as a semidirect product if and only if the group order is not divisible…
If X is a CW complex, one can assign to each point of X an ordered abelian group of finite rank whose subset of positive elements depends continuously on the points of X. A locally trivial bundle which arises in this way we denote by E(X).…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
In this paper we begin the systematic study of group equations with abelian predicates in the main classes of groups where solving equations is possible. We extend the line of work on word equations with length constraints, and more…
We will show that every element of a finitely generated abelian group is automorphically equivalent what we will define to be a {\em representative element} in a {\em repeat-free subgroup}, and for finite abelian groups we can count the…
For every finitely generated free group we construct an explicit left order extending the lexicographic order on the free monoid generated by the positive letters. The order is defined by a left, free action on the orbit of 0 of a free…
In this paper, we study the word problem for automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups,…
A quasi-automatic semigroup is a finitely generated semigroup with a rational set of representatives such that the graph of right multiplication by any generator is a rational relation. A asynchronously automatic semigroup is a…
We present sufficient conditions for the triviality of the automorphism group of regular Toeplitz subshifts and give a broad class of examples from the class of $\mathcal{B}$-free subshifts satisfying them, extending [10]. On the other hand…
Given a one-sided subshift $X$ on a finite alphabet, we consider the semigroup $S_X =L_X \cup \{0\}$, where $L_X $ is the language of $X $, equipped with the multiplication operation given by concatenation, when allowed, and set to vanish…
Let $G$ be a group and $\varphi \in \Aut(G)$. Then the set $G$ equipped with the binary operation $a*b=\varphi(ab^{-1})b$ gives a quandle structure on $G$, denoted by $\Alex(G, \varphi)$ and called the generalised Alexander quandle. When…