A Divisibility Problem in the McKay Conjecture
Group Theory
2017-11-03 v1
Abstract
The mathematical software \texttt{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 \texttt{GAP} and Kuhn's Algorithm in order to test our conjecture.
Cite
@article{arxiv.1711.00642,
title = {A Divisibility Problem in the McKay Conjecture},
author = {Ignacio P. Navarro},
journal= {arXiv preprint arXiv:1711.00642},
year = {2017}
}
Comments
6 pages, 1 figure, 1 table