2000 character limit reached
Word symmetric functions and the Redfield-Pólya
Published 23 Feb 2013 in math.CO | (1302.5815v1)
Abstract: We give noncommutative versions of the Redfield-P\'olya theorem in WSym, the algebra of word symmetric functions, and in other related combinatorial Hopf algebras.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.