Mon, 10/14/2019 - 3:30pm Boyd Room 302 Title 2: Determining which groups have the same character table. Abstract 2: Two groups are said to have the same character table if a permutation of the rows and a permutation of the columns of one table produces the other table. The problem of determining when two groups have the same character table is computationally intriguing. We have constructed a database containing for all finite groups of order less than 2000 (excluding those of order 1024), a partitioning of groups into classes having the same character table. To handle the 408,641,062 groups of order 1536 and other orders with a large number of groups we utilized high-throughput computing together with a new algorithmic approach to the problem. Our approach involved using graph isomorphism software to construct canoncial graphs that correspond to the character table of a group and then hashing the graphs.
