Related papers: Decompositions of Laurent polynomials
First we recall the notion of conxity and log-convexity for real-valued. Then we generalize the trick used by Artin in his famous paper on the Gamma function to find log-convex solutions to the functional equations f(x+1)=g(x)f(x). This…
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…
Laurent polynomials related to the Hahn-Exton $q$-Bessel function, which are $q$-analogues of the Lommel polynomials, have been introduced by Koelink and Swarttouw. The explicit strong moment functional with respect to which the Laurent…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
In this paper we give a factorization theorem for the ring of exponential polynomials in many variables over an algebraically closed field of characteristic 0 with an exponentiation. This is a generalization of the factorization theorem due…
We first present a filtration on the ring L of Laurent polynomials such that the direct sum decomposition of its associated graded ring gr L agrees with the direct sum decomposition of gr L, as a module over the complex general linear Lie…
Using Galois theory of functional equations, we give a new proof of the main result of the paper "Transcendental transcendency of certain functions of Poincar\'e" by J.F. Ritt, on the differential transcendence of the solutions of the…
We study the polynomials $x^n + (1-x)^n + a^n, a \in\mathbb{Q}$, whose rational roots would yield counterexamples to Fermat's Last Theorem. We investigate their factorization over $\mathbb{Q}$. In the case $a \notin \{0, \pm 1\}$, we ask…
In this paper, we give a theoretical analysis for the algorithms to compute functional decomposition for multivariate polynomials based on differentiation and homogenization which are proposed by Ye, Dai, Lam (1999) and Faug$\mu$ere, Perret…
The extended L\"uroth's Theorem says that if the transcendence degree of $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)/\KK$ is 1 then there exists $f \in \KK(\underline{X})$ such that $\KK(\mathsf{f}_1,\dots,\mathsf{f}_m)$ is equal to $\KK(f)$. In…
We depart from our approximation of 2000 of all root radii of a polynomial, which has readily extended Sch{\"o}nhage's efficient algorithm of 1982 for a single root radius. We revisit this extension, advance it, based on our simple but…
Siegel defined in 1929 two classes of power series, the E-functions and G-functions, which generalize the Diophantine properties of the exponential and logarithmic functions respectively. In 1949, he asked whether any E-function can be…
We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…
Recently, Morier-Genoud and Ovsienko introduced a $q$-deformation of rational numbers. More precisely, for an irreducible fraction $\frac{r}s>0$, they constructed coprime polynomials $\mathcal{R}_{\frac{r}s}(q),~ \mathcal{S}_{\frac{r}s}(q)…
In this paper we study those polynomials orthogonal with respect to a particular weight over the union of disjoint intervals first introduced by N.I. Akhiezer, via a reformulation as a matrix factorization or Riemann-Hilbert problem. This…
Considering the L-function of exponential sums associated to a polynomial over a finite field F_q, Deligne proved that a reciprocal root's p-adic order is a rational number in the interval [0, 1]. Based on hypergeometric theory, in this…
Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…
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…
In a recent paper, Cristofaro-Gardiner--Li--Stanley [CGLS15] constructed examples of irrational triangles whose Ehrhart functions (i.e. lattice-point count) are polynomials when restricted to positive integer dilation factors. This is very…