2000 character limit reached
Representations of Finite Polyadic Groups
Published 3 Nov 2010 in math.RT | (1011.0954v1)
Abstract: We prove that there is a one-one correspondence between sets of irreducible representations of a polyadic group and its Post's cover. Using this correspondence, we generalize some well-known properties of irreducible characters in finite groups to the case of polyadic groups.
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.