{"paper":{"title":"On the number of mth roots of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jes\\'us Lea\\~nos, Luis Manuel Rivera-Mart\\'inez, Rutilo Moreno","submitted_at":"2010-05-10T13:21:01Z","abstract_excerpt":"Let m be a fixed positive integer. It is well-known that a permutation $\\sigma$ may have one, many, or no mth roots. In this note we provide an explicit expression and a generating function for the number of mth roots of \\sigma. Let p_m(n) be the probability that a random n-permutation has an mth root. We also include a proof that p_m(jq)=p_m(jq+1)=... =p_m(jq+(q-1)) where j=0,1,... and m is a power of prime q."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1531","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}