An algorithm for constructing all supercharacter theories of a finite group
From MaRDI portal
Publication:4988845
DOI10.26493/1855-3974.1936.8c6zbMath1486.20005arXiv1911.12232OpenAlexW3016186197MaRDI QIDQ4988845
Leila Ghanbari-Maman, Kaveh Kavousi, Ali Reza Ashrafi, Fatemeh Koorepazan-Moftakhar
Publication date: 19 May 2021
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.12232
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Representation theory of finite groups. An introductory approach.
- Classification of finite groups according to the number of conjugacy classes
- Classification of finite groups according to the number of conjugacy classes. II
- Basic characters of the unitriangular group
- Basic characters of the unitriangular group (for arbitrary primes)
- Groups with exactly two supercharacter theories
- Handbook of Applied Algorithms
- A Fast Algorithm for Generating Set Partitions
- Towards the classification of finite simple groups with exactly three or four supercharacter theories
- The finite groups with thirteen and fourteen conjugacy classes
- Supercharacters and superclasses for algebra groups
This page was built for publication: An algorithm for constructing all supercharacter theories of a finite group