A Divisibility Problem in the McKay Conjecture
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.