×

zbMATH — the first resource for mathematics

On some systems of generators of symmetric and alternating groups which allow a simple software implementation. (English. Russian original) Zbl 1052.20003
Discrete Math. Appl. 14, No. 1, 103-110 (2004); translation from Diskretn. Mat. 16, No. 1, 114-120 (2004).
Summary: We give systems of generators of symmetric and alternating permutation groups whose software implementation relies upon simple arithmetical operations. For some given systems, we estimate the group depth (the generator system index).
MSC:
20B40 Computational methods (permutation groups) (MSC2010)
20F05 Generators, relations, and presentations of groups
20B35 Subgroups of symmetric groups
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Proc. Discrete Math. 1 pp 43– (1997)
[2] H. Wielandt, Finite Permutation Groups. Academic Press, London, 1964. · Zbl 0138.02501
[3] Algebra Logic 19 pp 147– (1981)
[4] Discrete Math. Appl. 9 pp 403– (1999)
[5] D. Raghavarao, Constructions and Combinatorial Problems in Design of Experiments. Wiley, New York, 1971. · Zbl 0222.62036
[6] V. D. Belousov, Foundations of the Theory of Quasigroups and Loops. Nauka, Moscow, 1967 (in Russian).
[7] V. V. Borisenko, Irreducible n-quasigroups on finite sets of composite order. Math. Invest. (1979) No. 51, 38-42 (in Russian). · Zbl 0432.20058
[8] Shaposhnikov A, Rev. Appl. Industrial Math. 9 pp 669– (2002)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.