Über die Anzahl der Lösungen von x^n=1 in der symmetrischen Gruppe S_n
From MaRDI portal
Publication:1251685
DOI10.1007/BF01226105zbMATH Open0392.10040OpenAlexW2092163976MaRDI QIDQ1251685FDOQ1251685
Authors: Richard Warlimont
Publication date: 1978
Published in: Archiv der Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01226105
Symmetric groups (20B30) Abstract finite groups (20D99) Asymptotic results on counting functions for algebraic and topological structures (11N45)
Cites Work
Cited In (6)
- Equations in groups
- A black-box group algorithm for recognizing finite symmetric and alternating groups, I
- Identifying long cycles in finite alternating and symmetric groups acting on subsets
- Title not available (Why is that?)
- On permutations of order dividing a given integer
- Permutations with equal orders
This page was built for publication: Über die Anzahl der Lösungen von \(x^n=1\) in der symmetrischen Gruppe \(S_n\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1251685)