The characterization by automata of certain profinite groups.

DOI10.1016/J.JPAA.2014.06.016MaRDI QIDQ2254320zbMATH OpenOpenAlexFDO

Authors Adam Woryna

Publication date 4 February 2015

Published in Journal of Pure and Applied Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpaa.2014.06.016

zbMATH Keywords

automata groupsiterated permutational wreath productsprofinite groups

Mathematics Subject Classification ID

Infinite automorphism groups (20B27) Groups acting on trees (20E08) Limits, profinite groups (20E18) Extensions, wreath products, and other compositions of groups (20E22) Formal languages and automata (68Q45)

Review text

Given a sequence \((G_i,X_i)_{i\in\mathbb N}\) of permutation groups, one can consider the profinite group \(W_\infty\) obtained as inverse limit \(\varprojlim W_i\) of the iterated wreath product \(W_i\) of the first \(i\) groups: this is called the infinitely iterated permutational wreath product of the sequence \((G_i,X_i)_{i\in\mathbb N}\). The present paper makes an attempt to define and study the groups \(W_\infty\) via the combinatorial language of automata. The author deals with the notion of a time-varying automaton, which is thought to be a natural generalization of a Mealy-type automaton, allowing to work not only with a finite alphabet but also with a changing alphabet. He characterizes all sequences \((G_i,X_i)_{i\in\mathbb N}\) of finite transitive groups such that the corresponding infinitely iterated wreath product is a time-varying automaton group as well as a Mealy automaton group in the case when the changing alphabet \(X=(X_i)_{i\in\mathbb N}\) is constant. In other words, he provides the necessary and sufficient conditions for the existence of a time-varying automaton \(A\), such that the group \(W_\infty\) coincides with the topological closure of the group generated by this automaton. For each time-varying automaton group \(W_\infty\) he also provides the explicit construction of the corresponding automaton realization. This gives the upper bounds for the topological rank and for the minimal number of states in an automaton realization of the group \(W_\infty\).

Recommendations

• The automaton realization of iterated wreath products of cyclic groups.
• Automaton ranks of some self-similar groups.
• scientific article; zbMATH DE number 2201548
• ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA
• On some universal construction of minimal topological generating sets for inverse limits of iterated wreath products of non-abelian finite simple groups

Cites work

• A 2-generated just-infinite profinite group which is not positively generated.
• A generative theory of shape
• A Unified Approach to Design of Experiments
• A Wilson group of non-uniformly exponential growth.
• Algebraic and structural automata theory. Transl. of algebraiczna i structuralna teoria automatów (PWN, Warsaw, 1985)
• Automata, dynamical systems, and groups
• Branch groups
• Characterization of finitely generated infinitely iterated wreath products.
• Finite generation of iterated wreath products.
• Generalized Wreath Products of Permutation Groups
• scientific article; zbMATH DE number 1574582 (Why is no real title available?)
• scientific article; zbMATH DE number 3667062 (Why is no real title available?)
• scientific article; zbMATH DE number 53661 (Why is no real title available?)
• scientific article; zbMATH DE number 1034006 (Why is no real title available?)
• scientific article; zbMATH DE number 781164 (Why is no real title available?)
• scientific article; zbMATH DE number 2201548 (Why is no real title available?)
• scientific article; zbMATH DE number 2195483 (Why is no real title available?)
• scientific article; zbMATH DE number 3099425 (Why is no real title available?)
• ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA
• Solved and unsolved problems around one group.
• Some questions of Edjvet and Pride about infinite groups
• The automaton realization of iterated wreath products of cyclic groups.
• The concept of duality for automata over a changing alphabet and generation of a free group by such automata
• The concept of self-similar automata over a changing alphabet and lamplighter groups generated by such automata
• The finite images of finitely generated groups
• The generalized dihedral groups \(\text{Dih}(\mathbb{Z}^n)\) as groups generated by time-varying automata.
• The Rank and Generating Set for Iterated Wreath Products of Cyclic Groups
• The smallest Mealy automaton of intermediate growth.

Cited in

(4)

• scientific article; zbMATH DE number 2201548 (Why is no real title available?)
• A Characterization of Those Automata That Structurally Generate Finite Groups
• The automaton realization of iterated wreath products of cyclic groups.
• ON GENERATION OF WREATH PRODUCTS OF CYCLIC GROUPS BY TWO STATE TIME VARYING MEALY AUTOMATA

This page was built for publication: The characterization by automata of certain profinite groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254320)