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).
Show Summary Details
More options …
More options …

Discrete Mathematics and Applications
Editor-in-Chief: Zubkov, Andrei
6 Issues per year
CiteScore 2016: 0.16
SCImago Journal Rank (SJR) 2016: 0.231
Source Normalized Impact per Paper (SNIP) 2016: 0.552
- Online
- ISSN
- 1569-3929
See all formats and pricing
*Prices in US$ apply to orders placed in the Americas only. Prices in GBP apply to orders placed in Great Britain only. Prices in € represent the retail prices valid in Germany (unless otherwise indicated). Prices are subject to change without notice. Prices do not include postage and handling if applicable. RRP: Recommended Retail Price.
- Most Downloaded Articles
Most Downloaded Articles
- Masthead
- Masthead
- Masthead by null
- Masthead by null
- Masthead
- Masthead by null
- Masthead
- Inequalities for functionals generated by bipartite graphs by SIDORENKO, A. F.
- Frontmatter
- Frontmatter
- Frontmatter
- Masthead by null
- Masthead
- Frontmatter
- Frontmatter
- Frontmatter
- On insecurity of cryptosystems based on generalized Reed-Solomon codes by SIDELNIKOV, V. M. and SHESTAKOV, S. O.
- Frontmatter
- Frontmatter
- Front matter
Volume 14, Issue 1
Issues
Volume 28 (2018)
Volume 27 (2017)
Volume 26 (2016)
Volume 25 (2015)
Volume 24 (2014)
Volume 23 (2013)
Volume 22 (2012)
Volume 21 (2011)
Volume 20 (2010)
Volume 19 (2009)
Volume 18 (2008)
Volume 17 (2007)
Volume 16 (2006)
Volume 15 (2005)
Volume 14 (2004)
Volume 13 (2003)
Volume 12 (2002)
Volume 11 (2001)
Volume 10 (2000)
Volume 9 (1999)
Volume 8 (1998)
Volume 7 (1997)
Volume 6 (1996)
Volume 5 (1995)
Volume 4 (1994)
Volume 3 (1993)
Volume 2 (1992)
- (to the centenary of the birth)
- Some classes of random mappings of finite sets and non-homogeneous branching processes
- The method of boundary functionals for non-regular structures
- A formula for the radius of stability of a vector -extremal trajectory problem
- Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals
- Standard basis of a polynomial ideal over commutative Artinian chain ring
- On some systems of generators of symmetric and alternating groups which allow a simple software implementation
On some systems of generators of symmetric and alternating groups which allow a simple software implementation
I.G. Shaposhnikov
30,00 € / $42.00 / £23.00
Get Access to Full TextAbout the article
Published in Print: 2004-01-01
Citation Information: Discrete Mathematics and Applications dma, Volume 14, Issue 1, Pages 103–110, ISSN (Online) 1569-3929, ISSN (Print) 0924-9265, DOI: https://doi.org/10.1515/156939204774148839.
Related Content
Loading ...
- Andrei Andreevich Markov (to the centenary of the birth)
- Some classes of random mappings of finite sets and non-homogeneous branching processes
- The method of boundary functionals for non-regular structures
- A formula for the radius of stability of a vector l ∞-extremal trajectory problem
- Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals
- Standard basis of a polynomial ideal over commutative Artinian chain ring
- On some systems of generators of symmetric and alternating groups which allow a simple software implementation

Comments (0)