Putting the squeeze on the Noether gap – The case of the alternating groups(A_n)
✍ Scribed by Larry Smith
- Book ID
- 105874257
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 76 KB
- Volume
- 315
- Category
- Article
- ISSN
- 0025-5831
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This paper introduces a new class of interconnection scheme based on the Cayley graph of the alternating group. It is shown that this class of graphs are edge symmetric and 2-transitive. We then describe an algorithm for (a) packet routing based on the shortest path analysis, (b) finding a Hamiltoni
Let \(G\) be a finite group such that every composition factor of \(G\) is either cyclic or isomorphic to the alternating group on \(n\) letters for some integer \(n\). Then for every positive integer \(h\) there is a subset \(A \subseteq G\) such that \(|A| \leqslant(2 h-1)|G|^{1 / h}\) and \(A^{h}