Access the full text.
Sign up today, get DeepDyve free for 14 days.
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}}$ .
Groups Complexity Cryptology – de Gruyter
Published: Nov 1, 2016
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.