English
Related papers

Related papers: Decompositions of Laurent polynomials

200 papers

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…

Functional Analysis · Mathematics 2007-05-23 D. Alpay , M. Shapiro , D. Volok

We find analogues of the primitive divisor results of Zsigmondy, Bang, Bilu-Hanrot-Voutier, and Carmichael in polynomial rings, following the methods of Carmichael.

Number Theory · Mathematics 2013-05-28 Anthony Flatters , Thomas Ward

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

We prove a function field analogue of a conjecture of Schinzel on the factorization of univariate polynomials over the rationals. We derive from it a finiteness theorem for the irreducible factorizations of the bivariate Laurent polynomials…

Commutative Algebra · Mathematics 2018-12-19 Francesco Amoroso , Martín Sombra

In this paper we present algorithmic considerations and theoretical results about the relation between the orders of certain groups associated to the components of a polynomial and the order of the group that corresponds to the polynomial,…

Symbolic Computation · Computer Science 2008-05-15 Jaime Gutierrez , David Sevilla

Pourchet proved in 1971 that every nonnegative univariate polynomial with rational coefficients is a sum of five or fewer squares. Nonetheless, there are no known algorithms for constructing such a decomposition. The sole purpose of the…

Symbolic Computation · Computer Science 2023-02-07 Victor Magron , Przemysław Koprowski , Tristan Vaccon

In this paper we investigate the following existence problem for rational functions: for a given collection $\Pi$ of partitions of a number $n$ to define whether there exists a rational function $f$ of degree $n$ for which $\Pi$ is the…

Geometric Topology · Mathematics 2007-12-10 F. Pakovich

For positive integers d, r, and M, we consider the class of rational functions on real d-dimensional space whose denominators are products of at most r functions of the form 1+Q(x) where each Q is a quadratic form with eigenvalues bounded…

Functional Analysis · Mathematics 2007-09-18 R. M. Dudley , Sergiy Sidenko , Zuoqin Wang , Fangyun Yang

In this paper we determine possible decompositions of Euler polynomials $E_k(x)$, i.e. possible ways of writing Euler polynomials as a functional composition of polynomials of lower degree. Using this result together with the well-known…

Number Theory · Mathematics 2013-12-16 D. Kreso , Cs. Rakaczki

Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and integer coefficients. As to their relationship with respect…

Logic in Computer Science · Computer Science 2015-07-01 Friedrich Neurauter , Aart Middeldorp

In the article we develop Euler-Lagrange method and calculate all the roots of an arbitrary complex polynomial $P(z)$ on the base of calculation (similar to the Bernoulli-Aitken-Nikiporets methods) of the limits of ratios of Hadamard…

Classical Analysis and ODEs · Mathematics 2023-04-12 M. M. Chernyavskij , A. V. Lebedev , Yu. V. Trubnikov

We attach to normalized (non-vanishing) arithmetic functions $g$ and $h$ recursively defined polynomials. Let $P_0^{g,h}(x):=1$. Then \begin{equation} P_n^{g,h}(x) := \frac{x}{h(n)} \sum_{k=1}^{n} g(k) \, P_{n-k}^{g,h}(x). \end{equation}…

Number Theory · Mathematics 2020-11-23 Bernhard Heim , Markus Neuhauser

We study the problem of decomposition (non-commutative factorization) of linear ordinary differential operators near an irregular singular point. The solution (given in terms of the Newton diagram and the respective characteristic numbers)…

Classical Analysis and ODEs · Mathematics 2018-05-08 Leanne Mezuman , Sergei Yakovenko

Let h be a complex meromorphic function decomposed in two different ways P(f) and Q(g), where f, g are meromorphic functions and P, Q are rational functions. We follow an approach due to C.-C. Yang, P. Li and K. H. Ha who handle similar…

Complex Variables · Mathematics 2007-05-23 Alain Escassut , Eberhard Mayerhofer

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

In recent years, the so-called polynomial moment problem, motivated by the classical Poincare center-focus problem, was thoroughly studied, and the answers to the main questions have been found. The study of a similar problem for rational…

Complex Variables · Mathematics 2009-10-15 F. Pakovich , C. Pech , A. Zvonkin

We propose a novel method for reconstructing Laurent expansion of rational functions using $p$-adic numbers. By evaluating the rational functions in $p$-adic fields rather than finite fields, it is possible to probe the expansion…

High Energy Physics - Theory · Physics 2025-11-10 Tianya Xia , Li Lin Yang

In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombination strategy is the used of Darboux polynomials. We study…

Symbolic Computation · Computer Science 2014-02-26 Guillaume Chèze

A seminal result of E. Ehrhart states that the number of integer lattice points in the dilation of a rational polytope by a positive integer $k$ is a quasi-polynomial function of $k$ --- that is, a "polynomial" in which the coefficients are…

Combinatorics · Mathematics 2020-02-11 Tyrrell B. McAllister