We give Deterministic Primality tests for large families of numbers. These tests were inspired in the recent and celebrated Agrawal-Kayal-Saxena (AKS) test. The AKS test has proved polynomial complexity O ((log n)^12) and they expect it to be O ((log n)^6) . Our tests have proved complexity O ((log n)^6). The complexity decreases to O ((log n)^4) as the power of 2 dividing n + 1 or n - 1 increases. On large enough primes, our tests, in their worst case, run at least 2^9 times faster than the AKS test.
A cyclotomic polynomial Φ_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of the coefficients is not completely understood. Here we establish some results and formulate some conjectures regarding the coefficients appearing in the polynomial family Φ_{pqr}(x) with p<q<r, p and q fixed and r a free prime.
We study the first and second mollified moments of central values of a quadratic family of Hecke $L$-functions of prime moduli to show that more than nine percent of the members of this family do not vanish at the central values.
We prove a general family of congruences for Bernoulli numbers whose index is a polynomial function of a prime, modulo a power of that prime. Our family generalizes many known results, including the von Staudt--Clausen theorem and Kummer's congruence.
The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$) dilated versions of the so-called Chebyshev polynomials of the fourth kind, also known as airfoil polynomials. It is proved that when the value of $n$ is given by a dilated Chebyshev polynomial of the first kind evaluated at a suitable integer, either the sequence contains a single prime, or no term is prime. For all other values of $n$, it is conjectured that …
We extend the Siegel-Walfisz theorem to a family of integer sequences that are characterized by constraints on the size of the prime factors. Besides prime powers, this family includes smooth numbers, almost primes and practical numbers.
A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that $t^q-p$ is monogenic, is bigger or equal than $(q-1)/q$. We will also prove that, when $q=3$, the density of primes $p$, which $\mathbb{Q}(\sqrt[3]{p})$ is non-monogenic, is at least 1/9.
We study the asymptotic behavior of a family of algebraic geometry codes which are 4-quasi transitive linear codes. We prove that this family is asymptotically good over many prime fields using towers of algebraic function fields.
In this paper, we study the one level density of low-lying zeros of a family of quadratic Hecke $L$-functions to prime moduli over the Gaussian field under the generalized Riemann hypothesis (GRH) and the ratios conjecture. As a corollary, we deduce that at least $75 \%$ of the members of this family do not vanish at the central point under GRH.
Let $n$ be an integer such that $n = 5$ or $n \geq 7$. In this article, we introduce a recipe for a certain infinite family of non-singular plane curves of degree $n$ which violate the local-global principle. Moreover, each family contains infinitely many members which are not geometrically isomorphic to each other. Our construction is based on two arithmetic objects; that is, prime numbers of the form $X^{3}+NY^{3}$ due to Heath-Brown and Moroz and the Fermat type equation of the form $x^{3}+Ny^{3} = Lz^{n}$, where $N$ and $L$ are suitably chosen integers. In this sense, our construction is a…
Let $\F$ be a family of $r$ integral forms of degree $k\geq 2$ and $\LL=(l_1,\ldots,l_m)$ be a family of pairwise linearly independent linear forms in $n$ variables $\x=(x_1,...,x_n)$. We study the number of solutions $\x\in[1,N]^n$ to the diophantine system $\F(\x)=\vv$ under the restriction that $l_i(\x)$ has a bounded number of prime factors for each $1\leq i\leq m$. We show that the system $\F$ have the expected number of such "almost prime" solutions under similar conditions as was established for existence of integer solutions by Birch.
We prove for primes $p\ge 5$ a conjecture of Coleman on the analytic continuation of the family of modular functions $\frac{E^\ast_κ}{V(E^\ast_κ)}$ derived from the family of Eisenstein series $E^\ast_κ$. The precise, quantitative formulation of the conjecture involved a certain on $p$ depending constant. We show by an example that the conjecture with the constant that Coleman conjectured cannot hold in general for all primes. On the other hand, the constant that we give is also shown not to be optimal in all cases. The conjecture is motivated by its connection to certain central statements in…
We present a primality criterium based on congruences for cyclotomic polynomials, and point out a way to generalize our result in order to obtain a family of similar criteria. No practical use is aimed however.
We construct an infinite family of representations of finite groups with an irreducible adjoint action and we give an application to the question of lacunary of Frobenius traces in Galois representations.
We study the splitting fields of the family of polynomials $f_n(X)= X^n-X-1$. This family of polynomials has been much studied in the literature and has some remarkable properties. Serre related the function on primes $N_p(f_n)$, for a fixed $n \leq 4$ and $p$ a varying prime, which counts the number of roots of $f_n(X)$ in $\mathbb F_p$ to coefficients of modular forms. We study the case $n=5$, and relate $N_p(f_5)$ to mod $5$ modular forms over $\mathbb Q$, and to characteristic 0, parallel weight 1 Hilbert modular forms over $\mathbb Q(\sqrt{19 \cdot 151})$.
In this paper, we study central values of the family of quadratic twists of modular $L$-functions of moduli $8p$, with $p$ ranging over odd primes. Assuming the truth of the generalized Riemann hypothesis, we establish a positive proportion non-vanishing result for the corresponding $L$-values.
The main result of this paper is to extend from $\Q$ to each of the nine imaginary quadratic fields of class number one a result of Serre (1987) and Mestre-Oesterlé (1989), namely that if $E$ is an elliptic curve of prime conductor then either $E$ or a $2$-, $3$- or $5$-isogenous curve has prime discriminant. For four of the nine fields, the theorem holds with no change, while for the remaining five fields the discriminant of a curve with prime conductor is either prime or the square of a prime. The proof is conditional in two ways: first that the curves are modular, so are associated to suita…
In this paper we show there exists an infinite family of number fields $L$, Galois over $\mathbb{Q}$, for which the smallest prime $p$ of $\mathbb{Q}$ which splits completely in $L$ has size at least $( \log(|D_L|) )^{2+o(1)}$. This gives a converse to various upper bounds, which shows that they are best possible.
Given any positive integer $n$, it is well-known that there always exists a triangle with rational sides $a,b$ and $c$ such that the area of the triangle is $n$. For a given prime $p \not \equiv 1$ modulo $8$ such that $p^{2}+1=2q$ for a prime $q$, we look into the possibility of the existence of the triangles with rational sides with $p$ as the area and $\frac{1}{p}$ as $\tan \fracθ{2}$ for one of the angles $θ$. We also discuss the relation of such triangles with the solutions of certain Diophantine equations.
In this paper, we study the $k$-th moment of central values of the family of quadratic Dirichlet $L$-functions of moduli $8p$, with $p$ ranging over odd primes. Assuming the truth of the generlized Riemann hypothesis, we establish sharp upper and lower bounds for the $k$-th power moment of these $L$-values for all real $k \geq 0$.
We compute modular forms known to arise from the order 5 generators of the 5-local Adams-Novikov spectral sequence 2-line, generalizing and contextualizing previous computations of M. Behrens and G. Laures. We exhibit analogous computations at other primes and conjecture formulas for some of the modular forms arising in this way at arbitrary primes greater than or equal to 5.
We adapt a known technique for searching for ideal classes of arbitrary order and then apply it to three families of number fields. We show that a family of cyclic sextic number fields has infinitely many fields in it that contain a relative ideal class of order $r,$ where $r$ is a positive integer relatively prime to the degree of the extension. We then show that the same holds true for a family of cyclic quartic number fields. Though the technique is traditionally applied to Galois extensions, we show how it may be adapted to handle a family of non-Galois cubic number fields and prove that t…
Let $E$ be an elliptic curve over $\Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(\Bbb{Q})$ be the group of $\Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $E^{(p)}(\Bbb{Q})$ has positive rank, and there are infinitely many primes $q$ for which $E^{(q)}(\Bbb{Q})$ has rank $0$. In this paper, assuming the parity conjecture, we show that for infinitely many…
A unitary cyclotomic polynomial of order three is a polynomial of the form \[ Φ^*_{PQR}(x)=\frac{(x^{PQR}-1)(x^P-1)(x^Q-1)(x^R-1)}{(x^{PQ}-1)(x^{QR}-1)(x^{RP}-1)(x-1)}, \] where $P$, $Q$ and $R$ are powers of three distinct primes $p$, $q$ and $r$. Fixing any such prime triple generates a family of these polynomials corresponding to all possible choices of $P=p^a$, $Q=q^b$ and $R=r^c$. We study the coefficients of polynomials in such a family. In particular, we show that the coefficients of polynomials in every such family cover all of $\mathbb{Z}$.
In this work, we prove the following result(Theorem 1): Suppose that n is a positive integer, p an odd prime, and such that either n is congruent to 0 modulo4 and p congruent to 3 modulo8; or alternatively, n is congruent to 2 modulo4 and p congruent to 7 modulo 8. In addition to the above, assume that one of the following holds: Either (i) n^2-p>0 and the positive integer is a prime, Or (ii) n^2-p<0 and the positive integer N=-m=-(n^2-p) is a prime. Then the diophantine equation x^4 +2nx^2y^2+my^4=z^2 has no positive integer solutions. The method of proof is elementary in that it only uses co…
Let $η>0$ be a fixed positive number, let $N$ be a sufficiently large number. In this paper, we study the second moment of the sum of Hecke eigenvalues over primes in short intervals (whose length is $η\log N$) on average (with some weights) over the family of weight $k$ holomorphic Hecke cusp forms. We also generalize the above result to Hecke-Maass cusp forms for $SL(2,\mathbb{Z})$ and $SL(3,\mathbb{Z}).$ By applying the Hardy-Littlewood prime 2-tuples conjecture, we calculate the exact values of the mean values.
The paper is about an arithmetic problem in $\F_2[x]$. We give \emph{admissible} (necessary) conditions satisfied by a set of odd prime divisors of perfect polynomials over $\F_2$. This allows us to prove a new characterization of \emph{all} known perfect polynomials, and to open a way of finding more of them (if they exist).
This paper studies infinite class field towers of number fields $K$ that are ramified over $\Q$ only at one finite prime. In particular, we show the existence of such towers for a general family of primes including $p=2$, 3 and 5.
We build on the work of Drakakis et al. (2011) on the maximal cross-correlation of the families of Welch and Golomb Costas permutations. In particular, we settle some of their conjectures. More precisely, we prove two results. First, for a prime $p\ge 5$, the maximal cross-correlation of the family of the $φ(p-1)$ different Welch Costas permutations of $\{1,\ldots,p-1\}$ is $(p-1)/t$, where $t$ is the smallest prime divisor of $(p-1)/2$ if $p$ is not a safe prime and at most $1+p^{1/2}$ otherwise. Here $φ$ denotes Euler's totient function and a prime $p$ is a safe prime if $(p-1)/2$ is also pr…
For any odd prime $p,$ we construct an infinite family of pairs of imaginary quadratic fields $\mathbb{Q}(\sqrt{d}),\mathbb{Q}(\sqrt{d+1})$ whose class numbers are both divisible by $p.$ One of our theorems settles Iizuka's conjecture for the case $n=1$ and $p >2.$
Complete characterization of $2$-near perfect numbers with exactly 2 prime factors
University of Notre Dame（圣母大学）；Yale University（耶鲁大学）；California Institute of Technology（加州理工学院）；Massachusetts Institute of Technology（麻省理工学院）；Hopkins School（霍普金斯中学）
For all $k \geq 3$, we show how one can explicitly construct an infinite family of $k$-regular graphs all of which have second largest eigenvalue satisfying the bound $O(k^{1/2})$. This resolves an open problem of Reingold, Vadhan and Wigderson.
Let $p$ be a large prime, $\ell\geq 2$ be a positive integer, $m\geq 2$ be an integer relatively prime to $\ell$ and $P(x)\in\mathbb{F}_p[x]$ be a polynomial which is not a complete $\ell'$-th power for any $\ell'$ for which $GCD(\ell',\ell)=1$. Let $\mathcal{C}$ be the curve defined by the equation $y^{\ell}=P(x)$, and take the points on $\mathcal{C}$ to lie in the rectangle $[0,p-1]^2$. In this paper, we study the distribution of the number of points on $\mathcal{C}$ inside a small rectangle among residue classes modulo $m$ when we move the rectangle around in $[0,p-1]^2$.
A k-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only k bits of the codeword C(x), even after some constant fraction of codeword bits has been corrupted. The major goal of LDC related research is to establish the optimal trade-off between length and query complexity of such codes. Recently [Y] introduced a novel technique for constructing locally decodable codes and vastly improved the upper bounds for code length. The technique is based on Mersenne primes. In this pap…
