Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\)
DOI10.1007/BF02985791zbMath1189.11055MaRDI QIDQ2580254
Kenneth Hicks, Gove Effinger, Gary L. Mullen
Publication date: 2005
Published in: The Mathematical Intelligencer (Search for Journal in Brave)
ring of polynomialsanalogues of Goldbach Conjecture and the Twin Primes Conjecturecomparison of the ring of integers and the ring of polynomials in one variable over a finite field
Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55) Euclidean rings and generalizations (13F07)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The development of the number field sieve
- A Goldbach 3-primes theorem for polynomials of low degree over finite fields of characteristic 2
- Primality testing and Abelian varieties over finite fields
- Digit systems in polynomial rings over finite fields
- PRIMES is in P
- A new efficient factorization algorithm for polynomials over small finite fields
- Heuristic Reasoning in the Theory of Numbers
- A Goldbach theorem for polynomials of low degree over odd finite fields
- A complete Vinogradov 3-primes theorem under the Riemann hypothesis
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Jumping Champions
- A Goldbach Theorem for Polynomials with Integral Coefficients
- The expression of a polynomial as a sum of three irreducibles
- On the deterministic complexity of factoring polynomials
This page was built for publication: Integers and polynomials: comparing the close cousins \(\mathbb Z\) and \(\mathbb F_q[x]\)
