An algorithm for constructing all supercharacter theories of a finite group

Ali Reza Ashrafi; Leila Ghanbari-Maman; Kaveh ‎Kavousi; Fatemeh ‎Koorepazan-Moftakhar

doi:10.26493/1855-3974.1936.8c6

Authors

Ali Reza Ashrafi University of Kashan, Iran https://orcid.org/0000-0002-2858-0663
Leila Ghanbari-Maman University of Kashan, Iran and University of Tehran, Iran
Kaveh ‎Kavousi University of Tehran, Iran https://orcid.org/0000-0002-1906-3912
Fatemeh ‎Koorepazan-Moftakhar University of Kashan, Iran and Sharif University of Technology, Iran https://orcid.org/0000-0003-3531-5355

DOI:

https://doi.org/10.26493/1855-3974.1936.8c6

Keywords:

Supercharacter theory‎, ‎superclass‎, ‎conjugacy class‎, ‎irreducible character

Abstract

In 2008, Diaconis and Isaacs introduced the notion of a supercharacter theory of a finite group in which supercharacters replace with irreducible characters and superclasses by conjugacy classes. In this paper, we introduce an algorithm for constructing supercharacter theories of a finite group by which all supercharacter theories of groups containing up to 14 conjugacy classes are calculated.

An algorithm for constructing all supercharacter theories of a finite group

Authors

DOI:

Keywords:

Abstract

Downloads

Published

Issue

Section

License

Developed By

Information