GAP computations needed in the proof of [DNT, Theorem 6.1 (ii)]
This is a collection of example computations that are cited in the Appendix of [DNT]. In each case, the aim is to show that the extension of a given finite simple group by an elementary abelian group of given rank has the property that not all complex irreducible characters of the same degree are Ga...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | |
container_volume | |
creator | Breuer, Thomas Lux, Klaus |
description | This is a collection of example computations that are cited in the Appendix
of [DNT]. In each case, the aim is to show that the extension of a given finite
simple group by an elementary abelian group of given rank has the property that
not all complex irreducible characters of the same degree are Galois conjugate. |
doi_str_mv | 10.48550/arxiv.1206.6212 |
format | Article |
fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1206_6212</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1206_6212</sourcerecordid><originalsourceid>FETCH-LOGICAL-a652-b14afd67edc4305e36f9bca3f4fedf8323ff28cfc0bbeddbfeffaad3f3a9c25e3</originalsourceid><addsrcrecordid>eNotz81Lw0AQBfC9eJDq3ZPMUcHE_UjW9CSlahWKeshNJMzuztAFkw3bKPrf21rhwbs8HvyEOFOyrJq6lteYv-NXqbS0pdVKH4vb1eIVfOrHzwmnmIYtDESBAsQBpg3BmFNi2OXt7rm9gnZDKVMPtlRwEePl-4k4YvzY0ul_z0T7cN8uH4v1y-ppuVgXaGtdOFUhB3tDwVdG1mQsz51HwxVT4MZow6wbz146RyE4JmbEYNjg3OvdfibOD7d_gG7Mscf80-0h3R5ifgFr30Ml</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>GAP computations needed in the proof of [DNT, Theorem 6.1 (ii)]</title><source>arXiv.org</source><creator>Breuer, Thomas ; Lux, Klaus</creator><creatorcontrib>Breuer, Thomas ; Lux, Klaus</creatorcontrib><description>This is a collection of example computations that are cited in the Appendix
of [DNT]. In each case, the aim is to show that the extension of a given finite
simple group by an elementary abelian group of given rank has the property that
not all complex irreducible characters of the same degree are Galois conjugate.</description><identifier>DOI: 10.48550/arxiv.1206.6212</identifier><language>eng</language><subject>Mathematics - Representation Theory</subject><creationdate>2012-06</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1206.6212$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1206.6212$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Breuer, Thomas</creatorcontrib><creatorcontrib>Lux, Klaus</creatorcontrib><title>GAP computations needed in the proof of [DNT, Theorem 6.1 (ii)]</title><description>This is a collection of example computations that are cited in the Appendix
of [DNT]. In each case, the aim is to show that the extension of a given finite
simple group by an elementary abelian group of given rank has the property that
not all complex irreducible characters of the same degree are Galois conjugate.</description><subject>Mathematics - Representation Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81Lw0AQBfC9eJDq3ZPMUcHE_UjW9CSlahWKeshNJMzuztAFkw3bKPrf21rhwbs8HvyEOFOyrJq6lteYv-NXqbS0pdVKH4vb1eIVfOrHzwmnmIYtDESBAsQBpg3BmFNi2OXt7rm9gnZDKVMPtlRwEePl-4k4YvzY0ul_z0T7cN8uH4v1y-ppuVgXaGtdOFUhB3tDwVdG1mQsz51HwxVT4MZow6wbz146RyE4JmbEYNjg3OvdfibOD7d_gG7Mscf80-0h3R5ifgFr30Ml</recordid><startdate>20120627</startdate><enddate>20120627</enddate><creator>Breuer, Thomas</creator><creator>Lux, Klaus</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20120627</creationdate><title>GAP computations needed in the proof of [DNT, Theorem 6.1 (ii)]</title><author>Breuer, Thomas ; Lux, Klaus</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a652-b14afd67edc4305e36f9bca3f4fedf8323ff28cfc0bbeddbfeffaad3f3a9c25e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Mathematics - Representation Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Breuer, Thomas</creatorcontrib><creatorcontrib>Lux, Klaus</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Breuer, Thomas</au><au>Lux, Klaus</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>GAP computations needed in the proof of [DNT, Theorem 6.1 (ii)]</atitle><date>2012-06-27</date><risdate>2012</risdate><abstract>This is a collection of example computations that are cited in the Appendix
of [DNT]. In each case, the aim is to show that the extension of a given finite
simple group by an elementary abelian group of given rank has the property that
not all complex irreducible characters of the same degree are Galois conjugate.</abstract><doi>10.48550/arxiv.1206.6212</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | DOI: 10.48550/arxiv.1206.6212 |
ispartof | |
issn | |
language | eng |
recordid | cdi_arxiv_primary_1206_6212 |
source | arXiv.org |
subjects | Mathematics - Representation Theory |
title | GAP computations needed in the proof of [DNT, Theorem 6.1 (ii)] |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T14%3A07%3A02IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=GAP%20computations%20needed%20in%20the%20proof%20of%20%5BDNT,%20Theorem%206.1%20(ii)%5D&rft.au=Breuer,%20Thomas&rft.date=2012-06-27&rft_id=info:doi/10.48550/arxiv.1206.6212&rft_dat=%3Carxiv_GOX%3E1206_6212%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |