Irreducible polynomials over finite fields produced by composition of quadratics (Q2313565): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q2747613 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the existence of infinite, non-trivial \(F\)-sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Sets of Irreducible Polynomials Closed by Composition / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stable polynomials over finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Settled polynomials over finite fields / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2770573 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the length of critical orbits of stable quadratic polynomials / rank | |||
Normal rank |
Revision as of 23:29, 19 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Irreducible polynomials over finite fields produced by composition of quadratics |
scientific article |
Statements
Irreducible polynomials over finite fields produced by composition of quadratics (English)
0 references
19 July 2019
0 references
Summary: For a set \(S\) of quadratic polynomials over a finite field, let \(C\) be the (infinite) set of arbitrary compositions of elements in \(S\). In this paper we show that there are examples with arbitrarily large \(S\) such that every polynomial in \(C\) is irreducible. As a second result, when \(\#S > 1\), we give an algorithm to determine whether all the elements in \(C\) are irreducible, using only \(O(\#S(\log q)^3 q^{1/2} )\) operations.
0 references
finite fields
0 references
irreducible polynomials
0 references
dynamical systems
0 references