Degree of Orthomorphism Polynomials over Finite Fields

An orthomorphism over a finite field \(\mathbb{F}_q\) is a permutation \(\theta:\mathbb{F}_q\mapsto\mathbb{F}_q\) such that the map \(x\mapsto\theta(x)-x\) is also a permutation of \(\mathbb{F}_q\). The degree of an orthomorphism of \(\mathbb{F}_q\), that is, the degree of the associated reduced per...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2021-03
Hauptverfasser: Allsop, Jack, Wanless, Ian M
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Allsop, Jack
Wanless, Ian M
description An orthomorphism over a finite field \(\mathbb{F}_q\) is a permutation \(\theta:\mathbb{F}_q\mapsto\mathbb{F}_q\) such that the map \(x\mapsto\theta(x)-x\) is also a permutation of \(\mathbb{F}_q\). The degree of an orthomorphism of \(\mathbb{F}_q\), that is, the degree of the associated reduced permutation polynomial, is known to be at most \(q-3\). We show that this upper bound is achieved for all prime powers \(q\notin\{2, 3, 5, 8\}\). We do this by finding two orthomorphisms in each field that differ on only three elements of their domain. Such orthomorphisms can be used to construct \(3\)-homogeneous Latin bitrades.
doi_str_mv 10.48550/arxiv.2103.02153
format Article
fullrecord <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2103_02153</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2496731470</sourcerecordid><originalsourceid>FETCH-LOGICAL-a520-3de8431518f967e09e19f466a7c03982bd5f2f666947af5f42fffa603bd9b4333</originalsourceid><addsrcrecordid>eNotjzFPwzAUhC0kJKrSH8BEJOaE5_dsJx5RoYBUqQzdI4fY1FUSByet6L8ntEw33OnuPsbuOGSikBIeTfzxxww5UAbIJV2xGRLxtBCIN2wxDHsAQJWjlDRj6tl-RWuT4JJNHHehDbHf-aFNPkJz6kLrTTMk4WhjsvKdH-0ktqmHW3btJscu_nXOtquX7fItXW9e35dP69RIhJRqWwjikhdOq9yCtlw7oZTJP4F0gVUtHTqllBa5cdIJdM4ZBVTVuhJENGf3l9ozVNlH35p4Kv_gyjPclHi4JPoYvg92GMt9OMRu-lSimEaJixzoF-C2UKY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2496731470</pqid></control><display><type>article</type><title>Degree of Orthomorphism Polynomials over Finite Fields</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Allsop, Jack ; Wanless, Ian M</creator><creatorcontrib>Allsop, Jack ; Wanless, Ian M</creatorcontrib><description>An orthomorphism over a finite field \(\mathbb{F}_q\) is a permutation \(\theta:\mathbb{F}_q\mapsto\mathbb{F}_q\) such that the map \(x\mapsto\theta(x)-x\) is also a permutation of \(\mathbb{F}_q\). The degree of an orthomorphism of \(\mathbb{F}_q\), that is, the degree of the associated reduced permutation polynomial, is known to be at most \(q-3\). We show that this upper bound is achieved for all prime powers \(q\notin\{2, 3, 5, 8\}\). We do this by finding two orthomorphisms in each field that differ on only three elements of their domain. Such orthomorphisms can be used to construct \(3\)-homogeneous Latin bitrades.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2103.02153</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Fields (mathematics) ; Mathematics - Combinatorics ; Mathematics - Rings and Algebras ; Permutations ; Polynomials ; Upper bounds</subject><ispartof>arXiv.org, 2021-03</ispartof><rights>2021. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><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,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.1016/j.ffa.2021.101893$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2103.02153$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Allsop, Jack</creatorcontrib><creatorcontrib>Wanless, Ian M</creatorcontrib><title>Degree of Orthomorphism Polynomials over Finite Fields</title><title>arXiv.org</title><description>An orthomorphism over a finite field \(\mathbb{F}_q\) is a permutation \(\theta:\mathbb{F}_q\mapsto\mathbb{F}_q\) such that the map \(x\mapsto\theta(x)-x\) is also a permutation of \(\mathbb{F}_q\). The degree of an orthomorphism of \(\mathbb{F}_q\), that is, the degree of the associated reduced permutation polynomial, is known to be at most \(q-3\). We show that this upper bound is achieved for all prime powers \(q\notin\{2, 3, 5, 8\}\). We do this by finding two orthomorphisms in each field that differ on only three elements of their domain. Such orthomorphisms can be used to construct \(3\)-homogeneous Latin bitrades.</description><subject>Fields (mathematics)</subject><subject>Mathematics - Combinatorics</subject><subject>Mathematics - Rings and Algebras</subject><subject>Permutations</subject><subject>Polynomials</subject><subject>Upper bounds</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotjzFPwzAUhC0kJKrSH8BEJOaE5_dsJx5RoYBUqQzdI4fY1FUSByet6L8ntEw33OnuPsbuOGSikBIeTfzxxww5UAbIJV2xGRLxtBCIN2wxDHsAQJWjlDRj6tl-RWuT4JJNHHehDbHf-aFNPkJz6kLrTTMk4WhjsvKdH-0ktqmHW3btJscu_nXOtquX7fItXW9e35dP69RIhJRqWwjikhdOq9yCtlw7oZTJP4F0gVUtHTqllBa5cdIJdM4ZBVTVuhJENGf3l9ozVNlH35p4Kv_gyjPclHi4JPoYvg92GMt9OMRu-lSimEaJixzoF-C2UKY</recordid><startdate>20210303</startdate><enddate>20210303</enddate><creator>Allsop, Jack</creator><creator>Wanless, Ian M</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20210303</creationdate><title>Degree of Orthomorphism Polynomials over Finite Fields</title><author>Allsop, Jack ; Wanless, Ian M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a520-3de8431518f967e09e19f466a7c03982bd5f2f666947af5f42fffa603bd9b4333</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Fields (mathematics)</topic><topic>Mathematics - Combinatorics</topic><topic>Mathematics - Rings and Algebras</topic><topic>Permutations</topic><topic>Polynomials</topic><topic>Upper bounds</topic><toplevel>online_resources</toplevel><creatorcontrib>Allsop, Jack</creatorcontrib><creatorcontrib>Wanless, Ian M</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Allsop, Jack</au><au>Wanless, Ian M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Degree of Orthomorphism Polynomials over Finite Fields</atitle><jtitle>arXiv.org</jtitle><date>2021-03-03</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>An orthomorphism over a finite field \(\mathbb{F}_q\) is a permutation \(\theta:\mathbb{F}_q\mapsto\mathbb{F}_q\) such that the map \(x\mapsto\theta(x)-x\) is also a permutation of \(\mathbb{F}_q\). The degree of an orthomorphism of \(\mathbb{F}_q\), that is, the degree of the associated reduced permutation polynomial, is known to be at most \(q-3\). We show that this upper bound is achieved for all prime powers \(q\notin\{2, 3, 5, 8\}\). We do this by finding two orthomorphisms in each field that differ on only three elements of their domain. Such orthomorphisms can be used to construct \(3\)-homogeneous Latin bitrades.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2103.02153</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-03
issn 2331-8422
language eng
recordid cdi_arxiv_primary_2103_02153
source arXiv.org; Free E- Journals
subjects Fields (mathematics)
Mathematics - Combinatorics
Mathematics - Rings and Algebras
Permutations
Polynomials
Upper bounds
title Degree of Orthomorphism Polynomials over Finite Fields
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T19%3A56%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Degree%20of%20Orthomorphism%20Polynomials%20over%20Finite%20Fields&rft.jtitle=arXiv.org&rft.au=Allsop,%20Jack&rft.date=2021-03-03&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2103.02153&rft_dat=%3Cproquest_arxiv%3E2496731470%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2496731470&rft_id=info:pmid/&rfr_iscdi=true