Related papers: Decompositions of Laurent polynomials

An algorithm is designed which decomposes a tropical univariate rational function into a composition of tropical binomials and trinomials. When a function is monotone, the composition consists just of binomials. Similar algorithms are…

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

The functional (de)composition of polynomials is a topic in pure and computer algebra with many applications. The structure of decompositions of (suitably normalized) polynomials f(x) = g(h(x)) in F[x] over a field F is well understood in…

We solve a generalization of B\"uchi's problem in any exponent for function fields, and briefly discuss some consequences on undecidability. This provides the first example where this problem is solved for rings of functions in the case of…

One relates factorization of bivariate polynomials to singularities of projective plane curves. One proves that adjoint polynomials permit to solve the recombinations of the modular factors induced by the absolute and rational…

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Let $G$ be a linearly reductive group acting on a vector space $V$, and $f$ a (semi-)invariant polynomial on $V$. In this paper we study systematically decompositions of the Bernstein-Sato polynomial of $f$ in parallel with some…

Let $f, g, h\in \mathbb{C}\left[x\right]$ be non-constant complex polynomials satisfying $f(x)=g(h(x))$ and let $f$ be lacunary in the sense that it has at most $l$ non-constant terms. Zannier proved that there exists a function $B_1(l)$ on…

We compute new polynomials with Galois group $M_{11}$ over $\mathbb{Q}(t)$. These polynomials stem from various families of covers of $\mathbb{P}^1\mathbb{C}$ ramified over at least 4 points. Each of these families has features that make a…

Our overall goal is to unify and extend some results in the literature related to the approximation of generating functions of finite and infinite sequences over a field by rational functions. In our approach, numerators play a significant…

Recently Dritschel proves that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another proof of the Dritschel theorem. Our proof is based on the univariate matrix…

This preprint is dedicated to a self contained simple proof of the classical criteria for representability of algebraic functions of several complex variables by radicals. It also contains a criteria for representability of algebroidal…

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…

In this paper we prove several results about the lattice of imprimitivity systems of a permutation group containing a cyclic subgroup with at most two orbits. As an application we generalize the first Ritt theorem about functional…

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

Let f be a G-function (in the sense of Siegel), and x be an algebraic number; assume that the value f(x) is a real number. As a special case of a more general result, we show that f(x) can be written as g(1), where g is a G-function with…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model computation over the real numbers. In this context the…

By establishing an interesting connection between ordinary Bell polynomials and rational convolution powers, some composition and inverse relations of Bell polynomials as well as explicit expressions for convolution roots of sequences are…

When Newton's method, or Halley's method is used to approximate the $p${th} root of $1-z$, a sequence of rational functions is obtained. In this paper, a beautiful formula for these rational functions is proved in the square root case,…