Searcharxiv⌕ Search

arXiv subjects

Lucas Reis

Publications and source records attributed to Lucas Reis.

At least 37 records · Page 2Linked to original sources

Counting solutions of special linear equations over finite fields

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $d_1, \ldots, d_k$ be positive integers. In this note we explore the number of solutions $(z_1, \ldots, z_k)\in\overline{\mathbb F}_q^k$ of the equation \begin{equation*}L_1(x_1)+\cdots+L_k(x_k)=b,\end{equation*} with the restrictions $z_i\in \mathbb F_{q^{d_i}}$, where each $L_i(x)$ is a non zero polynomial of the form $\sum_{j=0}^{m_i}a_{ij}x^{q^j}\in \mathbb F_q[x]$ and $b\in \overline{\mathbb F}_q$. We characterize the elements $b$ for which the equation above has a solution and, in affirmative case, we determine the exact number of solutions. As an application of our main result, we obtain the cardinality of the sumset $$\sum_{i=1}^k\mathbb F_{q^{d_i}}:=\{α_1+\cdots+α_k\,|\, α_i\in \mathbb F_{q^{d_i}}\}.$$ Our approach also allows us to solve another interesting problem, regarding the existence and number of elements in $\mathbb F_{q^n}$ with prescribed traces over intermediate $\mathbb F_q$-extensions of $\mathbb F_{q^n}$.

math.NT↗

On iterations of rational functions over perfect fields

Let $\mathbb K$ be a perfect field of characterstic $p\ge 0$ and let $R\in \mathbb K(x)$ be a rational function. This paper studies the number $Δ_{α, R}(n)$ of distinct solutions of $R^{(n)}(x)=α$ over the algebraic closure $\overline{\mathbb K}$ of $\mathbb K$, where $α\in \overline{\mathbb K}$ and $R^{(n)}$ is the $n$-fold composition of $R$ with itself. With the exception of some pairs $(α, R)$, we prove that $Δ_{α, R}(n)=c_{α, R}\cdot d^n+O_{α, R}(1)$ for some $0<c_{α, R}\le 1<d$. The number $d$ is readily obtained from $R$ and we provide estimates on $c_{α, R}$. Moreover we prove that the exceptional pairs $(α, R)$ satisfy $Δ_{α, R}(n)\le 2$ for every $n\ge 0$, and we fully describe them. We also discuss further questions and propose some problems in the case where $\mathbb K$ is finite.

math.NT↗

Character sums over affine spaces and applications

Given a finite field $\mathbb F_q$, a positive integer $n$ and an $\mathbb F_q$-affine space $\mathcal A\subseteq \mathbb F_{q^n}$, we provide a new bound on the sum $\sum_{a\in \mathcal A}χ(a)$, where $χ$ a multiplicative character of $\mathbb F_{q^n}$. We focus on the applicability of our estimate to results regarding the existence of special primitive elements in $\mathbb F_{q^n}$. In particular, we obtain substantial improvements on previous works.

math.NT↗

Arithmetic constraints of polynomial maps through discrete logarithms

Let $q$ be a prime power, let $\mathbb F_q$ be the finite field with $q$ elements and let $θ$ be a generator of the cyclic group $\mathbb F_q^*$. For each $a\in \mathbb F_q^*$, let $\log_θ a$ be the unique integer $i\in \{1, \ldots, q-1\}$ such that $a=θ^i$. Given polynomials $P_1, \ldots, P_k\in \mathbb F_q[x]$ and divisors $1<d_1, \ldots, d_k$ of $q-1$, we discuss the distribution of the functions $$F_{i}:y\mapsto \log_θP_i(y)\pmod {d_i}, $$ over the set $\mathbb F_q\setminus \cup_{i=1}^k\{y\in \mathbb F_q\,|\, P_i(y)=0\}$. Our main result entails that, under a natural multiplicative condition on the pairs $(d_i, P_i)$, the functions $F_i$ are asymptotically independent. We also provide some applications that, in particular, relates to past work.

math.NT↗

A note on additive characters of finite fields

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a prime power and, for each integer $n\ge 1$, let $\mathbb F_{q^n}$ be the unique $n$-degree extension of $\mathbb F_q$. The $\mathbb F_q$-orders of an element in $\mathbb F_{q^n}$ and an additive character over $\mathbb F_{q^n}$ have been extensively used in the proof of existence results over finite fields (e.g., the Primitive Normal Basis Theorem). In this note we provide an interesting relation between these two objects.

math.NT↗

Permutations from an arithmetic setting

Let $m, n$ be positive integers such that $m>1$ divides $n$. In this paper, we introduce a special class of piecewise-affine permutations of the finite set $[1, n]:=\{1, \ldots, n\}$ with the property that the reduction $\pmod m$ of $m$ consecutive elements in any of its cycles is, up to a cyclic shift, a fixed permutation of $[1, m]$. Our main result provides the cycle decomposition of such permutations. We further show that such permutations give rise to permutations of finite fields. In particular, we explicitly obtain classes of permutation polynomials of finite fields whose cycle decomposition and its inverse are explicitly given.

math.NT↗

On the factorization of iterated polynomials

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 iterated polynomials $f(g^{(n)}(x))$ over $\mathbb F_q$, such as the largest degree of an irreducible factor and the number of irreducible factors. In particular, we provide significant improvements on the results of D. Gómez-Pérez, A. Ostafe and I. Shparlinski (2014).

math.NT↗

Construction of irreducible polynomials through rational transformations

Let $\mathbb F_q$ be the finite field with $q$ elements, where $q$ is a power of a prime. We discuss recursive methods for constructing irreducible polynomials over $\mathbb F_q$ of high degree using rational transformations. In particular, given a divisor $D>2$ of $q+1$ and an irreducible polynomial $f\in \mathbb F_{q}[x]$ of degree $n$ such that $n$ is even or $D\not \equiv 2\pmod 4$, we show how to obtain from $f$ a sequence $\{f_i\}_{i\ge 0}$ of irreducible polynomials over $\mathbb F_q$ with $\mathrm{deg}(f_i)=n\cdot D^{i}$.

math.NT↗

Factorization of composed polynomials and applications

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial over $\mathbb F_q$. Our main results provide generalizations of recent works on the factorization of binomials $x^n-1$. As an application, we provide an explicit formula for the number of irreducible factors of $f(x^n)$ under some generic conditions on $f$ and $n$.

math.NT↗

Dynamics of the $a$-map over residually finite Dedekind Domains and applications

Let $\mathfrak D$ be a residually finite Dedekind domain, $a\in \mathfrak D$ be a nonzero element and $\mathfrak n$ be a nonzero ideal of $\mathfrak D$. In this paper we describe the dynamics of the map $x\mapsto ax$ over the quotient ring $\mathfrak D/\mathfrak n$. We further present some applications of our main result.

math.NT↗

Möbius-Frobenius maps on irreducible polynomials

Let $n$ be a positive integer and let $\mathbb F_{q^n}$ be the finite field with $q^n$ elements, where $q$ is a power of a prime. This paper introduces a natural action of the Projective Semilinear Group $\text{P}Γ\text{L}(2, q^n)=\text{PGL}(2, q^n)\rtimes \text{Gal}(\mathbb{F}_{q^n}/\mathbb{F}_q)$ on the set of monic irreducible polynomials over the finite field $\mathbb{F}_{q^n}$. Our main results provide information on the characterization and number of fixed points.

math.NT↗

On the existence and number of invariant polynomials

This paper explores a natural action of the group $\mathrm{PGL}_2(\mathbb F_q)$ on the set of monic irreducible polynomials of degree at least two over a finite field $\mathbb F_q$. Our main results deal with the existence and number of fixed points and, in particular, we provide some improvements of previous works.

math.RA↗

The dynamics of permutations on irreducible polynomials

We study degree preserving maps over the set of irreducible polynomials over a finite field. In particular, we show that every permutation of the set of irreducible polynomials of degree $k$ over $\mathbb{F}_q$ is induced by an action from a permutation polynomial of $\mathbb{F}_{q^k}$ with coefficients in $\mathbb{F}_q$. The dynamics of these permutations of irreducible polynomials of degree $k$ over $\mathbb{F}_q$, such as fixed points and cycle lengths, are studied. As an application, we also generate irreducible polynomials of the same degree by an iterative method.

math.NT↗

Factorization of a class of composed polynomials

In this paper, we provide the degree distribution of irreducible factors of the composed polynomial $f(L(x))$ over $\mathbb F_q$, where $f(x)\in \mathbb F_q[x]$ is irreducible and $L(x)\in \mathbb F_q[x]$ is a linearized polynomial. We further provide some applications of our main result, including lower bounds for the number of irreducible factors of $f(L(x))$, constructions of high degree irreducible polynomials and the explicit factorization of $f(x^q-x)$ under certain conditions on $f(x)$.

math.NT↗

Existence results on k-normal elements over finite fields

An element $α\in \mathbb {F}_{q^n}$ is normal over $\mathbb {F}_q$ if $α$ and its conjugates $α, α^q, \cdots α^{q^{n-1}}$ form a basis of $\mathbb {F}_{q^n}$ over $\mathbb {F}_q$. Recently, Huczynska, Mullen, Panario and Thomson (2013) introduce the concept of $k$-normal elements, generalizing the normal elements. In the past few years, many questions concerning the existence and number of $k$-normal elements with specified properties have been proposed. In this paper, we discuss some of these questions and, in particular, we provide many general results on the existence of $k$-normal elements with additional properties like being primitive or having large multiplicative order. We also discuss the existence and construction of $k$-normal elements in finite fields, providing a connection between $k$-normal elements and the factorization of $x^n-1$ over $\mathbb {F}_q$.

math.NT↗

Invariant theory of a special group action on irreducible polynomials over finite fields

In the past few years, an action of $\mathrm{PGL}_2(\mathbb F_q)$ on the set of irreducible polynomials in $\mathbb F_q[x]$ has been introduced and many questions have been discussed, such as the characterization and number of invariant elements. In this paper, we analyze some recent works on this action and provide full generalizations of them, yielding final theoretical results on the characterization and number of invariant elements.

math.NT↗

Variations of the Primitive Normal Basis Theorem

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$.

math.NT↗

On $k$-normal elements over finite fields

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 extensions. In particular, we prove that there exist primitive $k$-normals in $\mathbb F_{q^n}$ over $\mathbb F_q$ in the case when $k$ lies in the interval $[1, n/4]$, $n$ has a special property and $q, n\ge 420$.

math.NT↗