On irreducible divisors of iterated polynomials (Q2256067): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Stabilité des polynômes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducibility of the iterates of a quadratic polynomial over a field / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem of Stickelberger / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prime factors of dynamical sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite rational functions expressible with few terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4248250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An estimate on the number of stable quadratic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830109 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4171/rmi/809 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037293272 / rank
 
Normal rank

Latest revision as of 10:13, 30 July 2024

scientific article
Language Label Description Also known as
English
On irreducible divisors of iterated polynomials
scientific article

    Statements

    On irreducible divisors of iterated polynomials (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2015
    0 references
    Summary: \textit{D. Gómez-Pérez} et al. [Rev. Mat. Iberoam. 30, No. 2, 523--535 (2014; Zbl 1319.11089)] have recently shown that for almost all polynomials \(f \in \mathbb F_q[X]\) over the finite field of \(q\) elements, where \(q\) is an odd prime power, their iterates eventually become reducible polynomials over \(\mathbb F_q\). Here we combine their method with some new ideas to derive finer results about the arithmetic structure of iterates of \(f\). In particular, we prove that the \(n\)th iterate of \(f\) has a square-free divisor of degree of order at least \(n^{1+o(1)}\) as \(n\to \infty\) (uniformly in \(q\)).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    iterated polynomials
    0 references
    character sum
    0 references
    ABC-conjecture
    0 references
    discriminant
    0 references
    resultant
    0 references
    Weil bound
    0 references
    Mason theorem
    0 references
    Stickelberger theorem
    0 references
    0 references