Computational Enumeration of Andr\'e Planes
In this paper, we address computational questions surrounding the enumeration of non-isomorphic Andr\'e planes for any prime power order. We are particularly focused on providing a complete enumeration of all such planes for relatively small orders (up to 125), as well as developing computation...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| 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 | Dover, Jeremy M |
| description | In this paper, we address computational questions surrounding the enumeration
of non-isomorphic Andr\'e planes for any prime power order. We are particularly
focused on providing a complete enumeration of all such planes for relatively
small orders (up to 125), as well as developing computationally efficient ways
to count the number of isomorphism classes for other orders where enumeration
is infeasible. Andr\'e planes of all dimensions over their kernel are
considered. |
| doi_str_mv | 10.48550/arxiv.2105.07439 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2105_07439</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2105_07439</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2105_074393</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjQw1TMwNzG25GTQds7PLSgtSSzJzM9LzFFwzSvNTS0C8xTy0xQc81KKYtRTFQJyEvNSi3kYWNMSc4pTeaE0N4O8m2uIs4cu2Nj4gqLM3MSiyniQ8fFg440JqwAAM6IuyA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Computational Enumeration of Andr\'e Planes</title><source>arXiv.org</source><creator>Dover, Jeremy M</creator><creatorcontrib>Dover, Jeremy M</creatorcontrib><description>In this paper, we address computational questions surrounding the enumeration
of non-isomorphic Andr\'e planes for any prime power order. We are particularly
focused on providing a complete enumeration of all such planes for relatively
small orders (up to 125), as well as developing computationally efficient ways
to count the number of isomorphism classes for other orders where enumeration
is infeasible. Andr\'e planes of all dimensions over their kernel are
considered.</description><identifier>DOI: 10.48550/arxiv.2105.07439</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2021-05</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,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2105.07439$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2105.07439$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Dover, Jeremy M</creatorcontrib><title>Computational Enumeration of Andr\'e Planes</title><description>In this paper, we address computational questions surrounding the enumeration
of non-isomorphic Andr\'e planes for any prime power order. We are particularly
focused on providing a complete enumeration of all such planes for relatively
small orders (up to 125), as well as developing computationally efficient ways
to count the number of isomorphism classes for other orders where enumeration
is infeasible. Andr\'e planes of all dimensions over their kernel are
considered.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjQw1TMwNzG25GTQds7PLSgtSSzJzM9LzFFwzSvNTS0C8xTy0xQc81KKYtRTFQJyEvNSi3kYWNMSc4pTeaE0N4O8m2uIs4cu2Nj4gqLM3MSiyniQ8fFg440JqwAAM6IuyA</recordid><startdate>20210516</startdate><enddate>20210516</enddate><creator>Dover, Jeremy M</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210516</creationdate><title>Computational Enumeration of Andr\'e Planes</title><author>Dover, Jeremy M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2105_074393</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Dover, Jeremy M</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Dover, Jeremy M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computational Enumeration of Andr\'e Planes</atitle><date>2021-05-16</date><risdate>2021</risdate><abstract>In this paper, we address computational questions surrounding the enumeration
of non-isomorphic Andr\'e planes for any prime power order. We are particularly
focused on providing a complete enumeration of all such planes for relatively
small orders (up to 125), as well as developing computationally efficient ways
to count the number of isomorphism classes for other orders where enumeration
is infeasible. Andr\'e planes of all dimensions over their kernel are
considered.</abstract><doi>10.48550/arxiv.2105.07439</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2105.07439 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2105_07439 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | Computational Enumeration of Andr\'e Planes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T12%3A50%3A36IST&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=Computational%20Enumeration%20of%20Andr%5C'e%20Planes&rft.au=Dover,%20Jeremy%20M&rft.date=2021-05-16&rft_id=info:doi/10.48550/arxiv.2105.07439&rft_dat=%3Carxiv_GOX%3E2105_07439%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 |