相关论文: A characterization of those automata that structur…

Using Frobenius normal forms of matrices over finite fields as well as the Burnside Basis Theorem, we give a direct proof of Horo\v{s}evski\u{i}'s result that every automorphism $\alpha$ of a finite nilpotent group has a cycle whose length…

We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…

If G is a semidirect product N by H with N normal and finitely generated then G has the property that every finite group is a quotient of some finite index subgroup of G if and only if one of N and H has this property. This has applications…

This article presents the construction of finitely generated branch groups with uncountably many maximal subgroups using embedding techniques. This addresses a question posed by Grigorchuk.

This paper studies infinite graphs produced from a natural unfolding operation applied to finite graphs. Graphs produced via such operations are of finite degree and automatic over the unary alphabet (that is, they can be described by…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

In this paper we define Ordered Generating System for finite non-abelian groups, which is a generalization of the basis theorem for finite abelian groups. We prove the following: If each composition factor of a group G has Ordered…

We study groups having the property that every non-cyclic subgroup contains its centralizer. The structure of nilpotent and supersolvable groups in this class is described. We also classify finite $p$-groups and finite simple groups with…

The \v{C}ern\'y's conjecture states that for every synchronizing automaton with n states there exists a reset word of length not exceeding (n-11)^2. We prove this conjecture for a class of automata preserving certain properties of intervals…

We prove that for a number of ultrahomogeneous structures $M$, including those with the free amalgamation property, the powers of the automorphism group ${\rm{Aut}}(M)^n$, $n=1,2,\ldots$, and the group $L_0({\rm{ Aut}}(M))$ of measurable…

We prove that the abstract commensurator of a nonabelian free group, an infinite surface group, or more generally of a group that splits appropriately over a cyclic subgroup, is not finitely generated. This applies in particular to all…

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

We generalize the classical Tanaka result on the finiteness of symmetry algebra for non-degenerate pseudo-product structures to the case when the completely-integrable distributions defining the pseudo-product structure are no longer…

Clean markings on surfaces were a key component in Masur and Minsky's hierarchy machinery, which proved to be a powerful tool in the study of mapping class groups. We construct a marking graph for irreducible finite-type Artin groups which…

We define a class of not necessarily linear $C_0$-semigroups $(P_t)_{t\geq0}$ on $C_b(E)$ (more generally, on $C_\kappa(E):=\frac1\kappa C_b(E)$, for some bounded function $\kappa$, which is the pointwise limit of a decreasing sequence of…

We describe the outer automorphism group of a one-ended fundamental group of a graph of groups, when edge groups are cyclic, and vertex groups are torsion-free with cyclic centralizers. We show that in this case the outer automorphism group…

We study a class $\mathfrak{M}$ of cyclically presented groups that includes both finite and infinite groups and is defined by a certain combinatorial condition on the defining relations. This class includes many finite metacyclic…

A self-similar group of finite type is the profinite group of all automorphisms of a regular rooted tree that locally around every vertex act as elements of a given finite group of allowed actions. We provide criteria for determining when a…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

We define a new strict and computable hierarchy for the family of automaton semigroups, which reflects the various asymptotic behaviors of the state-activity growth. This hierarchy extends that given by Sidki for automaton groups, and also…