有限域上 Hayes 等价类中随机多项式零点数的渐近分布

IF 1.2 3区 数学 Q1 MATHEMATICS
Zhicheng Gao
{"title":"有限域上 Hayes 等价类中随机多项式零点数的渐近分布","authors":"Zhicheng Gao","doi":"10.1016/j.ffa.2024.102524","DOIUrl":null,"url":null,"abstract":"<div><div>Hayes equivalence is defined on monic polynomials over a finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial <em>Q</em>. We study the distribution of the number of zeros in a random polynomial over finite fields in a given Hayes equivalence class. It is well known that the number of distinct zeros of a random polynomial over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> is asymptotically Poisson with mean 1. We show that this is also true for random polynomials in any given Hayes equivalence class. Asymptotic formulas are also given for the number of such polynomials when the degree of such polynomials is proportional to <em>q</em> and the degree of <em>Q</em> and the number of prescribed leading coefficients are bounded by <span><math><msqrt><mrow><mi>q</mi></mrow></msqrt></math></span>. When <span><math><mi>Q</mi><mo>=</mo><mn>1</mn></math></span>, the problem is equivalent to the study of the distance distribution in Reed-Solomon codes. Our asymptotic formulas extend some earlier results and imply that all words for a large family of Reed-Solomon codes are ordinary, which further supports the well-known <em>Deep-Hole</em> Conjecture.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"101 ","pages":"Article 102524"},"PeriodicalIF":1.2000,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field\",\"authors\":\"Zhicheng Gao\",\"doi\":\"10.1016/j.ffa.2024.102524\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Hayes equivalence is defined on monic polynomials over a finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial <em>Q</em>. We study the distribution of the number of zeros in a random polynomial over finite fields in a given Hayes equivalence class. It is well known that the number of distinct zeros of a random polynomial over <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span> is asymptotically Poisson with mean 1. We show that this is also true for random polynomials in any given Hayes equivalence class. Asymptotic formulas are also given for the number of such polynomials when the degree of such polynomials is proportional to <em>q</em> and the degree of <em>Q</em> and the number of prescribed leading coefficients are bounded by <span><math><msqrt><mrow><mi>q</mi></mrow></msqrt></math></span>. When <span><math><mi>Q</mi><mo>=</mo><mn>1</mn></math></span>, the problem is equivalent to the study of the distance distribution in Reed-Solomon codes. Our asymptotic formulas extend some earlier results and imply that all words for a large family of Reed-Solomon codes are ordinary, which further supports the well-known <em>Deep-Hole</em> Conjecture.</div></div>\",\"PeriodicalId\":50446,\"journal\":{\"name\":\"Finite Fields and Their Applications\",\"volume\":\"101 \",\"pages\":\"Article 102524\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2024-11-06\",\"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/S1071579724001631\",\"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/S1071579724001631","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

摘要

在有限域 Fq 上的单项式多项式上,海斯等价性是根据规定的前导系数和残差类 modulo 给定的单项式多项式 Q 定义的。众所周知,Fq 上随机多项式的独特零点数是渐近泊松分布,均值为 1。当此类多项式的度数与 q 成正比,且 Q 的度数和规定的前导系数数以 q 为界时,我们还给出了此类多项式数量的渐近公式。当 Q=1 时,问题等同于研究里德-所罗门码中的距离分布。我们的渐近公式扩展了之前的一些结果,并暗示一大系列里德-所罗门码的所有字都是普通的,这进一步支持了著名的深洞猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field
Hayes equivalence is defined on monic polynomials over a finite field Fq in terms of the prescribed leading coefficients and the residue classes modulo a given monic polynomial Q. We study the distribution of the number of zeros in a random polynomial over finite fields in a given Hayes equivalence class. It is well known that the number of distinct zeros of a random polynomial over Fq is asymptotically Poisson with mean 1. We show that this is also true for random polynomials in any given Hayes equivalence class. Asymptotic formulas are also given for the number of such polynomials when the degree of such polynomials is proportional to q and the degree of Q and the number of prescribed leading coefficients are bounded by q. When Q=1, the problem is equivalent to the study of the distance distribution in Reed-Solomon codes. Our asymptotic formulas extend some earlier results and imply that all words for a large family of Reed-Solomon codes are ordinary, which further supports the well-known Deep-Hole Conjecture.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信