English
Related papers

Related papers: Recursive construction of primitive polynomials ov…

200 papers

Some families of linear permutation polynomials of $\mathbb{F}_{q^{ms}}$ with coefficients in $\mathbb{F}_{q^{m}}$ are explicitly described (via conditions on their coefficients) as isomorphic images of classical subgroups of the general…

Representation Theory · Mathematics 2023-06-07 Elías Javier García Claro , Gustavo Terra Bastos

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

In this work we deduce explicit formulae for the elements of the matrices that represent the action of integro-differential operators over the coefficients of generalized Fourier series. Our formulae are obtained by performing operations on…

Numerical Analysis · Mathematics 2017-12-21 José M. A. Matos , Maria João Rodrigues , João Carrilho de Matos

Let $\mathbb{F}_q$ be the field with $q$ elements and of characteristic $p$. For $a\in\mathbb{F}_p$ consider the set \begin{equation*} S_a(n)=\{f\in\mathbb{F}_q[x]\mid\operatorname{deg}(f)=n,~f\text{ irreducible, monic and}…

Number Theory · Mathematics 2023-12-29 Max Schulz

For a finite field of odd cardinality $q$, we show that the sequence of iterates of $aX^2+c$, starting at $0$, always recurs after $O(q/\log\log q)$ steps. For $X^2+1$ the same is true for any starting value. We suggest that the traditional…

Number Theory · Mathematics 2017-01-18 D. R. Heath-Brown

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

Rings and Algebras · Mathematics 2014-09-04 Sophie Frisch

In this paper, we obtain several results on the permutational behavior of the reversed Dickson polynomial $D_{n,3}(1,x)$ of the fourth kind over the finite field ${\mathbb F}_{q}$. Particularly, we present the explicit evaluation of the…

Number Theory · Mathematics 2016-04-18 Kaimin Cheng , Shaofang Hong , Xiaoer Qin

Let $\Bbb F_q$ be the finite field with $q$ elements and let $p=\text{char}\,\Bbb F_q$. It was conjectured that for integers $e\ge 2$ and $1\le a\le pe-2$, the polynomial $X^{q-2}+X^{q^2-2}+\cdots+X^{q^a-2}$ is a permutation polynomial of…

Number Theory · Mathematics 2018-07-02 Wun-Seng Chou , Xiang-dong Hou

Let $\mathbb{F}_{q}$ be a finite field with $q$ elements and $\mathbb{F}_{q}[x]$ the ring of polynomials over $\mathbb{F}_{q}$. Let $l(x), k(x)$ be coprime polynomials in $\mathbb{F}_{q}[x]$ and $\Phi(k)$ the Euler function in…

Combinatorics · Mathematics 2020-02-21 Zhang Zihan , Han Dongchun

Let $\mathbb F_q$ be the finite field with $q$ elements, $f, g\in \mathbb F_q[x]$ be polynomials of degree at least one. This paper deals with the asymptotic growth of certain arithmetic functions associated to the factorization of the…

Number Theory · Mathematics 2019-08-06 Lucas Reis

We prove a new formula for the generating function of polynomials counting absolutely stable representations of quivers over finite fields. The case of irreducible representations is studied in more detail.

Representation Theory · Mathematics 2007-08-10 Sergey Mozgovoy , Markus Reineke

In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.

Number Theory · Mathematics 2024-07-25 Yue-Feng She , Hai-Liang Wu

Permutation polynomials over finite fields are an interesting and constantly active research subject of study for many years. They have important applications in areas of mathematics and engineering. In recent years, permutation binomials…

Number Theory · Mathematics 2022-05-02 Hua Guo , Shuo Wang , Hutao Song , Xiyong Zhang , Jianwei Liu

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

Information Theory · Computer Science 2024-12-03 Cunsheng Ding

We describe a straightforward method to generate a random prime q such that the multiplicative group GF(q)* also has a random large prime-order subgroup. The described algorithm also yields this order p as well as a p'th primitive root of…

Computational Complexity · Computer Science 2022-05-02 Pascal Giorgi , Bruno Grenet , Armelle Perret du Cray , Daniel S. Roche

We introduce a class of permutation polynomial over $\mathbb F_{q^n}$ that can be written in the form $\frac{L(x)}{x^{q+1}}$ or $\frac{L(x^{q+1})}x$ for some $q$-linear polynomial $L$ over $\mathbb F_{q^n}$. Specifically, we present those…

Number Theory · Mathematics 2024-03-19 Ruikai Chen , Sihem Mesnager

Let $p>3$ and consider a prime power $q=p^h$. We completely characterize permutation polynomials of $\mathbb{F}_{q^2}$ of the type $f_{a,b}(X) = X(1 + aX^{q(q-1)} + bX^{2(q-1)}) \in \mathbb{F}_{q^2}[X]$. In particular, using connections…

Combinatorics · Mathematics 2019-11-22 Daniele Bartoli , Marco Timpanella

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…

Number Theory · Mathematics 2013-05-28 G. Everest , S. Stevens , D. Tamsett , T. Ward

In this paper we deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the $Q$-transform…

Dynamical Systems · Mathematics 2016-05-17 Simone Ugolini

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

Number Theory · Mathematics 2017-01-30 D. R. Heath-Brown , Giacomo Micheli