اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدBlock designs and prime values of polynomials
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 Lis 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.
قيم البحث
اقرأ أيضاً
This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ ageq 1$ and $ qgeq 1$ of opposite parity. For a large number $xgeq1$, an asymptotic result of the form $sum_{nleq x^{1/2},, n te
xt{ odd}}Lambda(qn^2+a)gg qx^{1/2}/2varphi(q)$ is achieved for $qll (log x)^b$, where $ bgeq 0 $ is a constant.
Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)cdots f(m)$. We prove that if $m > max{10^{12},4^{n+1}}$, then there exists a prime divisor $p$ of $P_{m,n
}$ such that ord$_{p}(P_{m,n} )leq ncdot 2^{n-1}$. For $n=2$, we establish that for every positive integer $m$, there exists a prime divisor $p$ of $P_{m,2}$ such that ord$_{p} (P_{m,2}) leq 4$. Consequently, $P_{m,2}$ is never a fifth or higher power. This extends work of Cilleruelo who studied the case $n=1$.
We study two polynomial counting questions in arithmetic statistics via a combination of Fourier analytic and arithmetic methods. First, we obtain new quantitative forms of Hilberts Irreducibility Theorem for degree $n$ polynomials $f$ with $mathrm{G
al}(f) subseteq A_n$. We study this both for monic polynomials and non-monic polynomials. Second, we study lower bounds on the number of degree $n$ monic polynomials with almost prime discriminants, as well as the closely related problem of lower bounds on the number of degree $n$ number fields with almost prime discriminants.
Let $K/k$ be an extension of number fields, and let $P(t)$ be a quadratic polynomial over $k$. Let $X$ be the affine variety defined by $P(t) = N_{K/k}(mathbf{z})$. We study the Hasse principle and weak approximation for $X$ in three cases. For $[K:k
]=4$ and $P(t)$ irreducible over $k$ and split in $K$, we prove the Hasse principle and weak approximation. For $k=mathbb{Q}$ with arbitrary $K$, we show that the Brauer-Manin obstruction to the Hasse principle and weak approximation is the only one. For $[K:k]=4$ and $P(t)$ irreducible over $k$, we determine the Brauer group of smooth proper models of $X$. In a case where it is non-trivial, we exhibit a counterexample to weak approximation.
Let $D$ be a negative integer congruent to $0$ or $1bmod{4}$ and $mathcal{O}=mathcal{O}_D$ be the corresponding order of $ K=mathbb{Q}(sqrt{D})$. The Hilbert class polynomial $H_D(x)$ is the minimal polynomial of the $j$-invariant $ j_D=j(mathbb{C}/m
athcal{O})$ of $mathcal{O}$ over $K$. Let $n_D=(mathcal{O}_{mathbb{Q}( j_D)}:mathbb{Z}[ j_D])$ denote the index of $mathbb{Z}[ j_D]$ in the ring of integers of $mathbb{Q}(j_D)$. Suppose $p$ is any prime. We completely determine the factorization of $H_D(x)$ in $mathbb{F}_p[x]$ if either $p mid n_D$ or $p mid D$ is inert in $K$ and the $p$-adic valuation $v_p(n_D)leq 3$. As an application, we analyze the key space of Oriented Supersingular Isogeny Diffie-Hellman (OSIDH) protocol proposed by Col`o and Kohel in 2019 which is the roots set of the Hilbert class polynomial in $mathbb{F}_{p^2}$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
