Asymptotic distribution of the number of zeros in random polynomials in a given equivalence class over a finite field
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2022
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866910288607969280 |
|---|---|
| author | Gao, Zhicheng |
| author_facet | Gao, Zhicheng |
| contents | 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 $\sqrt{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 {\em Deep-Hole} Conjecture. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2203_06729 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Asymptotic distribution of the number of zeros in random polynomials in a given equivalence class over a finite field Gao, Zhicheng Combinatorics 11T06 11T55 11T23 12Y05 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 $\sqrt{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 {\em Deep-Hole} Conjecture. |
| title | Asymptotic distribution of the number of zeros in random polynomials in a given equivalence class over a finite field |
| topic | Combinatorics 11T06 11T55 11T23 12Y05 |
| url | https://arxiv.org/abs/2203.06729 |