English
Related papers

Related papers: Functional composition of polynomials: indecomposa…

200 papers

We consider decompositions of processes of the form $Y=f(t,X_t)$ where $X$ is a semimartingale. The function $f$ is not required to be differentiable, so It\^{o}'s lemma does not apply. In the case where $f(t,x)$ is independent of $t$, it…

Probability · Mathematics 2010-01-26 George Lowther

The aim of the work is to construct new polynomial systems, which are solutions to certain functional equations which generalize the second-order differential equations satisfied by the so called classical orthogonal polynomial families of…

Classical Analysis and ODEs · Mathematics 2023-07-31 Edmundo J. Huertas , Alberto Lastra , Víctor Soto-Larrosa

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

In this paper, we study the structure of Newton polygons for compositions of polynomials over the rationals. We establish sufficient conditions under which the successive vertices of the Newton polygon of the composition $ g(f^n(x)) $ with…

Number Theory · Mathematics 2025-08-25 Anuj Jakhar , Shanta Laishram , Kotyada Srinivas , Prabhakar Yadav

The use of operational methods of different nature is shown to be a fairly powerful tool to study different problems regarding the theory of Legendre and Legendre-like polynomials. We show how the use of the well known integral…

Classical Analysis and ODEs · Mathematics 2020-02-17 S. Licciardi , G. Dattoli , R. M. Pidatell

A solution is proposed for the problem of composition of ordinary generating functions. A new class of functions that provides a composition of ordinary generating functions is introduced; main theorems are presented; compositae are written…

Combinatorics · Mathematics 2010-09-15 Kruchinin Vladimir Victorovich

The study of finiteness or infiniteness of integer solutions of a Diophantine equation has been considered as a standard problem in the literature. In this paper, for f(x) in Z[x] monic and q1 ,...., qm in Z, we study the conditions for…

Number Theory · Mathematics 2019-02-12 S. Subburam , J. Tanti

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.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

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…

Symbolic Computation · Computer Science 2020-01-01 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

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 investigate a family of Diophantine polynomial equations which involve continuant functions. In particular, given a polynomial $P(x)\in \mathbb{Z}[x]$ and $n\in \mathbb{N}$, we consider the equation $P(K_n(x_1,\ldots, x_n)) =…

Number Theory · Mathematics 2016-07-26 Dzmitry Badziahin

Necessary and sufficient conditions under which two real functions defined on the real interval can be separated by a polynomial are given. An immediate consequence of the main result is the existence of the polynomial separation of convex…

Functional Analysis · Mathematics 2008-07-28 Szymon Wasowicz

Let $\ell$ and $p$ be (not necessarily distinct) prime numbers and $F$ be a global function field of characteristic $\ell$ with field of constants $\kappa$. Assume that there exists a prime $P_\infty$ of $F$ which has degree $1$, and let…

Number Theory · Mathematics 2022-07-12 Anwesh Ray

For a polynomial map $\mathbf{f} : k^n \to k^m$ ($k$ a field), we investigate those polynomials $g \in k[t_1,\ldots, t_n]$ that can be written as a composition $g = h \circ \mathbf{f}$, where $h: k^m \to k$ is an arbitrary function. In the…

Commutative Algebra · Mathematics 2019-09-04 Erhard Aichinger

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

Classical Analysis and ODEs · Mathematics 2020-01-07 Teresa Augusta Mesquita

In this expository paper aimed at a general mathematical audience, we discuss how to combine certain classic theorems of set-theoretic inner model theory and effective descriptive set theory with work on Hilbert's tenth problem and…

Logic · Mathematics 2025-08-07 James E. Hanson

Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…

Combinatorics · Mathematics 2007-05-23 S. Gao , A. G. B. Lauder

In this paper decomposition of periodic orbits in bifurcation diagrams are derived in unidimensional dynamics system $x_{n+1}=f(x_{n};r)$, being $f$ an unimodal function. We proof a theorem which states the necessary and sufficient…

By the theory of elliptic curves, we investigate the nontrivial rational parametric solutions of the Diophantine equation $f(x)f(y)=f(z)^n$, where $n=1,2$ and $f(X)$ are some simple Laurent polynomials.

Number Theory · Mathematics 2018-02-06 Yong Zhang

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…

Cryptography and Security · Computer Science 2010-11-29 Shangwei Zhao , Ruyong Feng , Xiao-Shan Gao