Block designs and prime values of polynomials
From MaRDI portal
Publication:6367196
arXiv2105.03915MaRDI QIDQ6367196FDOQ6367196
Authors: Gareth Jones, Alexander K. Zvonkin 
Publication date: 9 May 2021
Abstract: A recent construction by Amarra, Devillers and Praeger of block designs with specific parameters depends on certain quadratic polynomials, with integer coefficients, taking prime power values. The Bunyakovsky Conjecture, if true, would imply that each of them takes infinitely many prime values, giving an infinite family of block designs with the required parameters. We have found large numbers of prime values of these polynomials, and the numbers found agree very closely with the estimates for them provided by Li's recent modification of the Bateman-Horn Conjecture. While this does not prove that these polynomials take infinitely many prime values, it provides strong evidence for this, and it also adds extra support for the validity of the Bunyakovsky and Bateman-Horn Conjectures.
Combinatorial aspects of block designs (05B05) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)
This page was built for publication: Block designs and prime values of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367196)
