SearcharxivSearch

arXiv subjects

Gary L. Mullen

Publications and source records attributed to Gary L. Mullen.

5 recordsLinked to original sources

A Constructive Finite Field Method for Scattering Points on the Surface of $d$-Dimensional Spheres

In this exploratory article, we present a constructive method for scattering points on the surface of $d$ dimensional spheres which we believe is new and of interest. Indeed, the problem of uniformly distributing points on spheres is an interesting and difficult problem with vast applications in fields as diverse as crystallography, approximation theory, computational complexity, molecular structure, and electrostatics.

math.NT

On coefficients of powers of polynomials and their compositions over finite fields

For any given polynomial $f$ over the finite field $\mathbb{F}_q$ with degree at most $q-1$, we associate it with a $q\times q$ matrix $A(f)=(a_{ik})$ consisting of coefficients of its powers $(f(x))^k=\sum_{i=0}^{q-1}a_{ik} x^i$ modulo $x^q -x$ for $k=0,1,\ldots,q-1$. This matrix has some interesting properties such as $A(g\circ f)=A(f)A(g)$ where $(g\circ f)(x) = g(f(x))$ is the composition of the polynomial $g$ with the polynomial $f$. In particular, $A(f^{(k)})=(A(f))^k$ for any $k$-th composition $f^{(k)}$ of $f$ with $k \geq 0$. As a consequence, we prove that the rank of $A(f)$ gives the cardinality of the value set of $f$. Moreover, if $f$ is a permutation polynomial then the matrix associated with its inverse $A(f^{(-1)})=A(f)^{-1}=PA(f)P$ where $P$ is an antidiagonal permutation matrix. As an application, we study the period of a nonlinear congruential pseduorandom sequence $\bar{a} = \{a_0, a_1, a_2, ... \}$ generated by $a_n = f^{(n)}(a_0)$ with initial value $a_0$, in terms of the order of the associated matrix. Finally we show that $A(f)$ is diagonalizable in some extension field of $\mathbb{F}_q$ when $f$ is a permutation polynomial over $\mathbb{F}_q$.

math.NT

Value sets of polynomial maps over finite fields

We provide upper bounds for the cardinality of the value set of a polynomial map in several variables over a finite field. These bounds generalize earlier bounds for univariate polynomials.

math.NT

Number of Irreducible Polynomials and Pairs of Relatively Prime Polynomials in Several Variables over Finite Fields

We discuss several enumerative results for irreducible polynomials of a given degree and pairs of relatively prime polynomials of given degrees in several variables over finite fields. Two notions of degree, the {\em total degree} and the {\em vector degree}, are considered. We show that the number of irreducibles can be computed recursively by degree and that the number of relatively prime pairs can be expressed in terms of the number of irreducibles. We also obtain asymptotic formulas for the number of irreducibles and the number of relatively prime pairs. The asymptotic formulas for the number of irreducibles generalize and improve several previous results by Carlitz, Cohen and Bodin.

math.NT

Frequency permutation arrays

Motivated by recent interest in permutation arrays, we introduce and investigate the more general concept of frequency permutation arrays (FPAs). An FPA of length n=m lambda and distance d is a set T of multipermutations on a multiset of m symbols, each repeated with frequency lambda, such that the Hamming distance between any distinct x,y in T is at least d. Such arrays have potential applications in powerline communication. In this paper, we establish basic properties of FPAs, and provide direct constructions for FPAs using a range of combinatorial objects, including polynomials over finite fields, combinatorial designs, and codes. We also provide recursive constructions, and give bounds for the maximum size of such arrays.

math.CO