scientific article; zbMATH DE number 3927174
From MaRDI portal
Publication:3701611
[For the entire collection see Zbl 0549.00006.] Let f, g be two permutations on a set A. If \(g^ n=f\), then g is called an nth root of f. The author obtains necessary and sufficient conditions for the existence of nth roots of f. Further, a determination of the number of nth roots of f is given in the case where A is a finite set. The formula for the number of nth roots is too complicated to describe in a brief review.
Recommendations
Cited in
(8)- On the number of even permutations with roots
- On the number of mth roots of permutations
- scientific article; zbMATH DE number 3896829 (Why is no real title available?)
- scientific article; zbMATH DE number 3922653 (Why is no real title available?)
- scientific article; zbMATH DE number 4079429 (Why is no real title available?)
- scientific article; zbMATH DE number 1523258 (Why is no real title available?)
- scientific article; zbMATH DE number 7731173 (Why is no real title available?)
- Connecting primitive roots and permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701611)