Related papers: New Permutation Trinomials From Niho Exponents ove…
We construct a class of permutation polynomials of $\bF_{2^m}$ that are closely related to Dickson polynomials.
We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…
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…
The R\'{e}dei function defined over a field of even characteristic has been introduced by N\"{o}bauer in 1986 \cite{even}. In this paper, inspired by the work of Fu et al. \cite{wang} in odd characteristic, employing the AGW criterion…
We present an extension of a previously developed method employing the formalism of the fractional derivatives to solve new classes of integral equations. This method uses different forms of integral operators that generalizes the…
This is a sequel to math.AG/0003009. Here we study identities for the Fourier transform of "elementary functions" over finite field containing "exponents" of monomial rational functions. It turns out that these identities are governed by…
In this paper we take a deeper look at the self conjugate reciprocal (SCR) polynomials, which towards the end of the paper aid the construction of new classes of permutation polynomials of simpler forms over $\mathbb{F}_{q^{2}}$. The paper…
Morales-Mendoza et al. present in 2013 a new class of discrete orthogonal polynomials. They use these polynomials to design an unbiased FIR filter. In their paper they make the statement that a representation of the polynomials via…
Finite field transforms have many applications and, in many cases, can be implemented with a low computational complexity. In this paper, the Z Transform over a finite field is introduced and some of its properties are presented.
In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.
An orthomorphism over a finite field $\mathbb{F}_q$ is a permutation $\theta:\mathbb{F}_q\mapsto\mathbb{F}_q$ such that the map $x\mapsto\theta(x)-x$ is also a permutation of $\mathbb{F}_q$. The degree of an orthomorphism of $\mathbb{F}_q$,…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
We give new characterizations of the algebra $\mathscr{L}_n(\mathbb{F}_{q^n})$ formed by all linearized polynomials over the finite field $\mathbb{F}_{q^n}$ after briefly surveying some known ones. One isomorphism we construct is between…
We determine necessary and sufficient conditions for unicritical polynomials to be dynamically irreducible over finite fields. This result extends the results of Boston-Jones and Hamblen-Jones-Madhu regarding the dynamical irreducibility of…
We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…
We determine all permutations in two large classes of polynomials over finite fields, where the construction of the polynomials in each class involves the denominators of a class of rational functions generalizing the classical Redei…
In this paper we apply the previously derived formalism of permutation orbifold conformal field theories to N=2 supersymmetric minimal models. By interchanging extensions and permutations of the factors we find a very interesting structure…
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
We prove the boundedness theorem for Fano threefolds with log-terminal singularities of any fixed index. This is an improvement of our earlier result, where we required additionally that the variety is Q-factorial, with Picard number 1. The…
The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…