Related papers: Rational functions admitting double decomposition

We introduce the notion of rationality for hyperholomorphic functions (functions in the kernel of the Cauchy-Fueter operator). Following the case of one complex variable, we give three equivalent definitions: the first in terms of…

The double zeta function was first studied by Euler in response to a letter from Goldbach in 1742. One of Euler's results for this function is a decomposition formula, which expresses the product of two values of the Riemann zeta function…

We say that a formal power series $\sum a_n z^n$ with rational coefficients is a 2-function if the numerator of the fraction $a_{n/p}-p^2 a_n$ is divisible by $p^2$ for every prime number $p$. One can prove that 2-functions with rational…

Starting from Ritt's classical theorems, we give a survey of results in functional decomposition of polynomials and of applications in Diophantine equations. This includes sufficient conditions for the indecomposability of polynomials, the…

A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…

The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…

Let K be a non archimedean algebraically closed field of characteristic pi complete for its ultrametric absolute value. In a recent paper by Escassut and Yang, polynomial decompositions P(f)=Q(g) for meromorphic functions f, g on K (resp.…

In this paper, we consider an extension of Jacobi's symbol, the so called rational $2^k$-th power residue symbol. In Section 3, we prove a novel generalization of Zolotarev's lemma. In Sections 4, 5 and 6, we show that several hard…

If g and h are functions over some field, we can consider their composition f = g(h). The inverse problem is decomposition: given f, determine the ex- istence of such functions g and h. In this thesis we consider functional decom- positions…

We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.

Let $A$ be a rational function. For any decomposition of $A$ into a composition of rational functions $A=U\circ V$ the rational function $\widetilde A=V\circ U$ is called an elementary transformation of $A$, and rational functions $A$ and…

Let the formal power series f in d variables with coefficients in an arbitrary field be a symmetric function decomposed as a series of Schur functions, and let f be a rational function whose denominator is a product of binomials of the form…

Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…

In 1922 Ritt described polynomial solutions of the functional equation P(f)=Q(g). In this paper we describe solutions of the equation above in the case when P,Q are polynomials while f,g are allowed to be arbitrary entire functions. In…

In this paper, we introduce new classes of functions that extend the known classes of functions of complex variable, such as entire functions, meromorphic functions, rational functions and polynomial functions and take values in the set of…

The Ehrhart quasipolynomial of a rational polytope $P$ encodes the number of integer lattice points in dilates of $P$, and the $h^*$-polynomial of $P$ is the numerator of the accompanying generating function. We provide two decomposition…

Ehrhart's famous theorem states that the number of integral points in a rational polytope is a quasi-polynomial in the integral dilation factor. We study the case of rational dilation factors and it turns out that the number of integral…

This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that…

Two theorems of J. F. Ritt on decompositions of polynomials maps are generalized to a more general situation: for, so-called, reduction monoids ($(K[x], \circ)$ and $(K[x^2]x, \circ)$ are examples of reduction monoids). In particular,…

In [J. Phys. A: Math. Theor. 45 (2012)], while looking for spin chains that admit perfect state transfer, Vinet and Zhedanov found an apparently new sequence of orthogonal polynomials, that they called para-Krawtchouk polynomials, defined…