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.)
Let $\mathbb{F}_q$ denote the finite field with $q$ elements. The Carlitz rank of a permutation polynomial is a important measure of complexity of the polynomial. In this paper we find the sharp lower bound for the weight of any permutation polynomial with Carlitz rank $2$, improving the bound found by Gómez-Pérez, Ostafe and Topuzoğlu in that case.
This paper contains two parts. The first is the solution of a challenge question, proposed by Etienne Ghys, on the determination of all maps from rational numbers to themselves such that the difference quotient (f(x)-f(y))/(x-y) is always a square. The second is the computer determination, done with the help of Stephane Gaubert, of a function of primes which plays a key role in the first part as a generalization of a result of Carlitz.
In 1935 Carlitz introduced Bernoulli-Carlitz numbers as analogues of Bernoulli numbers for the rational function field $\mathbb F_r(T)$. In this paper, we introduce Cauchy-Carlitz numbers as analogues of Cauchy numbers. By using Stirling-Carlitz numbers, we give their arithmetical and combinatorial properties and relations with Bernoulli-Carlitz numbers for $\mathbb F_r(T)$. Several new identities are also obtained by using Hasse-Teichimüller derivatives.
In this paper, we define finite Carlitz multiple polylogarithms and show that every finite multiple zeta value over the rational function field $\mathbb{F}_{q}(θ)$ is an $\mathbb{F}_{q}(θ)$-linear combination of finite Carlitz multiple polylogarithms at integral points. It is completely compatible with the formula for Thakur MZV's established in [C14].
In this paper, we connect two types of representations of a permutation $σ$ of the finite field $\F_q$. One type is algebraic, in which the permutation is represented as the composition of degree-one polynomials and $k$ copies of $x^{q-2}$, for some prescribed value of $k$. The other type is combinatorial, in which the permutation is represented as the composition of a degree-one rational function followed by the product of $k$ $2$-cycles on $\bP^1(\F_q):=\F_q\cup\{\infty\}$, where each $2$-cycle moves $\infty$. We show that, after modding out by obvious equivalences amongst the algebraic repr…
Carlitz proved that, for any prime power q other than 2, the group of all permutations of the finite field F_q is generated by the permutations induced by degree-one polynomials and x^{q-2}. His proof relies on a remarkable polynomial which appears to have been found by magic. We show here that no magic is required: there is a straightforward way to produce a simple polynomial which has the same remarkable properties as the complicated polynomial in Carlitz's proof. We also identify the crucial subtlety which allows such simple polynomials to exist, and discuss some consequences.
We study higher-dimensional analogs of the Dedekind-Carlitz polynomials c(u,v;a,b) := sum_{k=1..b-1} u^[ka/b] v^(k-1), where u and v are indeterminates and a and b are positive integers. Carlitz proved that these polynomials satisfy the reciprocity law (v-1) c(u,v;a,b) + (u-1) c(v,u;b,a) = u^(a-1) v^(b-1) - 1, from which one easily deduces many classical reciprocity theorems for the Dedekind sum and its generalizations. We illustrate that Dedekind-Carlitz polynomials appear naturally in generating functions of rational cones and use this fact to give geometric proofs of the Carlitz reciprocity…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group generated by shift and inversion maps is used to study the randomness properties of permutation polynomials.
Let $k$ be the rational function field over the finite field of $q$ elements and $\bar{k}$ its fixed algebraic closure. In this paper, we study algebraic relations over $\bar{k}$ among the fundamental period $\widetildeπ$ of the Carlitz module and the positive characteristic multizeta values $ζ(n)$ and $ζ(n,n)$ for an "odd" integer $n$, where we say that $n$ is "odd" if $q-1$ does not divide $n$. We prove that either they are algebraically independent over $\bar{k}$ or satisfy some simple relation over $k$. We also prove that if $2n$ is "odd" then they are algebraically independent over $\bar{…
We develop a theory of Tannakian Galois groups for t-motives and relate this to the theory of Frobenius semilinear difference equations. We show that the transcendence degree of the period matrix associated to a given t-motive is equal to the dimension of its Galois group. Using this result we prove that Carlitz logarithms of algebraic functions that are linearly independent over the rational function field are algebraically independent.
We focus on the generating series for the rational special values of Pellarin's $L$-series in $1 \leq s \leq 2(q-1)$ indeterminates, and using interpolation polynomials we prove a closed form formula relating this generating series to the Carlitz exponential, the Anderson-Thakur function, and the Anderson generating functions for the Carlitz module. We draw several corollaries, including explicit formulae and recursive relations for Pellarin's $L$-series in the same range of $s$, and divisibility results on the numerators of the Bernoulli-Carlitz numbers by monic irreducibles of degrees one an…
For q > 2, Carlitz proved that the group of permutation polynomials (PPs) over F_q is generated by linear polynomials and x^{q-2}. Based on this result, this note points out a simple method for representing all PPs with full cycle over the prime field F_p, where p is an odd prime. We use the isomorphism between the symmetric group S_p of p elements and the group of PPs over F_p, and the well-known fact that permutations in S_p have the same cycle structure if and only if they are conjugate.
In this paper we study the set of rational solutions of equations defined by power sums symmetric polynomials with coefficients in a finite field. We do this by means of applying a methodology which relies on the study of the geometry of the set of common zeros of symmetric polynomials over the algebraic closure of a finite field. We provide improved estimates and existence results of rational solutions to the following equations: deformed diagonal equations, generalized Markoff Hurwitz type equations and Carlitz's equations. We extend these techniques to a more general variants of diagonal eq…
We introduce and study the \emph{Rademacher-Carlitz polynomial} \[ \RC(u, v, s, t, a, b) := \sum_{k = \lceil s \rceil}^{\lceil s \rceil + b - 1} u^{\fl{\frac{ka + t}{b}}} v^k \] where $a, b \in \Z_{>0}$, $s, t \in \R$, and $u$ and $v$ are variables. These polynomials generalize and unify various Dedekind-like sums and polynomials; most naturally, one may view $\RC(u, v, s, t, a, b)$ as a polynomial analogue (in the sense of Carlitz) of the \emph{Dedekind-Rademacher sum} \[ \r_t(a,b) := \sum_{k=0}^{b-1}\left(\left(\frac{ka+t}{b} \right)\right) \left(\left(\frac{k}{b} \right)\right), \] which ap…
In analogy with values of the classical Euler Gamma-function at rational numbers and the Riemann zeta-function at positive integers, we consider Thakur's geometric Gamma-function evaluated at rational arguments and Carlitz zeta-values at positive integers. We prove that, when considered together, all of the algebraic relations among these special values arise from the standard functional equations of the Gamma-function and from the Euler-Carlitz relations and Frobenius p-th power relations of the zeta-function.
Let $\mathbb{F}_q$ be the finite field of $q$ elements. Then a \emph{permutation polynomial} (PP) of $\mathbb{F}_q$ is a polynomial $f \in \mathbb{F}_q[x]$ such that the associated function $c \mapsto f(c)$ is a permutation of the elements of $\mathbb{F}_q$. In 1897 Dickson gave what he claimed to be a complete list of PPs of degree at most 6, however there have been suggestions recently that this classification might be incomplete. Unfortunately, Dickson's claim of a full characterisation is not easily verified because his published proof is difficult to follow. This is mainly due to antiquat…
We determine all degree-4 rational functions f(X) in F_q(X) which permute P^1(F_q), and answer two questions of Ferraguti and Micheli about the number of such functions and the number of equivalence classes of such functions up to composing with degree-one rational functions. We also determine all degree-8 rational functions f(X) in F_q(X) which permute P^1(F_q) in case q is sufficiently large, and do the same for degree 32 in case either q is odd or f(X) is a nonsquare. Further, for most other positive integers n<4096, for each sufficiently large q we determine all degree-n rational functions…
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$.
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}$.
Let $μ_{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 $μ_{q+1}$ or between $μ_{q+1}$ and $\mathbb{F}_q \cup \{\infty\}$. In particular, we generalize results from Zieve.
In this paper, we give a simultaneous vanishing principle for the $v$-adic Carlitz multiple polylogarithms (abbreviated as CMPLs) at algebraic points, where $v$ is a finite place of the rational function field over a finite field. This principle establishes the fact that the $v$-adic vanishing of CMPLs at algebraic points is equivalent to its $\infty$-adic counterpart being Eulerian. This reveals a nontrivial connection between the $v$-adic and $\infty$-adic worlds in positive characteristic.
A permutation rational function $f\in \mathbb{F}_q(x)$ is a rational function that induces a bijection on $\mathbb{F}_q$, that is, for all $y\in\mathbb{F}_q$ there exists exactly one $x\in\mathbb{F}_q$ such that $f(x)=y$. Permutation rational functions are intimately related to exceptional rational functions, and more generally exceptional covers of the projective line, of which they form the first important example. In this paper, we show how to efficiently generate many permutation rational functions over large finite fields using isogenies of elliptic curves, and discuss some cryptographic …
Let $q$ be a prime power, $\mathbb F_q$ be the finite field of order $q$ and $\mathbb F_q(x)$ be the field of rational functions over $\mathbb F_q$. In this paper we classify all rational functions $φ\in \mathbb F_q(x)$ of degree 3 that induce a permutation of $\mathbb P^1(\mathbb F_q)$. Our methods are constructive and the classification is explicit: we provide equations for the coefficients of the rational functions using Galois theoretical methods and Chebotarev Density Theorem for global function fields. As a corollary, we obtain that a permutation rational function of degree 3 permutes $\…
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 which the binomial $x^n(x^{(q-1)/r} + a)$ is a permutation polynomial in the cases $r = 2$ and $r = 3$.
In 1923 Schur considered the following problem. Let f(X) be a polynomial with integer coefficients that induces a bijection on the residue fields Z/pZ for infinitely many primes p. His conjecture, that such polynomials are compositions of linear and Dickson polynomials, was proved by M. Fried in 1970. Here we investigate the analogous question for rational functions, also we allow the base field to be any number field. As a result, there are many more rational functions for which the analogous property holds. Some infinite series come from rational isogenies of elliptic curves and deformations…
We establish some partial fraction identities for rational functions whose denominators are implicit products of the cyclotomic polynomials. To achieve this, we first develop a general algebraic approach for partial fraction decomposition inspired by the Heaviside's cover-up method. We thus call our method the Extended Cover-Up Method. Using our method we obtain direct formulas for $q$-partial fractions for certain generating functions. As a direct consequence of our formulas one can compute the Sylvester denumerants, the Frobenius number and the Ehrhart polynomials in pseudo-polynomial time. …
We classify the finite primitive permutation groups which have a cyclic subgroup with two orbits. This extends classical topics in permutation group theory, and has arithmetic consequences. By a theorem of C. L. Siegel, affine algebraic curves with infinitely many integral points are parametrized by rational functions whose monodromy groups have this property. We classify the possibilities of these monodromy groups, and give an application to Hilbert's irreducibility theorem.
We report on a database of field extensions of the rationals, its properties and the methods used to compute it. At the moment the database encompasses roughly 100,000 polynomials generating distinct number fields over the rationals, of degrees up to 15. It contains polynomials for all transitive permutation groups up to that degree, and even for most of the possible combinations of signature and Galois group in that range. Moreover, whenever these are known, the fields of minimal discriminant with given group and signature have been included. The database can be downloaded from www.iwr.uni-he…
We construct classes of permutation polynomials over F_{Q^2} by exhibiting classes of low-degree rational functions over F_{Q^2} which induce bijections on the set of (Q+1)-th roots of unity in F_{Q^2}. As a consequence, we prove two conjectures about permutation trinomials from a recent paper by Tu, Zeng, Hu and Li.
We determine all permutation polynomials over F_{q^2} of the form X^r A(X^{q-1}) where, for some Q which is a power of the characteristic of F_q, the integer r is congruent to Q+1 (mod q+1) and all terms of A(X) have degrees in {0, 1, Q, Q+1}. We then use this classification to resolve eight conjectures and open problems from the literature, and we show that the simplest special cases of our result imply 58 recent results from the literature. Our proof makes a novel use of geometric techniques in a situation where they previously did not seem applicable, namely to understand the arithmetic of …
Hecke operators relate characters of rational conformal field theories (RCFTs) with different central charges, and extend the previously studied Galois symmetry of modular representations and fusion algebras. We show that the conductor $N$ of a RCFT and the quadratic residues mod $N$ play an important role in the computation and classification of Galois permutations. We establish a field correspondence in different theories through the picture of effective central charge, which combines Galois inner automorphisms and the structure of simple currents. We then make a first attempt to extend Heck…
