Estimation of the diameter of the graph of a group of automaton permutations
1 Department of Algebra and Informatics, Yuriy Fedkovych Chernivtsi National University, Chernivtsi, 58000, Ukraine
Keywords:
the diameter of the graph, automaton permutations
Abstract
An example of mininal system of generators is constructed for wreath degree of symmetric group Sn. The upper bound of diameter of Cayley graph is obtained for groups of automatic
permutations on finite alphabet X(r) regarding to abovementioned generators systems.
Cite
- ACS Style
- Sikora, V.S. Estimation of the diameter of the graph of a group of automaton permutations. Bukovinian Mathematical Journal. 2018, 1
- AMA Style
- Sikora VS. Estimation of the diameter of the graph of a group of automaton permutations. Bukovinian Mathematical Journal. 2018; 1(134).
- Chicago/Turabian Style
- Vira Stepanivna Sikora. 2018. "Estimation of the diameter of the graph of a group of automaton permutations". Bukovinian Mathematical Journal. 1 no. 134.
Export