An explicit polynomial analogue of Romanoff's theorem

DOI10.1016/j.ffa.2016.11.002zbMath1421.11096arXiv1510.08991OpenAlexW2962782598MaRDI QIDQ730369

Andreas J. Weingartner, Igor E. Shparlinski

Publication date: 27 December 2016

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.08991

zbMATH Keywords

polynomial ringirreducible polynomialmultiplicative orderRomanoff's theorem

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (3)

On a problem of Romanoff type ⋮ Extending an Erdős result on a Romanov type problem ⋮ Romanoff's theorem for polynomials over finite fields revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Squarefree polynomials and Möbius values in short intervals and arithmetic progressions
• On the function field analogue of Landau's theorem on sums of squares
• Irreducible values of polynomials
• A note on Romanov's constant
• On Romanoff's constant
• Sums of divisor functions in \(\mathbb {F}_q[t\) and matrix integrals]
• Prime polynomial values of linear functions in short intervals
• Prime polynomials in short intervals and in arithmetic progressions
• Arithmetic Correlations Over Large Finite Fields
• The Variance of the Number of Prime Polynomials in Short Intervals and in Residue Classes
• Hardy–Littlewood Tuple Conjecture Over Large Finite Fields
• Shifted convolution and the Titchmarsh divisor problem over 𝔽_q[t]
• A function field analogue of Romanoff's theorem
• A polynomial analogue of the twin prime conjecture
• VARIATIONS ON A THEME OF ROMANOFF
• Some problems in analytic number theory for polynomials over a finite field
• On integers of the form p+2^k

This page was built for publication: An explicit polynomial analogue of Romanoff's theorem