English
Related papers

Related papers: Prime and composite Laurent polynomials

200 papers

In the 1920's, Ritt studied the operation of functional composition g o h(x) = g(h(x)) on complex rational functions. In the case of polynomials, he described all the ways in which a polynomial can have multiple `prime factorizations' with…

Number Theory · Mathematics 2007-10-11 Michael E. Zieve

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…

Complex Variables · Mathematics 2009-09-21 F. Pakovich

Ritt studied the functional decomposition of a univariate complex polynomial f into prime (indecomposable) polynomials, f = u_1 o u_2 o ... o u_r. His main achievement was a procedure for obtaining any decomposition of f from any other by…

Algebraic Geometry · Mathematics 2008-07-24 Michael E. Zieve , Peter Mueller

J.Ritt has investigated the structure of complex polynomials with respect to superposition. In particular, he listed all the polynomials admitting different double decompositions into indecomposable polynomials. The analogues of Ritt theory…

Complex Variables · Mathematics 2013-12-03 Andrei Bogatyrev

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…

Number Theory · Mathematics 2015-03-19 Dijana Kreso , Robert F. Tichy

The classical Ritt's Theorems state several properties of univariate polynomial decomposition. In this paper we present new counterexamples to Ritt's first theorem, which states the equality of length of decomposition chains of a…

Commutative Algebra · Mathematics 2008-05-15 Jaime Gutierrez , David Sevilla

This diploma thesis is concerned with functional decomposition $f = g \circ h$ of polynomials. First an algorithm is described which computes decompositions in polynomial time. This algorithm was originally proposed by Zippel (1991). A…

Commutative Algebra · Mathematics 2011-07-05 Raoul Blankertz

In 1923 Schur considered the following problem. Let f(X) be a polynomial with integer coefficients that induces a bijection on the residue fields Z/pZ for infinitely many primes p. His conjecture, that such polynomials are compositions of…

Group Theory · Mathematics 2019-07-30 Robert M. Guralnick , Peter Müller , Jan Saxl

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

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…

Symbolic Computation · Computer Science 2010-05-03 Mark Giesbrecht

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.…

Complex Variables · Mathematics 2007-05-23 Eberhard Mayerhofer

Ritt's Second Theorem deals with composition collisions g o h = g* o h* of univariate polynomials over a field, where deg g = deg h*. Joseph Fels Ritt (1922) presented two types of such decompositions. His main result here is that these…

Commutative Algebra · Mathematics 2014-06-20 Joachim von zur Gathen

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. It is intuitively clear that the decomposable polynomials form a small minority among all polynomials over a finite field. The…

Commutative Algebra · Mathematics 2014-03-03 Konstantin Ziegler

The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…

Dynamical Systems · Mathematics 2015-06-26 Sergei Lysenko

In 1991, J. Thomson obtained a celebrated decomposition theorem for $P^t(\mu),$ the closed subspace of $L^t(\mu)$ spanned by the analytic polynomials, when $1 \le t < \i.$ In 2008, J. Brennan \cite{b08} generalized Thomson's theorem to…

Functional Analysis · Mathematics 2023-02-15 John B. Conway , Liming Yang

Let $\mathbb R_t[\theta]$ be the ring generated over $\mathbb R$ by $\cos\theta$ and $\sin\theta$, and $\mathbb R_t(\theta)$ be its quotient field. In this paper we study the ways in which an element p of $\mathbb R_t[\theta]$ can be…

Classical Analysis and ODEs · Mathematics 2017-07-11 F. Pakovich

The functional decomposition of polynomials has been a topic of great interest and importance in pure and computer algebra and their applications. The structure of compositions of (suitably normalized) polynomials f=g(h) over finite fields…

Commutative Algebra · Mathematics 2010-05-11 Joachim von zur Gathen , Mark Giesbrecht , Konstantin Ziegler

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…

Rings and Algebras · Mathematics 2012-01-24 Francesca Benanti , Silvia Boumova , Vesselin Drensky , Georgi K. Genov , Plamen Koev

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…

Complex Variables · Mathematics 2014-02-26 M. Muzychuk , F. Pakovich

Based on the definition of generalized partially bent functions, using the theory of linear transformation, the relationship among generalized partially bent functions over ring Z N, generalized bent functions over ring Z N and affine…

Cryptography and Security · Computer Science 2007-05-23 Jianqin Zhou
‹ Prev 1 2 3 10 Next ›