arXiv subjects

Jeremy Rouse

Publications and source records attributed to Jeremy Rouse.

36 records · Page 2Linked to original sources

arXiv2016

Quadratic forms representing all integers coprime to 3

Following Bhargava and Hanke's celebrated 290-theorem, we prove a universality theorem for all positive-definite integer-valued quadratic forms that represent all positive integers coprime to $3$. In particular, if a positive-definite quadratic form represents all positive integers coprime to $3$ and $\leq 290$, then it represents all positive integers coprime to $3$. We use similar methods to those used by Rouse to prove (assuming GRH) that a positive-definite quadratic form representing every odd integer between $1$ and $451$ represents all positive odd integers.

math.NT↗

arXiv2016

When is $a^{n} + 1$ the sum of two squares?

Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares for all $n \in \mathbb{N}$ if and only if $a$ is a perfect square. We also prove that for $a\equiv 0,1,2\pmod{4},$ if $a^{n} + 1$ is the sum of two squares, then $a^δ + 1$ is the sum of two squares for all $δ| n, \ δ>1$. Using Aurifeuillian factorization, we show that if $a$ is a prime and $a\equiv 1 \pmod{4}$, then there are either zero or infinitely many odd $n$ such that $a^n+1$ is the sum of two squares. When $a\equiv 3\pmod{4},$ we define $m$ to be the least positive integer such that $\frac{a+1}{m}$ is the sum of two squares, and prove that if $a^n+1$ is the sum of two squares for any odd integer $n,$ then $m | n$, and both $a^m+1$ and $\frac{n}{m}$ are sums of two squares.

math.NT↗

arXiv2016

Sum of two repdigits a square

A \emph{repdigit} is a natural number greater than 10 which has all of its base-10 digits the same. In this paper we find all examples of two repdigits adding to a square. The proofs lead to interesting questions about consecutive quadratic residues and non-residues, and provide an elementary application of elliptic curves.

math.NT↗

arXiv2016

The density of primes dividing a particular non-linear recurrence sequence

Define the sequence $\{b_n\}$ by $b_0=1,b_1=1, b_2=2,b_3=1$, and $$b_n=\begin{cases} \frac{b_{n-1}b_{n-3}-b_{n-2}^2}{b_{n-4}}&\textrm{if}~ n\not\equiv 0\pmod 3, \frac{b_{n-1}b_{n-3}-3b_{n-2}^2}{b_{n-4}}&\textrm{if}~ n\equiv 0\pmod 3. We relate this sequence $\{b_n\}$ to the coordinates of points on the elliptic curve $E:y^2+y=x^3-3x+4$. We use Galois representations attached to $E$ to prove that the density of primes dividing a term in this sequence is equal to $\frac{179}{336}$. Furthermore, we describe an infinite family of elliptic curves whose Galois images match that of $E$.

math.NT↗

arXiv2015

Trinomials defining quintic number fields

Given a quintic number field $K/\mathbb{Q}$, we study the set of irreducible trinomials, polynomials of the form $x^{5} + ax + b$, that have a root in $K$. We show that there is a genus four curve $C_{K}$ whose rational points are in bijection with such trinomials. This curve $C_{K}$ maps to an elliptic curve defined over a number field, and using this map, we are able (in some cases) to determine all the rational points on $C_{K}$ using elliptic curve Chabauty.

math.NT↗

arXiv2015

The density of primes dividing a term in the Somos-5 sequence

The Somos-5 sequence is defined by $a_{0} = a_{1} = a_{2} = a_{3} = a_{4} = 1$ and $a_{m} = \frac{a_{m-1} a_{m-4} + a_{m-2} a_{m-3}}{a_{m-5}}$ for $m \geq 5$. We relate the arithmetic of the Somos-5 sequence to the elliptic curve $E : y^{2} + xy = x^{3} + x^{2} - 2x$ and use properties of Galois representations attached to $E$ to prove the density of primes $p$ dividing some term in the Somos-5 sequence is equal to $\frac{5087}{10752}$.

math.NT↗

arXiv2015

Three consecutive almost squares

Given a positive integer $n$, we let ${\rm sfp}(n)$ denote the squarefree part of $n$. We determine all positive integers $n$ for which $\max \{ {\rm sfp}(n), {\rm sfp}(n+1), {\rm sfp}(n+2) \} \leq 150$ by relating the problem to finding integral points on elliptic curves. We also prove that there are infinitely many $n$ for which \[ \max \{ {\rm sfp}(n), {\rm sfp}(n+1), {\rm sfp}(n+2) \} < n^{1/3}. \]

math.NT↗

arXiv2015

Elliptic curves over $\mathbb{Q}$ and 2-adic images of Galois

We give a classification of all possible $2$-adic images of Galois representations associated to elliptic curves over $\mathbb{Q}$. To this end, we compute the 'arithmetically maximal' tower of 2-power level modular curves, develop techniques to compute their equations, and classify the rational points on these curves.

math.NT↗

arXiv2014

On spaces of modular forms spanned by eta-quotients

An eta-quotient of level $N$ is a modular form of the shape $f(z) = \prod_{δ| N} η(δz)^{r_δ}$. We study the problem of determining levels $N$ for which the graded ring of holomorphic modular forms for $Γ_{0}(N)$ is generated by (holomorphic, respectively weakly holomorphic) eta-quotients of level $N$. In addition, we prove that if $f(z)$ is a holomorphic modular form that is non-vanishing on the upper half plane and has integer Fourier coefficients at infinity, then $f(z)$ is an integer multiple of an eta-quotient. Finally, we use our results to determine the structure of the cuspidal subgroup of $J_{0}(2^{k})(\mathbb{Q})$.

math.NT↗

arXiv2014

On the existence of large degree Galois representations for fields of small discriminant

Let $L/K$ be a Galois extension of number fields. We prove two lower bounds on the maximum of the degrees of the irreducible complex representations of ${\rm Gal}(L/K)$, the sharper of which is conditional on the Artin Conjecture and the Generalized Riemann Hypothesis. Our bound is nontrivial when $[K : \mathbb{Q}]$ is small and $L$ has small root discriminant, and might be summarized as saying that such fields can't be "too abelian."

math.NT↗

arXiv2013

Quadratic forms representing all odd positive integers

We consider the problem of classifying all positive-definite integer-valued quadratic forms that represent all positive odd integers. Kaplansky considered this problem for ternary forms, giving a list of 23 candidates, and proving that 19 of those represent all positive odds. (Jagy later dealt with a 20th candidate.) Assuming that the remaining three forms represent all positive odds, we prove that an arbitrary, positive-definite quadratic form represents all positive odds if and only if it represents the odd numbers from 1 up to 451. This result is analogous to Bhargava and Hanke's celebrated 290-theorem. In addition, we prove that these three remaining ternaries represent all positive odd integers, assuming the generalized Riemann hypothesis. This result is made possible by a new analytic method for bounding the cusp constants of integer-valued quaternary quadratic forms $Q$ with fundamental discriminant. This method is based on the analytic properties of Rankin-Selberg $L$-functions, and we use it to prove that if $Q$ is a quaternary form with fundamental discriminant, the largest locally represented integer $n$ for which $Q(\vec{x}) = n$ has no integer solutions is $O(D^{2 + ε})$.

math.NT↗

arXiv2012

Divisibility properties of the Fibonacci entry point

For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $ζ(m)$, the density of primes $p$ for which $m | Z(p)$ on the basis of numerical evidence. We prove Bruckman and Anderson's conjecture by studying the algebraic group $G : x^{2} - 5y^{2} = 1$ and relating $Z(p)$ to the order of $α= (3/2,1/2) \in G(\F_{p})$. We are then able to use Galois theory and the Chebotarev density theorem to compute $ζ(m)$.

math.NT↗

arXiv2012

Solutions of the cubic Fermat equation in quadratic fields

We give necessary and sufficient conditions on a squarefree integer $d$ for there to be non-trivial solutions to $x^{3} + y^{3} = z^{3}$ in $\Q(\sqrt{d})$, conditional on the Birch and Swinnerton-Dyer conjecture. These conditions are similar to those obtained by J. Tunnell in his solution to the congruent number problem.

math.NT↗

arXiv2012

A 60,000 digit prime number of the form $x^{2} + x + 41$

Motivated by Euler's observation that the polynomial $x^{2} + x + 41$ takes on prime values for $0 \leq x \leq 39$, we search for large values of $x$ for which $N = x^{2} + x + 41$ is prime. To apply classical primality proving results based on the factorization of $N-1$, we choose $x$ to have the form $g(y)$, chosen so that $g(y)^{2} + g(y) + 40$ is reducible. Our main result is an explicit, 60,000 digit prime number of the form $x^{2} + x + 41$.

math.NT↗

arXiv2011

Explicit bounds for sums of squares

For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $ρ_{2k}(n) \asymp n^{k-1}$. Deligne's bound on the Fourier coefficients of Hecke eigenforms gives that $r_{2k}(n) = ρ_{2k}(n) + O(d(n) n^{\frac{k-1}{2}})$. We determine the optimal implied constant in this estimate provided that either $k/2$ or $n$ is odd. The proof requires a delicate positivity argument involving Petersson inner products.

math.NT↗

arXiv2011

Bounds for coefficients of cusp forms and extremal lattices

A cusp form $f(z)$ of weight $k$ for $\SL_{2}(\Z)$ is determined uniquely by its first $\ell := \dim S_{k}$ Fourier coefficients. We derive an explicit bound on the $n$th coefficient of $f$ in terms of its first $\ell$ coefficients. We use this result to study the non-negativity of the coefficients of the unique modular form of weight $k$ with Fourier expansion \[F_{k,0}(z) = 1 + O(q^{\ell + 1}).\] In particular, we show that $k = 81632$ is the largest weight for which all the coefficients of $F_{0,k}(z)$ are non-negative. This result has applications to the theory of extremal lattices.

math.NT↗

arXiv2011

On the sums of two cubes

We solve the equation $f(x,y)^3 + g(x,y)^3 = x^3 + y^3$ for homogeneous $f, g \in \mathbb C(x,y)$, completing an investigation begun by Viète in 1591. The usual addition law for elliptic curves and composition give rise to two binary operations on the set of solutions. We show that a particular subset of the set of solutions is ring-isomorphic to $\mathbb Z[e^{2 πi / 3}]$.

math.NT↗

arXiv2009

Galois theory of iterated endomorphisms

Given an abelian algebraic group $A$ over a global field $F$, $α\in A(F)$, and a prime $\ell$, the set of all preimages of $α$ under some iterate of $[\ell]$ generates an extension of $F$ that contains all $\ell$-power torsion points as well as a Kummer-type extension. We analyze the Galois group of this extension, and for several classes of $A$ we give a simple characterization of when the Galois group is as large as possible up to constraints imposed by the endomorphism ring or the Weil pairing. This Galois group encodes information about the density of primes $\p$ in the ring of integers of $F$ such that the order of $(α\bmod{\p})$ is prime to $\ell$. We compute this density in the general case for several classes of $A$, including elliptic curves and one-dimensional tori. For example, if $F$ is a number field, $A/F$ is an elliptic curve with surjective 2-adic representation and $α\in A(F)$ with $α\not\in 2A(F(A[4]))$, then the density of $\mathfrak{p}$ with ($α\bmod{\p}$) having odd order is 11/21.

math.NT↗