On the stable polynomials of degrees 2,3,4

IF 1.2 3区 数学 Q1 MATHEMATICS Finite Fields and Their Applications Pub Date : 2024-08-08 DOI:10.1016/j.ffa.2024.102474
Tong Lin, Qiang Wang
{"title":"On the stable polynomials of degrees 2,3,4","authors":"Tong Lin,&nbsp;Qiang Wang","doi":"10.1016/j.ffa.2024.102474","DOIUrl":null,"url":null,"abstract":"<div><p>Let <em>q</em> be a prime power. For <span><math><mi>m</mi><mo>=</mo><mn>2</mn><mo>,</mo><mn>3</mn><mo>,</mo><mn>4</mn></math></span>, we construct stable polynomials of the form <span><math><msup><mrow><mi>b</mi></mrow><mrow><mi>m</mi><mo>−</mo><mn>1</mn></mrow></msup><msup><mrow><mo>(</mo><mi>x</mi><mo>+</mo><mi>a</mi><mo>)</mo></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><mi>c</mi><mo>(</mo><mi>x</mi><mo>+</mo><mi>a</mi><mo>)</mo><mo>+</mo><mi>d</mi></math></span> over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> by Capelli's lemma. Moreover, when <span><math><mi>m</mi><mo>=</mo><mn>2</mn></math></span> and <span><math><mi>q</mi><mo>≡</mo><mn>1</mn><mspace></mspace><mo>(</mo><mrow><mi>mod</mi></mrow><mspace></mspace><mn>4</mn><mo>)</mo></math></span>, we improve a lower bound for the number of stable quadratic polynomials over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> due to Goméz-Pérez and Nicolás <span><span>[4]</span></span>. When <span><math><mi>m</mi><mo>=</mo><mn>3</mn></math></span>, we prove Ahmadi and Monsef-Shokri's conjecture <span><span>[2]</span></span> that <span><math><msup><mrow><mi>x</mi></mrow><mrow><mn>3</mn></mrow></msup><mo>+</mo><msup><mrow><mi>x</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mn>1</mn></math></span> is stable over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>.</p></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"99 ","pages":"Article 102474"},"PeriodicalIF":1.2000,"publicationDate":"2024-08-08","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/S1071579724001138","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Let q be a prime power. For m=2,3,4, we construct stable polynomials of the form bm1(x+a)m+c(x+a)+d over Fq by Capelli's lemma. Moreover, when m=2 and q1(mod4), we improve a lower bound for the number of stable quadratic polynomials over Fq due to Goméz-Pérez and Nicolás [4]. When m=3, we prove Ahmadi and Monsef-Shokri's conjecture [2] that x3+x2+1 is stable over F2.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
关于 2、3、4 度的稳定多项式
设 q 为质幂。对于 m=2,3,4,我们通过卡佩利定理构造出 Fq 上 bm-1(x+a)m+c(x+a)+d形式的稳定多项式。此外,当 m=2 且 q≡1(mod4)时,我们改进了由 Goméz-Pérez 和 Nicolás [4] 提出的 Fq 上稳定二次多项式数量的下限。当 m=3 时,我们证明了 Ahmadi 和 Monsef-Shokri 的猜想 [2],即 x3+x2+1 在 F2 上是稳定的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.00
自引率
20.00%
发文量
133
审稿时长
6-12 weeks
期刊介绍: 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.
期刊最新文献
Complete description of measures corresponding to Abelian varieties over finite fields Repeated-root constacyclic codes of length kslmpn over finite fields Intersecting families of polynomials over finite fields Partial difference sets with Denniston parameters in elementary abelian p-groups Self-dual 2-quasi negacyclic codes over finite fields
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1