Related papers: On a Class of Permutation Rational Functions Invol…
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 investigate certain classes of normal completely positive (CP) maps on the hyperfinite $II_1$ factor $\mathcal A$. Using the representation theory of a suitable irrational rotation algebra, we propose some computable invariants for such…
We describe fast algorithms for approximating the connection coefficients between a family of orthogonal polynomials and another family with a polynomially or rationally modified measure. The connection coefficients are computed via…
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
In this paper, we present three classes of complete permutation monomials over finite fields of odd characteristic. Meanwhile, the compositional inverses of these complete permutation polynomials are also proposed.
Let $\mathbb F_q$ denote the finite field with $q$ elements. In this paper we use the relationship between suitable polynomials and number of rational points on algebraic curves to give the exact number of elements $a\in \mathbb F_q$ for…
Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial design theory, a correspondence of perfect $c$-nonlinear…
Let k be an algebraically closed field of characteristic zero. An element F from k(x_1,...,x_n) is called a closed rational function if the subfield k(F) is algebraically closed in the field k(x_1,...,x_n). We prove that a rational function…
Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…
Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…
It has been shown by Madden that there are only finitely many quadratic extensions of k(x), k a finite field, in which the ideal class group has exponent two and the infinity place of k(x) ramifies. We give a characterization of such fields…
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.
We introduce and study some families of groups whose irreducible characters take values on quadratic extensions of the rationals. We focus mostly on a generalization of inverse semi-rational groups, which we call uniformly semi-rational…
McMullen proved the moduli space of complex rational maps can be parametrized by the spectrum of all periodic-point multipliers up to a finite amount of data, with the well-understood exception of Latt\`{e}s maps. We generalize his method…
In this paper we present and analyse a construction of irreducible polynomials over odd prime fields via the transforms which take any polynomial $f \in \mathbf{F}_p[x]$ of positive degree $n$ to $\left(\frac{x}{k} \right)^n \cdot…
We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…
This paper is devoted to certain applications of classical Whitney decomposition of the upper half space R^n+1 to various problems in harmonic function spaces in the upper half space.We obtain sharp new assertions on embeddings,distances…
The synthesis problem asks to automatically generate, if it exists, an algorithm from a specification of correct input-output pairs. In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing…
Machines whose main purpose is to permute and sort data are studied. The sets of permutations that can arise are analysed by means of finite automata and avoided pattern techniques. Conditions are given for these sets being enumerated by…