English
Related papers

Related papers: On $r$-primitive $k$-normal polynomials with two p…

200 papers

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…

Number Theory · Mathematics 2021-05-18 Richard P. Brent , Paul Zimmermann

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

Algebraic Geometry · Mathematics 2009-06-25 Gabriela Jeronimo , Daniel Perrucci

Normal bases in finite fields constitute a vast topic of large theoretical and practical interest. Recently, $k$-normal elements were introduced as a natural extension of normal elements. The existence and the number of $k$-normal elements…

Number Theory · Mathematics 2022-03-16 Simran Tinani , Joachim Rosenthal

Let $\mathcal R$ be a principal ideal domain and $\mathcal K = {\rm quot}(\mathcal R)$. Assume that $P_1,\ldots P_n\in \mathcal K[X]$ are polynomials which take $\mathcal R$ to $\mathcal R$, and $P$ is their product. If the $P_i$ satisfy…

Number Theory · Mathematics 2022-09-09 Michaël Bensimhoun

Let $q=p^k$ be a prime power, let $\mathbb{F}_q$ be a finite field and let $n\geq2$ be an integer. This note investigates the existence small primitive normal elements in finite field extensions $\mathbb{F}_{q^n}$. It is shown that a small…

General Mathematics · Mathematics 2026-01-06 N. A. Carella

Let $z\ne \pm1,w^2$ be a fixed integer, and let $f(t)\ne g(t)^2$ be a fixed polynomial over the integers. It is shown that the subset of primes $p\geq 2$ such that $z$ and $f(z)$ is a pair of simultaneous primitive roots modulo $p$ has…

General Mathematics · Mathematics 2022-04-06 N. A. Carella

We discuss the problem of constructing a small subset of a finite field containing primitive elements of the field. Given a finite field, $\mathbb{F}_{q^n}$, small $q$ and large $n$, we show that the set of all low degree polynomials…

Number Theory · Mathematics 2014-12-24 Abhishek Bhowmick , Thái Hoàng Lê

Let $K$ be a number field. Given a polynomial $f(x)\in K[x]$ of degree $d\ge 2$, it is conjectured that the number of preperiodic points of $f$ is bounded by a uniform bound that depends only on $d$ and $[K:\mathbb Q]$. However, the only…

Number Theory · Mathematics 2021-05-11 Mohammad Sadek

Let GF(q), q=p^r, be a finite field with a primitive element g. In this paper we use exponential sums and Jacobi sums to compute the number of the irreducible polynomials of degree m over GF(q) with trace fixed and norm restricted to a…

Number Theory · Mathematics 2007-10-16 K. Kononen , M. Moisio , M. Rinta-aho , K. Vaananen

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…

Number Theory · Mathematics 2018-05-08 Theodoulos Garefalakis , Giorgos Kapetanakis

The $n^{th}$ cyclotomic polynomial $\Phi_n(x)$ is the minimal polynomial of an $n^{th}$ primitive root of unity. Its coefficients are the subject of intensive study and some formulas are known for them. Here we are interested in formulas…

Number Theory · Mathematics 2018-08-23 Andrés Herrera-Poyatos , Pieter Moree

In this paper, a computationally simple and explicit method of constructing recursive sequence of primitive polynomials of degree $n2^k (k = 1, 2, 3,\ldots)$ over $\mathbb{F}_{q}$ is given.

Commutative Algebra · Mathematics 2019-07-25 Mahmood Alizadeh

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

We say a natural number~$n$ is abundant if $\sigma(n)>2n$, where $\sigma(n)$ denotes the sum of the divisors of~$n$. The aliquot parts of~$n$ are those divisors less than~$n$, and we say that an abundant number~$n$ is pseudoperfect if there…

Number Theory · Mathematics 2015-04-13 Douglas E. Iannucci

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

Number Theory · Mathematics 2024-09-09 Jonathan W. Bober , Lara Du , Dan Fretwell , Gene S. Kopp , Trevor D. Wooley

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

Number Theory · Mathematics 2016-01-27 Junsoo Ha

A cyclotomic polynomial \Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we…

Number Theory · Mathematics 2012-07-30 Yves Gallot , Pieter Moree , Robert Wilms

Given a global field K and a polynomial f defined over K of degree at least two, Morton and Silverman conjectured in 1994 that the number of K-rational preperiodic points of f is bounded in terms of only the degree of K and the degree of f.…

Number Theory · Mathematics 2007-05-23 Robert L. Benedetto

Let $k \geq 2$ be an integer and $\mathbb F_q$ be a finite field with $q$ elements. We prove several results on the distribution in short intervals of polynomials in $\mathbb F_q[x]$ that are not divisible by the $k$th power of any…

Number Theory · Mathematics 2023-10-05 Angel Kumchev , Nathan McNew , Ariana Park

Given any fixed integer $q\ge 2$, a $q$-monomial is of the format $\displaystyle x^{s_1}_{i_1}x^{s_2}_{i_2}...x_{i_t}^{s_t}$ such that $1\le s_j \le q-1$, $1\le j \le t$. $q$-monomials are natural generalizations of multilinear monomials.…

Computational Complexity · Computer Science 2013-08-14 Shenshi Chen , Yaqing Chen , Quanhai Yang