Pages that link to "Item:Q1946103"

The following pages link to An iterative construction of irreducible polynomials reducible modulo every prime (Q1946103):

Displaying 17 items.

• On the existence of infinite, non-trivial \(F\)-sets (Q301404) (← links)
• Dynamical irreducibility of polynomials modulo primes (Q2043070) (← links)
• Algorithm for studying polynomial maps and reductions modulo prime number (Q2117423) (← links)
• Eventually stable quadratic polynomials over \(\mathbb{Q}\) (Q2190809) (← links)
• Irreducibility of iterates of post-critically finite quadratic polynomials over \(\mathbb{Q}\) (Q2288235) (← links)
• On iterated extensions of number fields arising from quadratic polynomial maps (Q2288314) (← links)
• On the irreducibility of the iterates of \(x^{n}-b\) (Q2781324) (← links)
• The Vojta conjecture implies Galois rigidity in dynamical families (Q2790911) (← links)
• Prime divisors in polynomial orbits over function fields (Q2980193) (← links)
• Eventually stable rational functions (Q4595069) (← links)
• The set of stable primes for polynomial sequences with large Galois group (Q4636733) (← links)
• Newly reducible polynomial iterates (Q5001863) (← links)
• Liberate Abstract Garbage Collection from the Stack by Decomposing the Heap (Q5041093) (← links)
• Riccati equations and polynomial dynamics over function fields (Q5217875) (← links)
• Current trends and open problems in arithmetic dynamics (Q5241203) (← links)
• On Sets of Irreducible Polynomials Closed by Composition (Q5267794) (← links)
• Sparsity of stable primes for dynamical sequences (Q6663906) (← links)