N. A. Carella
The previous paper [4] proved the existence of primitive polynomials and primitive normal polynomials of degree n with k prescribed coefficients in the finite field GF(q) for all sufficiently large q. This paper presents a loger versions of the result on primitve normal polynomials.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We present computational results which strongly support a conjecture of Morgan and Mullen (1996), which states that for every extension $E/F$ of Galois fields there exists a primitive element of $E$ which is completely normal over $F$.
A primitive completely normal element for an extension $\mathbb{F}_{q^n}/\mathbb{F}_{q}$ of Galois fields is a generator of the multiplicative group of $\mathbb{F}_{q^n}$, which simultaneously is normal over every intermediate field of that extension. We are going to prove that such a generator exists when $\mathbb{F}_{q^n}/\mathbb{F}_{q}$ is an 'exceptional' regular extension. In combination with [6] our investigations altogether settle the existence of primitive completely normal bases for any regular extension. An important feature of the class of regular extensions is that they comprise ev…
In this paper, we obtain analogues of Zsigmondy's theorem and the primitive divisor results for the Lucas and Lehmer sequences in polynomial rings of several variables.
We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which does not use the theory of linear recurrences.
Proof of a Conjecture on Primitive Quartic Polynomials over Finite Fields
针对有限域上本原四次多项式的猜想，本文在q足够大时，借助Fu和Wan的定理，通过AI辅助完成了证明。
$r$-primitive $k$-normal polynomials over finite fields with last two coefficients prescribed
本文研究有限域上最后两个系数给定的r-本原k-正规多项式的存在性，证明了其存在的充分条件，并计算了m≥7时3-本原1-正规多项式的所有例外对(q,m)。
We demonstrate, using character sum arguments, the existence of primitive polynomials of degree n over a finite field GF(q) with the coefficients for x^(n-1), x^(n-2), and x^(n-3) prescribed, so long as char(GF(q)) is at least 5 and n is at least 9. The cases n=7, 8 are also considered.
The Optimal Coefficients-Based Criterion for Primitive Quadratic Polynomials over Finite Fields
本文证实Vega关于Lucas序列首零项决定二项式阶与多项式阶的猜想，分类Vega系数判据$b^2\neq2c$成立的有限域，还建立满足$q+1=2^m\pi$的有限域上本原二次多项式的统一系数判据。
Normal and primitive normal elements with prescribed traces in intermediate extensions of finite fields
本文研究有限域中间扩张中具有给定迹的范数及原始范数元素，完整刻画了范数情形下的存在条件并给出显式计数，对原始范数情形提供了渐近结果。
Using a Zariski topology associated to a finite field extensions, we give new proofs and generalize the primitive and normal basis theorems.
Primitive values of quadratic polynomials in a finite field
本文证明当 $q>211$ 时，有限域 $\mathbb{F}_q$ 中任意判别式非零的二次多项式都能在某个本原根处取到本原值。
Necessary and sufficient conditions on the order of a finite field $\mathbb{F}_q$ for the easy identification of primitive polynomials of degree 2
给出有限域阶 $q$ 的充要条件，使得形如 $x^2+bx+c$ 的不可约多项式（$b\neq0$，$c$ 为本原元）必为本原多项式，并由此得到一个新的无限族有限域，其中二次不可约多项式的本原性易于判定。
A famous conjecture of Artin states that there are infinitely many prime numbers for which a fixed integer $g$ is a primitive root, provided $g \neq -1$ and $g$ is not a perfect square. Thanks to work of Hooley, we know that this conjecture is true, conditional on the truth of the Generalized Riemann Hypothesis. Using a combination of Hooley's analysis and the techniques of Maynard-Tao used to prove the existence of bounded gaps between primes, Pollack has shown that (conditional on GRH) there are bounded gaps between primes with a prescribed primitive root. In the present article, we provide …
Monochromatic Sums and Products of Polynomials
本文证明了模式 $\{x,x+y,xy\}$ 在常数项为零且次数至少为一次的形式整数多项式空间上具有划分正则性及原始递归界，并为该模式在自然数上的划分正则性提供了首个原始递归界的新证明。
The celebrated Primitive Normal Basis Theorem states that for any $n\ge 2$ and any finite field $\mathbb F_q$, there exists an element $α\in \mathbb F_{q^n}$ that is simultaneously primitive and normal over $\mathbb F_q$. In this paper, we prove some variations of this result, completing the proof of a conjecture proposed by Anderson and Mullen (2014). Our results also imply the existence of elements of $\mathbb F_{q^n}$ with multiplicative order $(q^n-1)/2$ and prescribed trace over $\mathbb F_q$.
Let $(b_n) = (b_1, b_2, ...)$ be a sequence of integers. A primitive prime divisor of a term $b_k$ is a prime which divides $b_k$ but does not divide any of the previous terms of the sequence. A zero orbit of a polynomial $f(z)$ is a sequence of integers $(c_n)$ where the $n$-th term is the $n$-th iterate of $f$ at 0. We consider primitive prime divisors of zero orbits of polynomials. In this note, we show that for integers $c$ and $d$, where $d > 1$ and $c \neq \pm 1$, every iterate in the zero orbit of $f(z) = z^d + c$ contains a primitive prime whenever zero has an infinite orbit. If $c = \…
Let $\mathbb{F}_q$ be the finite field of characteristic $p$ with $q$ elements and $\mathbb{F}_{q^n}$ its extension of degree $n$. We prove that there exists a primitive element of $\mathbb{F}_{q^n}$ that produces a completely normal basis of $\mathbb{F}_{q^n}$ over $\mathbb{F}_q$, provided that $n=p^{\ell}m$ with $(m,p)=1$ and $q>m$.
An element w of the extension E of degree n over the finite field F=GF(q) is called free over F if {w, w^q,...,w^{q^{n-1}}} is a (normal) basis of E/F. The Primitive Normal Basis Theorem, first established in full by Lenstra and Schoof (1987), asserts that for any such extension E/F, there exists an element w in E such that w is simultaneously primitive (i.e., generates the multiplicative group of E) and free over F. In this paper we prove the following strengthening of this theorem: aside from five specific extensions E/F, there exists an element w in E such that both w and w^{-1} are simulta…
Let $q$ be a prime power of a prime $p$, $n$ a positive integer and $\mathbb F_{q^n}$ the finite field with $q^n$ elements. The $k-$normal elements over finite fields were introduced and characterized by Huczynska et al (2013). Under the condition that $n$ is not divisible by $p$, they obtained an existence result on primitive $1-$normal elements of $\mathbb F_{q^n}$ over $\mathbb F_q$ for $q>2$. In this note, we extend their result to the excluded case $q=2$.
The evaluation of iterated primitives of powers of logarithms is expressed in closed form. The expressions contain polynomials with coefficients given in terms of the harmonic numbers and their generalizations. The logconcavity of these polynomials is established.
The Schur polynomials in all primitive $n$th roots of unity
本文证明了当 $n$ 至多含两个不同奇素因子时，所有本原 $n$ 次单位根中的 Schur 多项式取值为 $1$、$0$ 或 $-1$，推广了分圆多项式系数性质，并通过幺模向量系统概念完成证明。
Primitive Polynomials of the Form $g(x)+λ$ over Finite Fields: Non-Existence Results and Conjectures
本文研究有限域上形如 $f(x)=g(x)+λ$ 的本原多项式的存在性，构造反例证明相关猜想不成立，在特征不整除 $m$ 的条件下推导了该类本原多项式存在的充分条件。
For $q=3^r$ ($r>0$), denote by $\mathbb{F}_q$ the finite field of order $q$ and for a positive integer $m\geq2$, let $\mathbb{F}_{q^m}$ be its extension field of degree $m$. We establish a sufficient condition for existence of a primitive normal element $α$ such that $f(α)$ is a primitive element, where $f(x)= ax^2+bx+c$, with $a,b,c\in \mathbb{F}_{q^m}$ satisfying $b^2\neq ac$ in $\Fm$ except for at most 9 exceptional pairs $(q,m)$.
The Exact Enumeration of $4$-nomial and $5$-nomial Multiples of the Product of Primitive Polynomials over GF(2)
本文针对 GF(2) 上本原多项式乘积，精确计数其 4 项式与 5 项式倍式，并反驳既有猜想，为抗相关攻击的 LFSR 连接多项式选择提供依据。
An element $α\in \mathbb F_{q^n}$ is \emph{normal} if $\mathcal{B} = \{α, α^q, \ldots, α^{q^{n-1}}\}$ forms a basis of $\mathbb F_{q^n}$ as a vector space over $\mathbb F_{q}$; in this case, $\mathcal{B}$ is a normal basis of $\mathbb F_{q^n}$ over $\mathbb F_{q}$. The notion of $k$-normal elements was introduced in Huczynska et al (2013). Using the same notation as before, $α$ is $k$-normal if $\mathcal{B}$ spans a co-dimension $k$ subspace of $\mathbb F_{q^n}$. It can be shown that $1$-normal elements always exist in $\mathbb F_{q^n}$, and Huczynska et al (2013) show that elements that are s…
Primitive prime divisors play an important role in group theory and number theory. We study a certain number theoretic quantity, called $Φ^*_n(q)$, which is closely related to the cyclotomic polynomial $Φ_n(x)$ and to primitive prime divisors of $q^n-1$. Our definition of $Φ^*_n(q)$ is novel, and we prove it is equivalent to the definition given by Hering. Given positive constants $c$ and $k$, we give an algorithm for determining all pairs $(n,q)$ with $Φ^*_n(q)\le cn^k$. This algorithm is used to extend (and correct) a result of Hering which is useful for classifying certain families of subgr…
In 2013, Huczynska, Mullen, Panario and Thomson introduced the concept of $k$-normal elements: an element $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if the greatest common divisor of the polynomials $g_α(x)= αx^{n-1}+α^qx^{n-2}+\ldots +α^{q^{n-2}}x+α^{q^{n-1}}$ and $x^n-1$ in $\mathbb{F}_{q^n}[x]$ has degree $k$, generalizing the concept of normal elements (normal in the usual sense is $0$-normal). In this paper we discuss the existence of $r$-primitive, $k$-normal elements in $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}$, where an element $α\in \mathbb{F}_{q^n}^*$ is $r$-primitive i…
Primitive Divisors of Lucas Sequences in Polynomial Rings
本文研究多项式环中 Lucas 序列的本原除子，建立与经典正则 Lucas 序列相对应的结果，并纠正既有定理。
Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements, and let $m_1$ and $m_2$ be positive integers. Given polynomials $f_1(x), f_2(x) \in \mathbb{F}_q[x]$ with $\textrm{deg}(f_i(x)) \leq m_i$, for $i = 1, 2$, and such that the rational function $f_1(x)/f_2(x)$ belongs to a certain set which we define, we present a sufficient condition for the existence of a primitive element $α\in \mathbb{F}_{q^n}$, normal over $\mathbb{F}_q$, such that $f_1(α)/f_2(α)$ is also primitive.
E. Bach, following an idea of T. Itoh, has shown how to build a small set of numbers modulo a prime p such that at least one element of this set is a generator of $\pF{p}$\cite{Bach:1997:sppr,Itoh:2001:PPR}. E. Bach suggests also that at least half of his set should be generators. We show here that a slight variant of this set can indeed be made to contain a ratio of primitive roots as close to 1 as necessary. We thus derive several algorithms computing primitive roots correct with very high probability in polynomial time. In particular we present an asymptotically $O^{\sim}(\sqrt{\frac{1}ε}lo…
On $r$-primitive $k$-normal polynomials with two prescribed coefficients
本文研究了有限域上具有指定次数和两个给定系数的 $r$-本原 $k$-正规多项式的存在性，建立了充分条件并利用SageMath计算验证了特定参数下的存在情况与不确定对数量。
In this paper, we consider rational functions $f$ with some minor restrictions over the finite field $\mathbb{F}_{q^n},$ where $q=p^k$ for some prime $p$ and positive integer $k$. We establish a sufficient condition for the existence of a pair $(α,f(α))$ of primitive normal elements in $\mathbb{F}_{q^n}$ over $\mathbb{F}_{q}.$ Moreover, for $q=2^k$ and rational functions $f$ with quadratic numerators and denominators, we explicitly find that there are at most $55$ finite fields $\mathbb{F}_{q^n}$ in which such a pair $(α,f(α))$ of primitive normal elements may not exist.
The so called $k$-normal elements appear in the literature as a generalization of normal elements over finite fields. Recently, questions concerning the construction of $k$-normal elements and the existence of $k$-normal elements that are also primitive have attracted attention from many authors. In this paper we give alternative constructions of $k$-normal elements and, in particular, we obtain a sieve inequality for the existence of primitive, $k$-normal elements. As an application, we show the existence of primitive $k$-normal elements for a significant proportion of $k$'s in many field ext…
Given $m, n, q\in \mathbb{N}$ such that $q$ is a prime power and $m\geq 3$, $a\in \mathbb{F}_q$, we establish a sufficient condition for the existence of primitive pair $(α, f(α))$ in $\mathbb{F}_{q^m}$ such that $α$ is normal over $\mathbb{F}_q$ and $\text{Tr}_{\mathbb{F}_{q^m}/\mathbb{F}_q}(α^{-1})=a$, where $f(x)\in \mathbb{F}_{q^m}(x)$ is a rational function of degree sum $n$. Further, when $n=2$ and $q=5^k$ for some $k\in \mathbb{N}$, such a pair definitely exists for all $(q, m)$ apart from at most $20$ choices.
Primitive normal progressions in finite fields
本文研究有限域中所有项本原且至少一项正规的等差数列，通过筛法、分歧界和计算改进长度4的结果，并在长度5-10及≥53时获得新界。
Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements and $r$ be a positive divisor of $q^n-1$. An element $α\in \mathbb{F}_{q^n}^*$ is called $r$-primitive if its multiplicative order is $(q^n-1)/r$. Also, $α\in \mathbb{F}_{q^n}$ is $k$-normal over $\mathbb{F}_q$ if the greatest common divisor of the polynomials $g_α(x) = αx^{n-1}+ α^q x^{n-2} + \ldots + α^{q^{n-2}}x + α^{q^{n-1}}$ and $x^n-1$ in $\mathbb{F}_{q^n}[x]$ has degree $k$. These concepts generalize the ideas of primitive and normal elements, respectively. In this paper, we consider non-negative integers $m_1,m_2,k_1,k_2$, po…
Effective existence of primitive k-normal elements via affine spaces
本文研究了有限域上临界值$k=n/2$处本原$k$-正规元素的存在性，给出了此前未被研究的一般结果，并通过完整刻画$\mathbb{F}_{q^6}$中本原$3$-正规元素的存在性展示了该结果的强度。
Let $r$, $n$ be positive integers, $k$ be a non-negative integer and $q$ be any prime power such that $r\mid q^n-1.$ An element $α$ of the finite field $\mathbb{F}_{q^n}$ is called an {\it $r$-primitive} element, if its multiplicative order is $(q^n-1)/r$, and it is called a {\it $k$-normal} element over $\mathbb{F}_q$, if the greatest common divisor of the polynomials $m_α(x)=\sum_{i=1}^{n} α^{q^{i-1}}x^{n-i}$ and $x^n-1$ is of degree $k.$ In this article, we define the characteristic function for the set of $k$-normal elements, and with the help of this, we establish a sufficient condition f…
A set is primitive if no element of the set divides another. We consider primitive sets of monic polynomials over a finite field and find natural generalizations of many of the results known for primitive sets of integers. In particular we generalize a result of Besicovitch to show that there exist primitive sets in $\mathbb{F}_q[x]$ with upper density arbitrarily close to $\frac{q - 1}{q}$. Then, for a primitive set $A$, we consider the sum $\sum_{a \in A} \frac{1}{q^{°a}°a}$, the natural analogue in this setting of a sum considered by Erdős for primitive subsets of the integers, and show tha…
An element $α\in \mathbb{F}_{q^n}$ is normal over $\mathbb{F}_q$ if $\mathcal{B}=\{α, α^q, α^{q^2}, \cdots, α^{q^{n-1}}\}$ forms a basis of $\mathbb{F}_{q^n}$ as a vector space over $\mathbb{F}_q$. It is well known that $α\in \mathbb{F}_{q^n}$ is normal over $\mathbb{F}_q$ if and only if $g_α(x)=αx^{n-1}+α^q x^{n-2}+ \cdots + α^{q^{n-2}}x+α^{q^{n-1}}$ and $x^n-1$ are relatively prime over $\mathbb{F}_{q^n}$, that is, the degree of their greatest common divisor in $\mathbb{F}_{q^n}[x]$ is $0$. Using this equivalence, the notion of $k$-normal elements was introduced in Huczynska et al. ($2013$):…
D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An algorithm is described to find more impressive examples in the same spirit. Y. Gallot used it to establish the current record in which 206 is being replaced by 31082.
We consider primitive divisors of terms of integer sequences defined by quadratic polynomials. Apart from some small counterexamples, when a term has a primitive divisor, that primitive divisor is unique. It seems likely that the number of terms with a primitive divisor has a natural density. We discuss two heuristic arguments to suggest a value for that density, one using recent advances made about the distribution of roots of polynomial congruences.
Primitive normal Values of rational functions with one prescribed norm and trace over finite fields
本文研究有限域扩展中本原正规对的存在性，证明带指定本原范数与非零迹的有理函数值存在的充分条件，并界定少数潜在例外域。
Nowadays, the chaotic cryptosystems are gaining more attention due to their efficiency, the assurance of robustness and high sensitivity corresponding to initial conditions. In literature, on one hand there are many encryption algorithms that only guarantee security while on the other hand there are schemes based on chaotic systems that only promise the uncertainty. Due to these limitations, each of these approaches cannot adequately encounter the challenges of current scenario. Here we take a unified approach and propose an image encryption algorithm based on Lorenz chaotic system and primiti…
Primitive normal pairs of elements with one prescribed trace
本文研究有限域上具有指定迹的素元正规对的存在性，给出充分条件，并针对特定参数明确至多11个例外情形。
Let f(x) be a primitive irreducible polynomial with integer coefficients of degree greater than one. In 1964, Hooley showed that the sequence of normalized roots u/n, where f(u) = 0(n), ordered in the obvious way, is uniformly distributed modulo one. It is the goal of this paper to show that if f(x) and g(x) are a pair of primitive irreducible polynomials of degree greater than one, not necessarily distinct, then the sequence (u/n,v/n), with f(u) = 0(n) and g(v) = 0(n), ordered in the obvious way, is uniformly distributed modulo one in the unit torus.
We find analogues of the primitive divisor results of Zsigmondy, Bang, Bilu-Hanrot-Voutier, and Carmichael in polynomial rings, following the methods of Carmichael.
In this paper we prove an explicit formula for the arithmetic intersection number (CM(K).G1)_{\ell} on the Siegel moduli space of abelian surfaces, generalizing the work of Bruinier-Yang and Yang. These intersection numbers allow one to compute the denominators of Igusa class polynomials, which has important applications to the construction of genus 2 curves for use in cryptography. Bruinier and Yang conjectured a formula for intersection numbers on an arithmetic Hilbert modular surface, and as a consequence obtained a conjectural formula for the intersection number (CM(K).G1)_{\ell} under str…
Primitive Fourier Coefficients of Hermitian Klingen-Eisenstein Series
本文确定了CM扩张上Hermitian Klingen-Eisenstein级数的本原Fourier系数，通过拉回公式将其表示为Siegel Eisenstein级数系数与Petersson内积的乘积，并在假设下证明了$p$-整性。
Primitive normal pairs with prescribed traces over finite fields
本文研究有限域上具有两个指定迹的本原正规对存在性，给出充分条件，并针对特定参数情形确定了至多12个可能不存在的域。
A primitive normal pair in a finite field with prescribed traces and norms
本文研究了有限域中具有指定迹和范数的本原正规对的存在性问题，构造了保证多项式生成的本原正规对存在的充分条件，并证明了特定参数下仅有4种可能例外。
In this paper we investigate Diophantine equations of the form $T^2=G(\overline{X}),\; \overline{X}=(X_{1},\ldots,X_{m})$, where $m=3$ or $m=4$ and $G$ is specific homogenous quintic form. First, we prove that if $F(x,y,z)=x^2+y^2+az^2+bxy+cyz+dxz\in\Z[x,y,z]$ and $(b-2,4a-d^2,d)\neq (0,0,0)$, then the Diophantine equation $t^2=nxyzF(x,y,z)$ has solution in polynomials $x, y, z, t$ with integer coefficients, without polynomial common factor of positive degree. In case $a=d=0, b=2$ we prove that there are infinitely many primitive integer solutions of the Diophantine equation under consideratio…
We consider the family of polynomials $f_{d,c}(x)=x^d+c$ over the rational field $\Q$. Fixing integers $d, n\ge 2$, we show that the density of primes that can appear as primitive prime divisors of $f_{d,c}^n(0)$ for some $c\in\Q$ is positive. In fact, under certain assumptions, we explicitly calculate the latter density when $d=2$. Furthermore, fixing $d,n\ge 2$, we show that for a given integer $N>0$, there is $c\in \Q$ such that $\f^n(0)$ has at least $N$ primitive prime divisors each of which is appearing up to any predetermined power. This shows that there is no uniform upper bound on the…
Primitive Quadratic Polynomials in Additive Coset Families
该研究针对奇素数幂\textit{q}>204931的情况，结合特征和估计、改进素数筛法及精确有限计算，证明了Gow–McGuire关于本原二次多项式的猜想3，同时也证明了该范围内的猜想1和2。
In this paper we generalize the results of Sharma, Awasthi and Gupta (see \cite{SAG}). We work over a field of any characteristic with $q = p^k$ elements and we give a sufficient condition for the existence of a primitive element $α\in \mathbb{F}_{p^k}$ such that $f(α)$ is also primitive in $\mathbb{F}_{p^k}$, where $f(x) \in \mathbb{F}_{p^k}(x)$ is a quotient of polynomials with some restrictions. We explicitly determine the values of $k$ for which such a pair exists for $p=2,3,5$ and $7$.
Existence of primitive normal pairs over finite fields with prescribed subtrace
本文研究有限域上具有指定子迹的原始正规对的存在性，证明了在特定条件下（$m=2$，$n\geq 6$，$q=7^k$）除至多11种例外情况外，这样的对必然存在。
On existence of primitive normal elements of rational form over finite fields of even characteristic
本文研究偶数特征有限域上形如 $f(x)=\frac{ax^2+bx+c}{dx+e}$ 的有理函数所诱导的本原正规对的存在性，建立了充分条件并给出例外情形列表。
Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all Mersenne exponents $r = \pm 3 \bmod 8$ in the range $5 < r < 10^7$, although there is no irreducible trinomial of degree $r$. We also give trinomials with a primitive factor of degree $r = 2^k$ for $3 \le k \le 12$. These trinomials enable efficient representations of the finite field ${\rm GF}(2^r)$. We show how trinomials with large primitive factors can be used…
A polynomial analogue of Berggren's theorem on Pythagorean triples
该研究在特征≠2的域上的一元多项式环中建立了Berggren定理的多项式类比，并由此推导出多项式环上毕达哥拉斯二次型对应正交群的若干结构定理。
This article addresses the existence of $\Q$-rational periodic points for morphisms of projective space. In particular, we construct an infinitely family of morphisms on $¶^N$ where each component is a degree 2 homogeneous form in $N+1$ variables which has a $\Q$-periodic point of primitive period $\frac{(N+1)(N+2)}{2} + \lfloor \frac{N-1}{2}\rfloor$. This result is then used to show that for $N$ large enough there exists morphisms of $¶^N$ with $\Q$-rational periodic points with primitive period larger that $c(k)N^k$ for any $k$ and some constant $c(k)$.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。