A Divisibility Problem in the McKay Conjecture

The mathematical software GAP (Groups, Algorithms, Programming) offers a powerful set of tools to investigate computationally group theory. Using this software package we investigate a variation of a well-known problem in representation theory, the McKay Conjecture, that asserts that there is a bije...

Full description

Saved in:

Bibliographic Details
Main Author	Navarro, Ignacio P
Format	Journal Article
Language	English
Published	02.11.2017
Subjects	Mathematics - Group Theory
Online Access	Get full text
DOI	10.48550/arxiv.1711.00642

Cover

More Information
Summary:	The mathematical software GAP (Groups, Algorithms, Programming) offers a powerful set of tools to investigate computationally group theory. Using this software package we investigate a variation of a well-known problem in representation theory, the McKay Conjecture, that asserts that there is a bijection between two sets of complex-valued functions defined on two finite groups. In order to do so, we use the extensive group database from GAP and Kuhn's Algorithm in order to test our conjecture.
DOI:	10.48550/arxiv.1711.00642