Title: Simultaneous prime specializations of polynomials over finite fields
Abstract: Proceedings of the London Mathematical SocietyVolume 97, Issue 3 p. 545-567 Articles Simultaneous prime specializations of polynomials over finite fields Paul Pollack, Corresponding Author Paul Pollack [email protected] 6188 Kemeny Hall, Mathematics Department, Dartmouth College, Hanover, NH, 03755 USA[email protected]Search for more papers by this author Paul Pollack, Corresponding Author Paul Pollack [email protected] 6188 Kemeny Hall, Mathematics Department, Dartmouth College, Hanover, NH, 03755 USA[email protected]Search for more papers by this author First published: 28 March 2008 https://doi.org/10.1112/plms/pdn013Citations: 11 This research was conducted while the author was supported by an NSF Graduate Research Fellowship. 2000 Mathematics Subject Classification 11T55 (primary), 11N32 (secondary). AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text accessShare full-text accessPlease review our Terms and Conditions of Use and check box below to share full-text version of article.I have read and accept the Wiley Online Library Terms and Conditions of UseShareable LinkUse the link below to share a full-text version of this article with your friends and colleagues. Learn more.Copy URL Share a linkShare onEmailFacebookTwitterLinkedInRedditWechat Abstract Recently the author proposed a uniform analogue of the Bateman–Horn conjectures for polynomials with coefficients from a finite field (that is, for polynomials in Fq[T] rather than Z[T]). Here we use an explicit form of the Chebotarev density theorem over function fields to prove this conjecture in particular ranges of the parameters. We give some applications including the solution of a problem posed by Hall. Citing Literature Volume97, Issue3November 2008Pages 545-567 RelatedInformation
Publication Year: 2008
Publication Date: 2008-03-28
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 18
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot