Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45530
Title: ON THE COMPLEXITY OF COMPUTING CHARACTERS OF FINITE GROUPS
Authors: Hepler, Charles Thomas
Keywords: Computer Science
Issue Date: 1-Oct-1994
Abstract: This thesis examines the computational complexity of the problem of finding the characters of finite groups and some associated problems. The central focus is how the complexity changes according to how the group is specified. We examine two extremes. Considering computations from Cayley tables, when the input size is quadratic in the order of the input group, we observe that we can efficiently invert Burnside's character table algorithm to find class matrices. We also consider computations involving the symmetric group with inputs of size polylogarithmic in the order of the input group. We show completeness and hardness results for computations of individual characters of the symmetric group. Examining the problem of decomposition of outer products of characters of the symmetric group, we show that a generalization of the problem is computationally hard. We show that lattice partitions can be enumerated efficiently.
URI: http://hdl.handle.net/1880/45530
Appears in Collections:Hepler, Charles

Files in This Item:
File Description SizeFormat 
1994-545-14.pdf9.14 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.