Related papers: On multiplicative independence of rational functio…

We introduce the notion of "quasi-symmetric" polynomials, which is a generalization of the notion of symmetry, and is particularly suited to the setting of polynomial rings over finite fields. The properties of this new class of functions…

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…

The independence polynomial of a graph is the generating polynomial for the number of independent sets of each size and its roots are called independence roots. We bound the maximum modulus, $\mbox{maxmod}(n)$, of an independence root over…

Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends interpretation methods to a pure higher order functional…

We continue previous work to count non-equivalent dynamical systems over finite fields generated by polynomials or rational functions.

We prove a function field analogue of Maynard's result about primes with restricted digits. That is, for certain ranges of parameters n and q, we prove an asymptotic formula for the number of irreducible polynomials of degree n over a…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

The aim of this paper is to provide sufficient conditions for when a polynomial or rational function over a field K is prime using its order of vanishing at infinity and the resultant.

Using the sieve for Frobenius, we show that, in a certain sense, the roots of the L-functions of "most" algebraic curves over finite fields do not satisfy any non-trivial (linear or multiplicative) rational dependency relations. This can be…

We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.

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…

The $\beta\gamma$ system is generalized by complex(rational) powers of the fields, which leads to a corresponding extension on the Fock space. Two different approaches to compute the Green functions of the physical operators are proposed.…

Let G be a finite group of complex n by n unitary matrices generated by reflections acting on C^n. Let R be the ring of invariant polynomials, and \chi be a multiplicative character of G. Let \Omega^\chi be the R-module of \chi-invariant…

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper…

Rational transformations of polynomials are extensively studied in the context of finite fields, especially for the construction of irreducible polynomials. In this paper, we consider the factorization of rational transformations with…

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

Though it is well known that the roots of any affine polynomial over a finite field can be computed by a system of linear equations by using a normal base of the field, such solving approach appears to be difficult to apply when the field…

The paper studies constructions of irreducible polynomials over finite fields using polynomial composition method.