{"id":{"repo_id":"aachen","oai_identifier":"oai:publications.rwth-aachen.de:61837"},"canonical_url":"https://search.dev.ndltd.org/etd/aachen/oai:publications.rwth-aachen.de:61837","repository":{"repo_id":"aachen","name":"RWTH Aachen University","base_url":"https://publications.rwth-aachen.de/oai2d"},"display":{"title":"Unipotente Charaktere und Zerlegungszahlen der endlichen Chevalleygruppen vom Typ F 4","abstract":"This thesis contributes to the representation theory of finite Chevalleygroups. First we describe algorithms for explicit computation in connected reductive algebraic groups. These algorithms are well adapted to the computation in some finite subgroups, i.e., the finite groups of Lie type and their parabolic subgroups. Thus we can compute Bruhat decompositions, centralizers, conjugacy classes, fusions and intersection numbers of conjugacy classes with double cosets. The most crucial point is, that all these computations can be done for all finite fields simultaneously.Second we use these algorithms to determine the unipotent characters of the finite Chevalley groups of type F_4 as explicit class functions. This is done using the classification of these characters given by Deligne and Lusztig. We get further information by explicit Harish-Chandra induction, the construction of modified Gelfand-Graev characters. We compute some missing character values using Ree's character formula.Finally we compute large parts of the decomposition matrices of the unipotent blocks of these groups by constructing appropriate projective characters and using Brauer reciprocity.","abstract_html":"This thesis contributes to the representation theory of finite Chevalleygroups. First we describe algorithms for explicit computation in connected reductive algebraic groups. These algorithms are well adapted to the computation in some finite subgroups, i.e., the finite groups of Lie type and their parabolic subgroups. Thus we can compute Bruhat decompositions, centralizers, conjugacy classes, fusions and intersection numbers of conjugacy classes with double cosets. The most crucial point is, that all these computations can be done for all finite fields simultaneously.Second we use these algorithms to determine the unipotent characters of the finite Chevalley groups of type F_4 as explicit class functions. This is done using the classification of these characters given by Deligne and Lusztig. We get further information by explicit Harish-Chandra induction, the construction of modified Gelfand-Graev characters. We compute some missing character values using Ree&#x27;s character formula.Finally we compute large parts of the decomposition matrices of the unipotent blocks of these groups by constructing appropriate projective characters and using Brauer reciprocity.","abstract_has_math":false,"creators":["Köhler, Christoph David"],"institution":"Publikationsserver der RWTH Aachen University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Hiß, Gerhard"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2006,"date_issued":"2006","date_published":"2006","updated_at":"2026-07-30T19:43:19Z","subjects":["info:eu-repo/classification/ddc/510","Mathematik","Darstellungstheorie","Gruppentheorie","Zerlegungszahlen","Bruhatzerlegung","Charaktertafeln","Chevalleygruppen"],"languages":["ger"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123458%22"],"render_values":[{"text":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123458%22","href":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123458%22","code":true}]}]},"links":{"outbound_url":"https://publications.rwth-aachen.de/record/61837","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hiß, Gerhard"]},{"key":"dc:creator","label":"Author","values":["Köhler, Christoph David"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:coverage","label":"Dc Coverage","values":["DE"]},{"key":"dc:date","label":"Dc Date","values":["2006"]},{"key":"dc:publisher","label":"Institution","values":["Publikationsserver der RWTH Aachen University"]},{"key":"dc:relation","label":"Dc Relation","values":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-14241"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["info:eu-repo/classification/ddc/510","Mathematik","Darstellungstheorie","Gruppentheorie","Zerlegungszahlen","Bruhatzerlegung","Charaktertafeln","Chevalleygruppen"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["ger"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/record/61837","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123458%22"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This thesis contributes to the representation theory of finite Chevalleygroups. First we describe algorithms for explicit computation in connected reductive algebraic groups. These algorithms are well adapted to the computation in some finite subgroups, i.e., the finite groups of Lie type and their parabolic subgroups. Thus we can compute Bruhat decompositions, centralizers, conjugacy classes, fusions and intersection numbers of conjugacy classes with double cosets. The most crucial point is, that all these computations can be done for all finite fields simultaneously.Second we use these algorithms to determine the unipotent characters of the finite Chevalley groups of type F_4 as explicit class functions. This is done using the classification of these characters given by Deligne and Lusztig. We get further information by explicit Harish-Chandra induction, the construction of modified Gelfand-Graev characters. We compute some missing character values using Ree's character formula.Finally we compute large parts of the decomposition matrices of the unipotent blocks of these groups by constructing appropriate projective characters and using Brauer reciprocity."]},{"key":"dc:source","label":"Dc Source","values":["Aachen : Publikationsserver der RWTH Aachen University 333 S. (2006). = Aachen, Techn. Hochsch., Diss., 2006"]},{"key":"dc:title","label":"Title","values":["Unipotente Charaktere und Zerlegungszahlen der endlichen Chevalleygruppen vom Typ F 4"]}]}],"canonical_facts":{"dc:contributor":["Hiß, Gerhard"],"dc:coverage":["DE"],"dc:creator":["Köhler, Christoph David"],"dc:date":["2006"],"dc:description":["This thesis contributes to the representation theory of finite Chevalleygroups. First we describe algorithms for explicit computation in connected reductive algebraic groups. These algorithms are well adapted to the computation in some finite subgroups, i.e., the finite groups of Lie type and their parabolic subgroups. Thus we can compute Bruhat decompositions, centralizers, conjugacy classes, fusions and intersection numbers of conjugacy classes with double cosets. The most crucial point is, that all these computations can be done for all finite fields simultaneously.Second we use these algorithms to determine the unipotent characters of the finite Chevalley groups of type F_4 as explicit class functions. This is done using the classification of these characters given by Deligne and Lusztig. We get further information by explicit Harish-Chandra induction, the construction of modified Gelfand-Graev characters. We compute some missing character values using Ree's character formula.Finally we compute large parts of the decomposition matrices of the unipotent blocks of these groups by constructing appropriate projective characters and using Brauer reciprocity."],"dc:identifier":["https://publications.rwth-aachen.de/record/61837","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-123458%22"],"dc:language":["ger"],"dc:publisher":["Publikationsserver der RWTH Aachen University"],"dc:relation":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-14241"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:source":["Aachen : Publikationsserver der RWTH Aachen University 333 S. (2006). = Aachen, Techn. Hochsch., Diss., 2006"],"dc:subject":["info:eu-repo/classification/ddc/510","Mathematik","Darstellungstheorie","Gruppentheorie","Zerlegungszahlen","Bruhatzerlegung","Charaktertafeln","Chevalleygruppen"],"dc:title":["Unipotente Charaktere und Zerlegungszahlen der endlichen Chevalleygruppen vom Typ F 4"],"dc:type":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]},"updated_at":"2026-07-30T19:43:19Z"}