Finite Fields and Their Applications最新文献

英文中文

Repeated-root constacyclic codes of length kslmpn over finite fields 有限域上长度为 kslmpn 的重复根常环码

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-11-14 DOI: 10.1016/j.ffa.2024.102542

Qi Zhang , Weiqiong Wang , Shuyu Luo , Yue Li

For different odd primes k, l, p, and positive integers s, m, n, the polynomial

x^{k^{s} l^{m} p^{n}} - λ

F_{q} [x]

is explicitly factorized, where p is the characteristic of

F_{q}

λ \in F_{q}^{⁎}

. All repeated-root constacyclic codes and their dual codes of length

k^{s} l^{m} p^{n}

over

F_{q}

are characterized. In addition, the characterization and enumeration of all linear complementary dual (LCD) cyclic and negacyclic codes of length

k^{s} l^{m} p^{n}

over

F_{q}

are obtained.

对于不同的奇数素数 k、l、p 和正整数 s、m、n，Fq[x] 中的多项式 xkslmpn-λ 被显式因式分解，其中 p 是 Fq 的特征，λ∈Fq⁎。表征了 Fq 上长度为 kslmpn 的所有重复根常环码及其对偶码。此外，还得到了 Fq 上所有长度为 kslmpn 的线性互补对偶（LCD）循环码和负循环码的特征和枚举。

引用次数: 0

Complete description of measures corresponding to Abelian varieties over finite fields 有限域上阿贝尔变种对应度量的完整描述

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-11-14 DOI: 10.1016/j.ffa.2024.102543

Nikolai S. Nadirashvili , Michael A. Tsfasman

We study probability measures corresponding to families of abelian varieties over a finite field. These measures play an important role in the Tsfasman–Vlăduţ theory of asymptotic zeta-functions defining completely the limit zeta-function of the family. J.-P. Serre, using results of R.M. Robinson on conjugate algebraic integers, described the possible set of measures than can correspond to families of abelian varieties over a finite field. The problem whether all such measures actually occur was left open. Moreover, Serre supposed that not all such measures correspond to abelian varieties (for example, the Lebesgue measure on a segment). Here we settle Serre's problem proving that Serre conditions are sufficient, and thus describe completely the set of measures corresponding to abelian varieties.

我们研究与有限域上的无性变体族相对应的概率度量。这些度量在完全定义族的极限zeta函数的渐近zeta函数的Tsfasman-Vlăduţ理论中起着重要作用。J.-P.塞雷（J.-P. Serre）利用罗宾逊（R.M. Robinson）关于共轭代数整数的结果，描述了与有限域上无性方程族相对应的可能度量集合。至于是否所有这些度量都会出现，这个问题还没有解决。此外，塞尔认为并非所有这些度量都对应于无比方体（例如，线段上的勒贝格度量）。在这里，我们解决了塞雷的问题，证明塞雷条件是充分的，从而完整地描述了对应于无比方体的度量集合。

引用次数: 0

Self-dual 2-quasi negacyclic codes over finite fields 有限域上的自偶 2-quasi 负环码

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-11-07 DOI: 10.1016/j.ffa.2024.102541

Yun Fan, Yue Leng

In this paper, we investigate the existence and asymptotic properties of self-dual 2-quasi negacyclic codes of length 2n over a finite field of cardinality q. When n is odd, we show that the q-ary self-dual 2-quasi negacyclic codes exist if and only if

q ≢ - 1 (\mod 4)

. When n is even, we prove that the q-ary self-dual 2-quasi negacyclic codes always exist. By using the technique introduced in this paper, we prove that q-ary self-dual 2-quasi negacyclic codes are asymptotically good.

当 n 为奇数时，我们证明了当且仅当 q≢-1(mod4)时 q-ary 自双 2-quasi 负环码存在。当 n 为偶数时，我们证明 q-ary 自双 2-quasi 负环码总是存在的。利用本文介绍的技术，我们证明了 qary 自双 2-quasi 负环码是渐近良好的。

引用次数: 0

Intersecting families of polynomials over finite fields 有限域上多项式的相交族

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-11-07 DOI: 10.1016/j.ffa.2024.102540

Nika Salia , Dávid Tóth

This paper demonstrates an analog of the Erdős–Ko–Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins.

A k-uniform family of subsets of a set of size n is ℓ-intersecting if any two subsets in the family intersect in at least ℓ elements. The study of such intersecting families is a core subject of extremal set theory, tracing its roots to the seminal 1961 Erdős–Ko–Rado theorem, which establishes a sharp upper bound on the size of these families. Here, we extend the Erdős–Ko–Rado theorem to polynomial rings over finite fields.

Specifically, we determine the largest possible size of a family of monic polynomials, each of degree n, over a finite field

F_{q}

, where every pair of polynomials in the family shares a common factor of degree at least ℓ. We prove that the upper bound for this size is

q^{n - ℓ}

and characterize all extremal families that achieve this maximum size.

Extending to triple-intersecting families, where every triplet of polynomials shares a common factor of degree at least ℓ, we prove that only trivial families achieve the corresponding upper bound. Moreover, by relaxing the conditions to include polynomials of degree at most n, we affirm that only trivial families achieve the corresponding upper bound.

本文证明了厄尔多-柯-拉多定理在有限域上多项式环中的类比，肯定地回答了汤普金斯（C. Tompkins）的猜想。如果一个大小为 n 的集合的 k 个均匀子集族中的任意两个子集至少有 ℓ 个元素相交，那么这个子集族就是 ℓ 相交族。对这种相交族的研究是极值集合理论的核心课题，其根源可追溯到 1961 年的开创性厄多-柯-拉多定理，该定理为这些族的大小确定了一个尖锐的上限。在这里，我们将厄尔多斯-柯-拉多定理扩展到有限域上的多项式环。具体地说，我们确定了有限域 Fq 上每个度数为 n 的单项式族的最大可能规模，其中族中的每对多项式都有一个度数至少为 ℓ 的公因子。我们证明了这一大小的上界是 qn-ℓ，并描述了达到这一最大大小的所有极值族的特征。扩展到三重相交族，其中每个三重多项式共享至少 ℓ 阶的公因子，我们证明只有三重族达到了相应的上界。此外，通过将条件放宽到包括阶数至多为 n 的多项式，我们肯定只有三交系达到了相应的上限。

{"title":"Intersecting families of polynomials over finite fields","authors":"Nika Salia , Dávid Tóth","doi":"10.1016/j.ffa.2024.102540","DOIUrl":"10.1016/j.ffa.2024.102540","url":null,"abstract":"<div><div>This paper demonstrates an analog of the Erdős–Ko–Rado theorem to polynomial rings over finite fields, affirmatively answering a conjecture of C. Tompkins.</div><div>A <em>k</em>-uniform family of subsets of a set of size <em>n</em> is <em>ℓ</em>-intersecting if any two subsets in the family intersect in at least <em>ℓ</em> elements. The study of such intersecting families is a core subject of extremal set theory, tracing its roots to the seminal 1961 Erdős–Ko–Rado theorem, which establishes a sharp upper bound on the size of these families. Here, we extend the Erdős–Ko–Rado theorem to polynomial rings over finite fields.</div><div>Specifically, we determine the largest possible size of a family of monic polynomials, each of degree <em>n</em>, over a finite field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>, where every pair of polynomials in the family shares a common factor of degree at least <em>ℓ</em>. We prove that the upper bound for this size is <span><math><msup><mrow><mi>q</mi></mrow><mrow><mi>n</mi><mo>−</mo><mi>ℓ</mi></mrow></msup></math></span> and characterize all extremal families that achieve this maximum size.</div><div>Extending to triple-intersecting families, where every triplet of polynomials shares a common factor of degree at least <em>ℓ</em>, we prove that only trivial families achieve the corresponding upper bound. Moreover, by relaxing the conditions to include polynomials of degree at most <em>n</em>, we affirm that only trivial families achieve the corresponding upper bound.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"101 ","pages":"Article 102540"},"PeriodicalIF":1.2,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142660192","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Partial difference sets with Denniston parameters in elementary abelian p-groups 初等无性 p 群中具有丹尼斯顿参数的部分差集

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-11-07 DOI: 10.1016/j.ffa.2024.102539

Jingjun Bao , Qing Xiang , Meng Zhao

<div><div>Denniston <span><span>[12]</span></span> constructed partial difference sets (PDS) with parameters <span><math><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mn>3</mn><mi>m</mi></mrow></msup><mo>,</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>,</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>+</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><mn>2</mn><mo>)</mo><mo>,</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>)</mo></math></span> in elementary abelian groups of order <span><math><msup><mrow><mn>2</mn></mrow><mrow><mn>3</mn><mi>m</mi></mrow></msup></math></span> for all <span><math><mi>m</mi><mo>≥</mo><mn>2</mn></math></span> and <span><math><mn>1</mn><mo>≤</mo><mi>r</mi><mo><</mo><mi>m</mi></math></span>. These PDS arise from maximal arcs in the Desarguesian projective planes PG<span><math><mo>(</mo><mn>2</mn><mo>,</mo><msup><mrow><mn>2</mn></mrow><mrow><mi>m</mi></mrow></msup><mo>)</mo></math></span>. Davis et al. <span><span>[10]</span></span> and also De Winter <span><span>[13]</span></span> presented constructions of PDS with Denniston parameters <span><math><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mn>3</mn><mi>m</mi></mrow></msup><mo>,</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><mn>1</mn><mo>)</mo><mo>,</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>+</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi><mo>+</mo><mi>r</mi></mrow></msup><mo>−</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>m</mi></mrow></msup><mo>+</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>)</mo><mo>(</mo><msup><mrow><mi>p</mi></mrow><mrow><mi>r</mi></mrow></msup><mo>−</mo><mn>2</mn><mo>)</mo><mo>,</mo><mo>(</mo><msup><mrow><mi>p</mi>

Denniston [12] 构建了参数为 (23m,(2m+r-2m+2r)(2m-1),2m-2r+(2m+r-2m+2r)(2r-2),(2m+r-2m+2r)(2r-1)) 的基本无边际群中阶数为 23m 的局部差集（PDS），对于所有 m≥2 且 1≤r<m 均适用。这些 PDS 源自 Desarguesian 投影平面 PG(2,2m) 中的最大弧。戴维斯等人 [10] 和德温特 [13] 提出了在所有 m≥2 和 r∈{1,m-1} 条件下，阶数为 p3m 的初等无邻群中具有丹尼斯顿参数 (p3m,(pm+r-pm+pr)(pm-1),pm-pr+(pm+r-pm+pr)(pr-2),(pm+r-pm+pr)(pr-1) 的 PDS 的构造，其中 p 是奇素数。Ball, Blokhuis 和 Mazzocca [1] 证明，对于任何奇素数幂 q，PG(2,qm) 中都不存在非奇数最大弧，因此 [10], [13] 中的构造尤其引人入胜。在本文中，我们证明了在所有 m≥2 和 1≤r<m 条件下，阶数为 q3m 的初等无邻群中存在具有丹尼斯顿参数 (q3m,(qm+r-qm+qr)(qm-1),qm-qr+(qm+r-qm+qr)(qr-2),(qm+r-qm+qr)(qr-1)) 的 PDS，其中 q 是任意素幂。

引用次数: 0

Asymptotic distributions of the number of zeros of random polynomials in Hayes equivalence class over a finite field 有限域上 Hayes 等价类中随机多项式零点数的渐近分布

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-11-06 DOI: 10.1016/j.ffa.2024.102524

Zhicheng Gao

Hayes equivalence is defined on monic polynomials over a finite field

F_{q}

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

F_{q}

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 Deep-Hole Conjecture.

在有限域 Fq 上的单项式多项式上，海斯等价性是根据规定的前导系数和残差类 modulo 给定的单项式多项式 Q 定义的。众所周知，Fq 上随机多项式的独特零点数是渐近泊松分布，均值为 1。当此类多项式的度数与 q 成正比，且 Q 的度数和规定的前导系数数以 q 为界时，我们还给出了此类多项式数量的渐近公式。当 Q=1 时，问题等同于研究里德-所罗门码中的距离分布。我们的渐近公式扩展了之前的一些结果，并暗示一大系列里德-所罗门码的所有字都是普通的，这进一步支持了著名的深洞猜想。

{"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":"10.1016/j.ffa.2024.102524","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.2,"publicationDate":"2024-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142594089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Quasi-polycyclic and skew quasi-polycyclic codes over Fq Fq 上的准多环码和偏斜准多环码

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-10-31 DOI: 10.1016/j.ffa.2024.102536

Tushar Bag, Daniel Panario

In this research, our focus is on investigating 1-generator right quasi-polycyclic (QPC) codes over fields. We provide a detailed description of how linear codes with substantial minimum distances can be constructed from QPC codes. We analyze dual QPC codes under various inner products and use them to construct quantum error-correcting codes. Furthermore, our research includes a dedicated section that delves into the area of skew quasi-polycyclic (SQPC) codes, investigating their properties and the role of generators in their construction. This section expands our study to encompass the intriguing area of SQPC codes, offering insights into the non-commutative version of QPC codes, their characteristics and generator structures. Our work deals with the structural properties of QPC, skew polycyclic and SQPC codes, shedding light on their potential for enhancing the field of coding theory.

在这项研究中，我们的重点是研究域上的单生成器右准多环（QPC）码。我们详细描述了如何从 QPC 码中构造出具有可观最小距离的线性码。我们分析了各种内积下的对偶 QPC 码，并用它们来构造量子纠错码。此外，我们的研究还包括一个专门章节，深入探讨偏斜准多环（SQPC）码领域，研究它们的特性以及生成器在其构造中的作用。本节将我们的研究扩展到 SQPC 码这一引人入胜的领域，深入探讨 QPC 码的非交换版本、它们的特性和生成器结构。我们的研究涉及 QPC 码、斜多环码和 SQPC 码的结构特性，揭示了它们在增强编码理论领域的潜力。

引用次数: 0

Self-orthogonal cyclic codes with good parameters 具有良好参数的自正交循环码

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-10-31 DOI: 10.1016/j.ffa.2024.102534

Jiayuan Zhang, Xiaoshan Kai, Ping Li

The construction of self-orthogonal codes is an interesting topic due to their wide applications in communication and cryptography. In this paper, we construct several families of self-orthogonal cyclic codes with length

n = \frac{q^{m} - 1}{λ}

, where

λ | q - 1

and

m \geq 3

is odd. It is proved that there exist q-ary self-orthogonal cyclic codes with parameters

[n, \frac{n - 1}{2}, \geq d]

for even prime power q, and

[n, \frac{n}{2} - 1, \geq d]

[n, \frac{n - 1}{2}, \geq d]

for odd prime power q, where d is significantly better than the square-root bound. These several families of self-orthogonal cyclic codes contain some optimal linear codes.

由于自正交码在通信和密码学中的广泛应用，构建自正交码是一个有趣的课题。本文构建了多个长度为 n=qm-1λ（其中 λ|q-1 且 m≥3 为奇数）的自正交循环码族。研究证明，对于偶素数 q，存在参数为 [n,n-12,≥d] 的 qary 自正交循环码；对于奇素数 q，存在参数为 [n,n2-1,≥d] 或 [n,n-12,≥d] 的 qary 自正交循环码，其中 d 明显优于平方根约束。这几个自正交循环码族包含一些最优线性码。

引用次数: 0

Linear codes from planar functions and related covering codes 来自平面函数的线性编码及相关覆盖编码

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-10-31 DOI: 10.1016/j.ffa.2024.102535

Yanan Wu, Yanbin Pan

Linear codes with few weights have wide applications in consumer electronics, data storage system and secret sharing. In this paper, by virtue of planar functions, several infinite families of l-weight linear codes over

F_{p}

are constructed, where l can be any positive integer and p is a prime number. The weight distributions of these codes are determined completely by utilizing certain approach on exponential sums. Experiments show that some (almost) optimal codes in small dimensions can be produced from our results. Moreover, the related covering codes are also investigated.

权重较小的线性编码在消费类电子产品、数据存储系统和秘密共享中有着广泛的应用。本文利用平面函数，构建了多个 Fp 上 l 权重线性编码的无穷族，其中 l 可以是任意正整数，p 是素数。这些编码的权重分布完全是通过利用指数和的某些方法确定的。实验表明，根据我们的结果可以生成一些（几乎）小维度的最优编码。此外，我们还研究了相关的覆盖码。

引用次数: 0

Improvements of the Hasse-Weil-Serre bound over global function fields 全局函数域上哈塞-韦尔-塞雷约束的改进

IF 1.2 3区数学 Q1 MATHEMATICS

Finite Fields and Their Applications

Pub Date : 2024-10-31 DOI: 10.1016/j.ffa.2024.102538

Jinjoo Yoo , Yoonjin Lee

We improve the Hasse-Weil-Serre bound over a global function field K with relatively large genus in terms of the ramification behavior of the finite places and the infinite places for

K / k

, where k is the rational function field

F_{q} (T)

. Furthermore, we improve the Hasse-Weil-Serre bound over a global function field K in terms of the defining equation of K. As an application of our main result, we apply our bound to some well-known extensions: Kummer extensions and elementary abelian p-extensions, where p is the characteristic of k. In fact, elementary abelian p-extensions include Artin-Schreier type extensions, Artin-Schreier extensions, and Suzuki function fields. Moreover, we present infinite families of global function fields for Kummer extensions, Artin-Schreier type extensions, and elementary abelian p-extensions but not Artin-Schreier type extensions, which meet our improved bound: our bound is a sharp bound in these families. We also compare our new bound with some known data given in manypoints.org, which is the database on the rational points of algebraic curves. This comparison shows a meaningful improvement of our results on the bound of the number of the rational places of K.

我们从 K/k 的有限位置和无限位置（k 为有理函数域 Fq(T)）的柱化行为出发，改进了具有相对大属的全局函数域 K 上的 Hasse-Weil-Serre 定界。此外，我们还根据 K 的定义方程改进了全局函数域 K 的哈塞-韦尔-塞雷约束：库默扩展和初等无边 p 扩展，其中 p 是 k 的特征。事实上，初等无边 p 扩展包括阿尔丁-施莱尔类型扩展、阿尔丁-施莱尔扩展和铃木函数域。此外，我们还提出了库默扩展、阿廷-施莱尔型扩展和初等常方差 p 扩展的全局函数场无穷族，但不包括阿廷-施莱尔型扩展，它们都符合我们的改进约束：在这些族中，我们的约束是一个尖锐的约束。我们还将我们的新约束与 manypoints.org 中给出的一些已知数据进行了比较，后者是关于代数曲线有理点的数据库。比较结果表明，我们对 K 的有理点数的界值进行了有意义的改进。

{"title":"Improvements of the Hasse-Weil-Serre bound over global function fields","authors":"Jinjoo Yoo , Yoonjin Lee","doi":"10.1016/j.ffa.2024.102538","DOIUrl":"10.1016/j.ffa.2024.102538","url":null,"abstract":"<div><div>We improve the Hasse-Weil-Serre bound over a global function field <em>K</em> with relatively large genus in terms of the ramification behavior of the finite places and the infinite places for <span><math><mi>K</mi><mo>/</mo><mi>k</mi></math></span>, where <em>k</em> is the rational function field <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub><mo>(</mo><mi>T</mi><mo>)</mo></math></span>. Furthermore, we improve the Hasse-Weil-Serre bound over a global function field <em>K</em> in terms of the defining equation of <em>K</em>. As an application of our main result, we apply our bound to some well-known extensions: <em>Kummer extensions</em> and <em>elementary abelian p-extensions</em>, where <em>p</em> is the characteristic of <em>k</em>. In fact, elementary abelian <em>p</em>-extensions include <em>Artin-Schreier type extensions</em>, <em>Artin-Schreier extensions</em>, and <em>Suzuki function fields</em>. Moreover, we present infinite families of global function fields for Kummer extensions, Artin-Schreier type extensions, and elementary abelian <em>p</em>-extensions but not Artin-Schreier type extensions, which meet our improved bound: our bound is a sharp bound in these families. We also compare our new bound with some known data given in <span><span>manypoints.org</span><svg><path></path></svg></span>, which is the database on the rational points of algebraic curves. This comparison shows a meaningful improvement of our results on the bound of the number of the rational places of <em>K</em>.</div></div>","PeriodicalId":50446,"journal":{"name":"Finite Fields and Their Applications","volume":"101 ","pages":"Article 102538"},"PeriodicalIF":1.2,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142561483","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Finite Fields and Their Applications

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀