Related papers: Constructing Permutation Rational Functions From I…
The rational Landen transformations are used to produce a highly efficient numerical method for the integration of rational functions.
A complex rational function R, of degree n>1, on a compact Riemann surface M provided with a cyclic order of its q critical values, determines an homogeneous tessellation of the Riemann surface M, whose 2n tiles are topological q-gons with…
Let $p$ be an odd prime number and be an integer coprime to $p$. We survey an algorithm for computing explicit rational representations of $(\ell,...,\ell)$-isogenies between Jacobians of hyperelliptic curves of arbitrary genus over an…
This paper focuses on the problem of reconstructing a vector of rational functions given some evaluations, or more generally given their remainders modulo different polynomials. The special case of rational functions sharing the same…
We show that the ring of multisymmetric functions over a commutative ring is isomorphic to the ring generated by the coefficients of the characteristic polynomial of polynomials in commuting generic matrices. As a consequence we give a…
For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…
The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$. If $q$ or $q-1$ is a…
The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…
A block cipher is intended to be computationally indistinguishable from a random permutation of appropriate domain and range. But what are the properties of a random permutation? By the aid of exponential and ordinary generating functions,…
A rational function is the ratio of two complex polynomials in one variable without common roots. Its degree is the maximum of the degrees of the numerator and the denominator. Rational functions belong to the same class if one turns into…
Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…
We consider the problem of constructing quantum operations or channels, if they exist, that transform a given set of quantum states $\{\rho_1, \dots, \rho_k\}$ to another such set $\{\hat\rho_1, \dots, \hat\rho_k\}$. In other words, we must…
For $q$ a prime power and $\phi$ a rational function with coefficients in $\mathbb{F}_q$, let $p(q,\phi)$ be the proportion of $\mathbb{P}^1(\mathbb{F}_q)$ that is periodic with respect to $\phi$. And if $d$ is a positive integer, let $Q_d$…
We consider the connection of functional decompositions of rational functions over the real and complex numbers, and a question about curves on a Riemann sphere which are invariant under a rational function.
The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…
We describe two general mechanisms for producing pairing bijections (bijective functions defined from N x N to N). The first mechanism, using n-adic valuations results in parameterized algorithms generating a countable family of distinct…
We describe birational representations of discrete groups generated by involutions, having their origin in the theory of exactly solvable vertex-models in lattice statistical mechanics. These involutions correspond respectively to two kinds…
Let $r$ be a positive integer, $h(X)\in\Bbb F_{q^2}[X]$, and $\mu_{q+1}$ be the subgroup of order $q+1$ of $\Bbb F_{q^2}^*$. It is well known that $X^rh(X^{q-1})$ permutes $\Bbb F_{q^2}$ if and only if $\text{gcd}(r,q-1)=1$ and…
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…
Often, polynomials or rational functions, orthogonal for a particular inner product are desired. In practical numerical algorithms these polynomials are not constructed, but instead the associated recurrence relations are computed.…