Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the covering number of small symmetric groups and some sporadic simple groups

On the covering number of small symmetric groups and some sporadic simple groups Abstract A set of proper subgroups is a cover for a group if its union is the whole group. The minimal number of subgroups needed to cover G is called the covering number of G , denoted by σ ⁢ ( G ) ${\sigma(G)}$ . Determining σ ⁢ ( G ) ${\sigma(G)}$ is an open problem for many nonsolvable groups. For symmetric groups S n ${S_{n}}$ , Maróti determined σ ⁢ ( S n ) ${\sigma(S_{n})}$ for odd n with the exception of n = 9 ${n=9}$ and gave estimates for n even. In this paper we determine σ ⁢ ( S n ) ${\sigma(S_{n})}$ for n = 8 , 9 , 10 , 12 ${n=8,9,10,12}$ . In addition we find the covering number for the Mathieu group M 12 ${M_{12}}$ and improve an estimate given by Holmes for the Janko group J 1 ${J_{1}}$ . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

On the covering number of small symmetric groups and some sporadic simple groups

Loading next page...
 
/lp/de-gruyter/on-the-covering-number-of-small-symmetric-groups-and-some-sporadic-C8NKORlJ5Y
Publisher
de Gruyter
Copyright
Copyright © 2016 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2016-0010
Publisher site
See Article on Publisher Site

Abstract

Abstract A set of proper subgroups is a cover for a group if its union is the whole group. The minimal number of subgroups needed to cover G is called the covering number of G , denoted by σ ⁢ ( G ) ${\sigma(G)}$ . Determining σ ⁢ ( G ) ${\sigma(G)}$ is an open problem for many nonsolvable groups. For symmetric groups S n ${S_{n}}$ , Maróti determined σ ⁢ ( S n ) ${\sigma(S_{n})}$ for odd n with the exception of n = 9 ${n=9}$ and gave estimates for n even. In this paper we determine σ ⁢ ( S n ) ${\sigma(S_{n})}$ for n = 8 , 9 , 10 , 12 ${n=8,9,10,12}$ . In addition we find the covering number for the Mathieu group M 12 ${M_{12}}$ and improve an estimate given by Holmes for the Janko group J 1 ${J_{1}}$ .

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2016

References