An explicit polynomial analogue of Romanoff's theorem

DOI10.1016/J.FFA.2016.11.002zbMATH Open1421.11096arXiv1510.08991OpenAlexW2962782598MaRDI QIDQ730369FDOQ730369

Andreas Weingartner, Igor E. Shparlinski

Publication date: 27 December 2016

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

Abstract: Given a polynomial $g$ of positive degree over a finite field, we show that the proportion of polynomials of degree $n$, which can be written as $h+g^k$, where $h$ is an irreducible polynomial of degree $n$ and $k$ is a nonnegative integer, has order of magnitude $1/degg$.

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

Recommendations

• Romanoff's theorem for polynomials over finite fields revisited
• A polynomial analog of the Goldbach conjecture
• scientific article
• On an elementary density problem for polynomials over finite fields
• scientific article

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)

Cites Work

• Prime polynomials in short intervals and in arithmetic progressions
• Squarefree polynomials and Möbius values in short intervals and arithmetic progressions
• Title not available (Why is that?)
• On the function field analogue of Landau's theorem on sums of squares
• On Romanoff's constant
• On integers of the form p+2^k
• A note on Romanov's constant
• A function field analogue of Romanoff's theorem
• The variance of the number of prime polynomials in short intervals and in residue classes
• VARIATIONS ON A THEME OF ROMANOFF
• Irreducible values of polynomials
• Sums of divisor functions in \(\mathbb {F}_q[t]\) and matrix integrals
• Prime polynomial values of linear functions in short intervals
• Arithmetic correlations over large finite fields
• Hardy-Littlewood tuple conjecture over large finite fields
• Shifted convolution and the Titchmarsh divisor problem over 𝔽_q[t]
• A polynomial analogue of the twin prime conjecture
• Title not available (Why is that?)
• Some problems in analytic number theory for polynomials over a finite field

Cited In (9)

• On the factorization of iterated polynomials
• Extending an Erdős result on a Romanov type problem
• On an elementary density problem for polynomials over finite fields
• New Computational Paradigms
• Connections between Romanovski and other polynomials
• On a problem of Romanoff type
• The polynomial analogue of a theorem of Rényi
• Romanoff's theorem for polynomials over finite fields revisited
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730369)