ON THE COMPLEXITY OF COMPUTING CHARACTERS OF FINITE GROUPS
| dc.contributor.author | Hepler, Charles Thomas | eng |
| dc.date.accessioned | 2008-02-26T22:33:38Z | |
| dc.date.available | 2008-02-26T22:33:38Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1994-10-01 | eng |
| dc.description.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. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1994-545-14 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30819 | |
| dc.identifier.uri | http://hdl.handle.net/1880/45530 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | ON THE COMPLEXITY OF COMPUTING CHARACTERS OF FINITE GROUPS | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |