Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 827-834 |
| Seitenumfang | 8 |
| Fachzeitschrift | American Mathematical Monthly |
| Jahrgang | 127 |
| Ausgabenummer | 9 |
| Publikationsstatus | Veröffentlicht - 21 Okt. 2020 |
Abstract
It is easy to see that the number of automorphisms of a finite group of order n cannot exceed (Formula presented.). Ledermann and Neumann proved conversely that the order of a finite group G can be bounded by a function depending only on the number of automorphisms of G. While their proof is long and complicated, the result was rediscovered by Nagrebeckiĭ 14 years later. In this article, we give a short and elementary proof of Ledermann–Neumann’s theorem based on some of Nagrebeckiĭ’s arguments. We also discuss the history of related conjectures.
ASJC Scopus Sachgebiete
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: American Mathematical Monthly, Jahrgang 127, Nr. 9, 21.10.2020, S. 827-834.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - On a Theorem of Ledermann and Neumann
AU - Sambale, Benjamin
N1 - Funding Information: The author is supported by the German Research Foundation (SA 2864/1-2 and SA 2864/3-1).
PY - 2020/10/21
Y1 - 2020/10/21
N2 - It is easy to see that the number of automorphisms of a finite group of order n cannot exceed (Formula presented.). Ledermann and Neumann proved conversely that the order of a finite group G can be bounded by a function depending only on the number of automorphisms of G. While their proof is long and complicated, the result was rediscovered by Nagrebeckiĭ 14 years later. In this article, we give a short and elementary proof of Ledermann–Neumann’s theorem based on some of Nagrebeckiĭ’s arguments. We also discuss the history of related conjectures.
AB - It is easy to see that the number of automorphisms of a finite group of order n cannot exceed (Formula presented.). Ledermann and Neumann proved conversely that the order of a finite group G can be bounded by a function depending only on the number of automorphisms of G. While their proof is long and complicated, the result was rediscovered by Nagrebeckiĭ 14 years later. In this article, we give a short and elementary proof of Ledermann–Neumann’s theorem based on some of Nagrebeckiĭ’s arguments. We also discuss the history of related conjectures.
KW - MSC: Primary 20D45
UR - http://www.scopus.com/inward/record.url?scp=85093658805&partnerID=8YFLogxK
U2 - 10.48550/arXiv.1909.13220
DO - 10.48550/arXiv.1909.13220
M3 - Article
AN - SCOPUS:85093658805
VL - 127
SP - 827
EP - 834
JO - American Mathematical Monthly
JF - American Mathematical Monthly
SN - 0002-9890
IS - 9
ER -