Complexity in Invariant Theory.
dc.contributor.author | Kadish, Harlan | en_US |
dc.date.accessioned | 2011-09-15T17:12:24Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2011-09-15T17:12:24Z | |
dc.date.issued | 2011 | en_US |
dc.date.submitted | en_US | |
dc.identifier.uri | https://hdl.handle.net/2027.42/86381 | |
dc.description.abstract | Computational invariant theory considers two problems in the representations of algebraic groups: computing generators for rings of polynomial invariant functions, and determining whether two points lie in the same orbit. This thesis examines the complexity of these tasks. On the one hand, to count generating invariants for a semisimple group, choose an representation of highest weight w, and consider the irreducible representations of highest weight nw. As n goes to infinity, the cardinality of a minimal generating set grows faster than any polynomial in n. On the other hand, one can separate the orbits of any algebraic group action in polynomial time using "constructible" functions defined by straight line programs in the polynomial ring, with a new "quasi-inverse" that computes the inverse of a function where defined. | en_US |
dc.language.iso | en_US | en_US |
dc.subject | Algebraic Group | en_US |
dc.subject | Separate Orbits | en_US |
dc.subject | Algorithm | en_US |
dc.subject | Semisimple Group | en_US |
dc.subject | Polynomial Time | en_US |
dc.subject | Generating Invariants | en_US |
dc.title | Complexity in Invariant Theory. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Mathematics | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Derksen, Harm | en_US |
dc.contributor.committeemember | Hochster, Melvin | en_US |
dc.contributor.committeemember | Smith, Karen E. | en_US |
dc.contributor.committeemember | Stark, Wayne E. | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/86381/1/hmkadish_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.