Counting Free Abelian Actions
Abstract
We consider the problem of counting commuting r-tuples of elements of the symmetric group Sn, i.e. computing |Hom(Zr,Sn)|. The cases r=1,2 are well-known; a product formula for the case r=3 was conjectured by Adams-Watters and later proved by Britnell. In this note we solve the problem for arbitrary r.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.