Counting Free Abelian Actions
White, Tad
Original · EN
We consider the problem of counting commuting r-tuples of elements of the symmetric group Sₙ, i.e. computing |Hom(Zʳ,Sₙ)|. 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.