{"title":"偶特征有限域上形式为x+γTrqq3(h(x))的置换多项式的新构造","authors":"Sha Jiang, Kangquan Li, Longjiang Qu","doi":"10.1016/j.ffa.2025.102694","DOIUrl":null,"url":null,"abstract":"<div><div>Permutation polynomials over finite fields have applications in many areas of mathematics and engineering. Particularly, permutation polynomials of the form <span><math><mi>x</mi><mo>+</mo><mi>γ</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> have been studied for a long time. In this paper, we further investigate permutation polynomials of the form <span><math><mi>x</mi><mo>+</mo><mi>γ</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> over finite fields with even characteristic. For one thing, by choosing functions <span><math><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo></math></span> with a low <em>q</em>-degree, we propose four classes of permutation polynomials of the form <span><math><mi>x</mi><mo>+</mo><mi>γ</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msub></math></span>. For the other thing, we give seven classes of permutations of the form <span><math><mi>x</mi><mo>+</mo><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> with binomials <span><math><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msub></math></span>. Finally, we also show that the permutation polynomials constructed in this paper are not quasi-multiplicative equivalent to the known permutation polynomials.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"109 ","pages":"Article 102694"},"PeriodicalIF":1.2000,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"New constructions of permutation polynomials of the form x+γTrqq3(h(x)) over finite fields with even characteristic\",\"authors\":\"Sha Jiang, Kangquan Li, Longjiang Qu\",\"doi\":\"10.1016/j.ffa.2025.102694\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Permutation polynomials over finite fields have applications in many areas of mathematics and engineering. Particularly, permutation polynomials of the form <span><math><mi>x</mi><mo>+</mo><mi>γ</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mi>n</mi></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> have been studied for a long time. In this paper, we further investigate permutation polynomials of the form <span><math><mi>x</mi><mo>+</mo><mi>γ</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> over finite fields with even characteristic. For one thing, by choosing functions <span><math><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo></math></span> with a low <em>q</em>-degree, we propose four classes of permutation polynomials of the form <span><math><mi>x</mi><mo>+</mo><mi>γ</mi><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msub></math></span>. For the other thing, we give seven classes of permutations of the form <span><math><mi>x</mi><mo>+</mo><msubsup><mrow><mi>Tr</mi></mrow><mrow><mi>q</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msubsup><mo>(</mo><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo><mo>)</mo></math></span> with binomials <span><math><mi>h</mi><mo>(</mo><mi>x</mi><mo>)</mo></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><msup><mrow><mi>q</mi></mrow><mrow><mn>3</mn></mrow></msup></mrow></msub></math></span>. Finally, we also show that the permutation polynomials constructed in this paper are not quasi-multiplicative equivalent to the known permutation polynomials.</div></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"109 \",\"pages\":\"Article 102694\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2025-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Finite Fields and Their Applications\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1071579725001248\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Finite Fields and Their Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1071579725001248","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
New constructions of permutation polynomials of the form x+γTrqq3(h(x)) over finite fields with even characteristic
Permutation polynomials over finite fields have applications in many areas of mathematics and engineering. Particularly, permutation polynomials of the form have been studied for a long time. In this paper, we further investigate permutation polynomials of the form over finite fields with even characteristic. For one thing, by choosing functions with a low q-degree, we propose four classes of permutation polynomials of the form over . For the other thing, we give seven classes of permutations of the form with binomials over . Finally, we also show that the permutation polynomials constructed in this paper are not quasi-multiplicative equivalent to the known permutation polynomials.
期刊介绍:
Finite Fields and Their Applications is a peer-reviewed technical journal publishing papers in finite field theory as well as in applications of finite fields. As a result of applications in a wide variety of areas, finite fields are increasingly important in several areas of mathematics, including linear and abstract algebra, number theory and algebraic geometry, as well as in computer science, statistics, information theory, and engineering.
For cohesion, and because so many applications rely on various theoretical properties of finite fields, it is essential that there be a core of high-quality papers on theoretical aspects. In addition, since much of the vitality of the area comes from computational problems, the journal publishes papers on computational aspects of finite fields as well as on algorithms and complexity of finite field-related methods.
The journal also publishes papers in various applications including, but not limited to, algebraic coding theory, cryptology, combinatorial design theory, pseudorandom number generation, and linear recurring sequences. There are other areas of application to be included, but the important point is that finite fields play a nontrivial role in the theory, application, or algorithm.