Explicit bounds for composite lacunary polynomials

DOI10.3336/GM.54.1.02MaRDI QIDQ5244439zbMATH OpenOpenAlexWikidataFDO

Authors Christina Karolus

Publication date 21 November 2019

Published in Glasnik Matematicki (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1704.04292, https://hrcak.srce.hr/file/322402

zbMATH Keywords

decomposable polynomialslacunary polynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09)

Abstract: Let $f,g,hinmathbbCleft[xight]$ 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 $mathbbN$, depending only on $l$ and with the property that $h(x)$ can be written as the ratio of two polynomials having each at most $B_1(l)$ terms. Here, we give explicit estimates for this function or, more precicely, we prove that one may take for instance [B_1(l)=(4l)^{(2l)^{(3l)^{l+1}}}.] Moreover, in the case $l=2$, a better result is obtained using the same strategy.

Recommendations

• On composite lacunary polynomials and the proof of a conjecture of Schinzel
• Composite rational functions expressible with few terms
• scientific article; zbMATH DE number 1305294
• Bounds for the roots of lacunary polynomials
• On the number of terms of a composite polynomial

Cited in

(4)

• Addendum to the paper: ``On the number of terms of a composite polynomial (Acta Arith. 127 (2007), 157–167)
• Lacunary Polynomial Compositions
• Composite rational functions expressible with few terms
• On composite lacunary polynomials and the proof of a conjecture of Schinzel

This page was built for publication: Explicit bounds for composite lacunary polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5244439)