Searcharxiv⌕ Search

arXiv subjects

Xiang-dong Hou

Publications and source records attributed to Xiang-dong Hou.

At least 19 recordsLinked to original sources
arXiv2026

Classification of Rational Functions of Degree Three over Finite Fields

We study rational functions over finite fields under PGL-equivalence. We say that $f, g \in \Bbb F_q(X)$ are \emph{equivalent} if there exist $ψ, ϕ\in \Bbb F_q(X)$ of degree one such that $g = ψ\circ f \circ ϕ$. Most properties of rational functions over finite fields as they appear in theory and applications are preserved under this equivalence. In a recent work, Mattarei and Pizzato classified rational functions of degree three over finite fields in even characteristic. In the present paper, we classify all rational functions of degree three over finite fields in odd characteristic. Our approach is based on careful analyses of the value frequencies and the ramification points of the degree three rational functions. The completion of our classification also relies on an explicit formula for the number of equivalence classes of degree three rational functions over finite fields recently obtained by the first author.

math.NT↗
arXiv2025

On Sum-Free Functions

A function from $\Bbb F_{2^n}$ to $\Bbb F_{2^n}$ is said to be {\em $k$th order sum-free} if the sum of its values over each $k$-dimensional $\Bbb F_2$-affine subspace of $\Bbb F_{2^n}$ is nonzero. This notion was recently introduced by C. Carlet as, among other things, a generalization of APN functions. At the center of this new topic is a conjecture about the sum-freedom of the multiplicative inverse function $f_{\text{\rm inv}}(x)=x^{-1}$ (with $0^{-1}$ defined to be $0$). It is known that $f_{\text{\rm inv}}$ is 2nd order (equivalently, $(n-2)$th order) sum-free if and only if $n$ is odd, and it is conjectured that for $3\le k\le n-3$, $f_{\text{\rm inv}}$ is never $k$th order sum-free. The conjecture has been confirmed for even $n$ but remains open for odd $n$. In the present paper, we show that the conjecture holds under each of the following conditions: (1) $n=13$; (2) $3\mid n$; (3) $5\mid n$; (4) the smallest prime divisor $l$ of $n$ satisfies $(l-1)(l+2)\le (n+1)/2$. We also determine the ``right'' $q$-ary generalization of the binary multiplicative inverse function $f_{\text{\rm inv}}$ in the context of sum-freedom. This $q$-ary generalization not only maintains most results for its binary version, but also exhibits some extraordinary phenomena that are not observed in the binary case.

math.NT↗
arXiv2025

More on the sum-freedom of the multiplicative inverse function

In two papers entitled ``Two generalizations of almost perfect nonlinearity" and ``On the vector subspaces of $\mathbb F_{2^n}$ over which the multiplicative inverse function sums to zero", the first author has introduced and studied the notion of sum-freedom of vectorial functions, which expresses that a function sums to nonzero values over all affine subspaces of $\Bbb F_{2^n}$ of a given dimension $k\geq 2$, and he then focused on the $k$th order sum-freedom of the multiplicative inverse function $x\in \Bbb F_{2^n}\mapsto x^{2^n-2}$. Some general results were given for this function (in particular, the case of affine spaces that do not contain 0 was solved positively), and the cases of $k\in \{3,n-3\}$ and of $k$ not co-prime with $n$ were solved as well (negatively); but the cases of those linear subspaces of dimension $k\in [\![ 4;n-4]\!]$, co-prime with $n$, were left open. The present paper is a continuation of the previous work. After studying, from two different angles, the particular case of those linear subspaces that are stable under the Frobenius automorphism, we deduce from the second approach that, for $k$ small enough (approximately, $3\le k\leq n/10$), the multiplicative inverse function is not $k$th order sum-free. Finally, we extend a result previously obtained in the second paper mentioned above, and we deduce in particular that, for any even $n$ and every $2\leq k\leq n-2$, the multiplicative inverse function is not $k$th order sum-free.

math.NT↗
arXiv2025

Number of Equivalence Classes of Rational Functions over Finite Fields

Two rational functions $f,g\in\Bbb F_q(X)$ are said to be {\em equivalent} if there exist $ϕ,ψ\in\Bbb F_q(X)$ of degree one such that $g=ϕ\circ f\circψ$. We give an explicit formula for the number of equivalence classes of rational functions of a given degree in $\Bbb F_q(X)$. This result should provide guidance for the current and future work on classifications of low degree rational functions over finite fields. We also determine the number of equivalence classes of polynomials of a given degree in $\Bbb F_q[X]$.

math.NT↗
arXiv2025

On a Conjecture About the Sum-Freedom of the Binary Multiplicative Inverse Function

A recent conjecture by C. Carlet on the sum-freedom of the binary multiplicative inverse function can be stated as follows: For each pair of positive integers $(n,k)$ with $3\le k\le n-3$, there is a $k$-dimensional $\Bbb F_2$-subspace $E$ of $\Bbb F_{2^n}$ such that $\sum_{0\ne\in E}1/u=0$. We confirm this conjecture when $n$ is not a prime.

math.NT↗
arXiv2025

Two Absolutely Irreducible Polynomials over $\Bbb F_2$ and Their Applications to a Conjecture by Carlet

Two polynomials $F_k(X_1,\dots,X_k)$ and $Θ_k(X_1,\dots,X_k)$ over $\Bbb F_2$ arose from the study of a conjecture by C. Carlet about the sum-freedom of the multiplicative inverse function of $\Bbb F_{2^n}$. Both $F_k$ and $Θ_k$ are homogeneous and symmetric with $\text{deg}\,F_k=2^k-2$ and $\text{deg}\,Θ_k=2^{k-1}$. It is known that $F_k$ is absolutely irreducible for $k\ge 3$. Using the Lang-Weil bound and a curious connection between $F_k$ and $Θ_k$, we show that $Θ_k$ ($k\ge 3$) is also absolutely irreducible. This conclusion allows us to improve several existing results about Carlet's conjecture.

math.NT↗
arXiv2024

Some Algebraic Questions about the Reed-Muller Code

Let $R_q(r,n)$ denote the $r$th order Reed-Muller code of length $q^n$ over $\Bbb F_q$. We consider two algebraic questions about the Reed-Muller code. Let $H_q(r,n)=R_q(r,n)/R_q(r-1,n)$. (1) When $q=2$, it is known that there is a "duality" between the actions of $\text{GL}(n,\Bbb F_2)$ on $H_2(r,n)$ and on $H_2(r',n)$, where $r+r'=n$. The result is false for a general $q$. However, we find that a slightly modified duality statement still holds when $q$ is a prime or $r<\text{char}\,\Bbb F_q$. (2) Let $\mathcal F(\Bbb F_q^n,\Bbb F_q)$ denote the $\Bbb F_q$-algebra of all functions from $\Bbb F_q^n$ to $\Bbb F_q$. It is known that when $q$ is a prime, the Reed-Muller codes $\{0\}=R_q(-1,n)\subset R_q(0,n)\subset\cdots\subset R_q(n(q-1),n)=\mathcal F(\Bbb F_q^n,\Bbb F_q)$ are the only $\text{AGL}(n,\Bbb F_q)$-submodules of $\mathcal F(\Bbb F_q^n,\Bbb F_q)$. In particular, $H_q(r,n)$ is an irreducible $\text{GL}(n,\Bbb F_q)$-module when $q$ is a prime. For a general $q$, $H_q(r,n)$ is not necessarily irreducible. We determine all its submodules and the factors in its composition series. The factors of the composition series of $H_q(r,n)$ provide an explicit family of irreducible representations of $\text{GL}(n,\Bbb F_q)$ over $\Bbb F_q$.

math.RA↗
arXiv2023

An approach to normal polynomials through symmetrization and symmetric reduction

An irreducible polynomial $f\in\Bbb F_q[X]$ of degree $n$ is {\em normal} over $\Bbb F_q$ if and only if its roots $r, r^q,\dots,r^{q^{n-1}}$ satisfy the condition $Δ_n(r, r^q,\dots,r^{q^{n-1}})\ne 0$, where $Δ_n(X_0,\dots,X_{n-1})$ is the $n\times n$ circulant determinant. By finding a suitable {\em symmetrization} of $Δ_n$ (A multiple of $Δ_n$ which is symmetric in $X_0,\dots,X_{n-1}$), we obtain a condition on the coefficients of $f$ that is sufficient for $f$ to be normal. This approach works well for $n\le 5$ but encounters computational difficulties when $n\ge 6$. In the present paper, we consider irreducible polynomials of the form $f=X^n+X^{n-1}+a\in\Bbb F_q[X]$. For $n=6$ and $7$, by an indirect method, we are able to find simple conditions on $a$ that are sufficient for $f$ to be normal. In a more general context, we also explore the normal polynomials of a finite Galois extension through the irreducible characters of the Galois group.

math.RA↗
arXiv2023

A Criterion for the Normality of Polynomials over Finite Fields Based on Their Coefficients

An irreducible polynomial over $\Bbb F_q$ is said to be normal over $\Bbb F_q$ if its roots are linearly independent over $\Bbb F_q$. We show that there is a polynomial $h_n(X_1,\dots,X_n)\in\Bbb Z[X_1,\dots,X_n]$, independent of $q$, such that if an irreducible polynomial $f=X^n+a_1X^{n-1}+\cdots+a_n\in\Bbb F_q[X]$ is such that $h_n(a_1,\dots,a_n)\ne 0$, then $f$ is normal over $\Bbb F_q$. The polynomial $h_n(X_1,\dots,X_n)$ is computed explicitly for $n\le 5$ and partially for $n=6$. When $\text{char}\,\Bbb F_q=p$, we also show that there is a polynomial $h_{p,n}(X_1,\dots,X_n)\in\Bbb F_p[X_1,\dots,X_n]$, depending on $p$, which is simpler than $h_n$ but has the same property. These results remain valid for monic separable irreducible polynomials over an arbitrary field with a cyclic Galois group.

math.NT↗
arXiv2022

A General Construction of Permutation Polynomials of $\Bbb F_{q^2}$

Let $r$ be a positive integer, $h(X)\in\Bbb F_{q^2}[X]$, and $μ_{q+1}$ be the subgroup of order $q+1$ of $\Bbb F_{q^2}^*$. It is well known that $X^rh(X^{q-1})$ permutes $\Bbb F_{q^2}$ if and only if $\text{gcd}(r,q-1)=1$ and $X^rh(X)^{q-1}$ permutes $μ_{q+1}$. There are many ad hoc constructions of permutation polynomials of $\Bbb F_{q^2}$ of this type such that $h(X)^{q-1}$ induces monomial functions on the cosets of a subgroup of $μ_{q+1}$. We give a general construction that can generate, through an algorithm, {\em all} permutation polynomials of $\Bbb F_{q^2}$ with this property, including many which are not known previously. The construction is illustrated explicitly for permutation binomials and trinomials.

math.NT↗
arXiv2022

New Results on Permutation Binomials of Finite Fields

After a brief review of existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of $\Bbb F_{q^2}$ of the form $X^n(X^{d(q-1)}+a)$, where $n$ and $d$ are positive integers and $a\in\Bbb F_{q^2}^*$. Our contributions include two nonexistence results: (1) If $q$ is even and sufficiently large and $a^{q+1}\ne 1$, then $X^n(X^{3(q-1)}+a)$ is not a PB of $\Bbb F_{q^2}$. (2) If $2\le d\mid q+1$, $q$ is sufficiently large and $a^{q+1}\ne 1$, then $X^n(X^{d(q-1)}+a)$ is not a PB of $\Bbb F_{q^2}$ under certain additional conditions. (1) partially confirms a recent conjecture by Tu et al. (2) is an extension of a previous result with $n=1$.

math.NT↗
arXiv2021

On the Number of Affine Equivalence Classes of Boolean Functions

Let $R(r,n)$ be the $r$th order Reed-Muller code of length $2^n$. The affine linear group $\text{AGL}(n,\Bbb F_2)$ acts naturally on $R(r,n)$. We derive two formulas concerning the number of orbits of this action: (i) an explicit formula for the number of AGL orbits of $R(n,n)$, and (ii) an asymptotic formula for the number of AGL orbits of $R(n,n)/R(1,n)$. The number of AGL orbits of $R(n,n)$ has been numerically computed by several authors for $n\le 10$; result (i) is a theoretic solution to the question. Result (ii) answers a question by MacWilliams and Sloane.

math.CO↗
arXiv2020

On a radical extension of the field of rational functions in several variables

Let $F$ be a field and let $F(X_1,\dots,X_n)$ be the field of rational functions in $n$ variables $X_1,\dots,X_n$ over $F$. Let $T=X_1+\cdots+X_n\in F(X_1,\dots,X_n)$ and let $m$ be a positive integer such that $\text{char}\,F\nmid m$. Is it possible to express each $X_i$ as a rational function in $X_1^m\dots,X_n^m$ and $T$ over $F$? It is not difficult to prove that this can be done but it is another matter to show how this is done. We answer the above question affirmatively with a nonconstructive proof and a constructive proof.

math.RA↗
arXiv2020

on a conjecture on permutation rational functions over finite fields

Let $p$ be a prime and $n$ be a positive integer, and consider $f_b(X)=X+(X^p-X+b)^{-1}\in \Bbb F_p(X)$, where $b\in\Bbb F_{p^n}$ is such that $\text{Tr}_{p^n/p}(b)\ne 0$. It is known that (i) $f_b$ permutes $\Bbb F_{p^n}$ for $p=2,3$ and all $n\ge 1$; (ii) for $p>3$ and $n=2$, $f_b$ permutes $\Bbb F_{p^2}$ if and only if $\text{Tr}_{p^2/p}(b)=\pm 1$; and (iii) for $p>3$ and $n\ge 5$, $f_b$ does not permute $\Bbb F_{p^n}$. It has been conjectured that for $p>3$ and $n=3,4$, $f_b$ does not permute $\Bbb F_{p^n}$. We prove this conjecture for sufficiently large $p$.

math.NT↗
arXiv2020

A power sum formula by Carlitz and its applications to permutation rational functions of finite fields

A formula discovered by L. Carlitz in 1935 finds an interesting application in permutation rational functions of finite fields. It allows us to determine all rational functions of degree three that permute the projective line $\Bbb P^1(\Bbb F_q)$ over $\Bbb F_q$, a result previously obtained by Ferraguti and Micheli through a different method. It also allows us to determine all rational functions of degree four that permute $\Bbb P^1(\Bbb F_q)$ under a certain condition. (A complete determination of all rational functions of degree four that permute $\Bbb P^1(\Bbb F_q)$ without any condition will appear in a separate forthcoming paper.)

math.NT↗
arXiv2020

On a Type of Permutation Rational Functions over Finite Fields

Let $p$ be a prime and $n$ be a positive integer. Let $f_b(X)=X+(X^p-X+b)^{-1}$, where $b\in\Bbb F_{p^n}$ is such that $\text{Tr}_{p^n/p}(b)\ne 0$. In 2008, Yuan et al. \cite{Yuan-Ding-Wang-Pieprzyk-FFA-2008} showed that for $p=2,3$, $f_b$ permutes $\Bbb F_{p^n}$ for all $n\ge 1$. Using the Hasse-Weil bound, we show that when $p>3$ and $n\ge 5$, $f$ does not permute $\Bbb F_{p^n}$. For $p>3$ and $n=2$, we prove that $f_b$ permutes $\Bbb F_{p^2}$ if and only if $\text{Tr}_{p^2/p}(b)=\pm 1$. We conjecture that for $p>3$ and $n=3,4$, $f_b$ does not permute $\Bbb F_{p^n}$.

math.NT↗