Searcharxiv⌕ Search

arXiv subjects

Tim Trudgian

Publications and source records attributed to Tim Trudgian.

At least 19 recordsLinked to original sources

Burgess' bounds with prime moduli

Let $S_χ(N)= \sum_{n\leq N} χ(n)$, where $χ$ is a Dirichlet character modulo a prime $p$. For integral $r\geq 2$, Burgess gave bounds of the shape $S_χ(N) \ll N^{1-1/r} p^{(r+1)/(4r^{2})} \log p$. The factor of $\log p$ was reduced by several authors. We show that it can be removed completely.

math.NT↗

Determining norm-Euclidean complex cubic fields

We prove that Cavallar and Lemmermeyer's list of $58$ norm-Euclidean complex cubic fields is complete. The proof combines a classical discriminant bound with exact certificates of non-Euclideanity. The unit action reduces their verification to finite lattice enumeration with rigorous interval arithmetic. An independent covering computation confirms norm-Euclideanity for the $58$ fields.

math.NT↗

Zeros of quadratic Dirichlet $L$-functions

We consider Dirichlet $L$-functions $L(s, χ)$ where $χ$ is a quadratic character to modulus $q$. We show that for $χ$ even (resp. odd) $L(σ, χ)\neq 0$ for all $σ>0$ provided that $q\leq 10^{9}$ (resp. $q\leq 10^{10})$. In particular, this result rules out Siegel--Landau zeros for such $L$-functions. Combined, these results improve on previous work by nearly four orders of magnitude. We also list some applications of this work.

math.NT↗

The error term of the fourth moment of the Riemann zeta-function

We examine the size of $E_{2}(T)$, the error term in the asymptotic formula for $\int_{0}^{T} |ζ(1/2 + it)|^{4}\, dt$ where $ζ(s)$ is the Riemann zeta-function. We reduce the powers of $\log T$ in the known bounds for $E_{2}(T)$ and $\int_{0}^{T} E_{2}(t)^{2}\, dt$. As a consequence, we obtain small logarithmic improvements for $k$th moments where $8\leq k\leq 12$. In particular, we obtain $\int_0^T|ζ(1/2+it)|^{12}\,dt\ll T^2(\log T)^{15}$.

math.NT↗

The determination of norm-Euclidean cyclic cubic fields

It is known on the Generalised Riemann Hypothesis that there are precisely $13$ cyclic cubic fields that are norm-Euclidean. Unconditionally, there is a gap between analytic estimates which hold for all sufficiently large conductors and computational techniques. In this paper, we establish new results concerning explicit bounds for cubic non-residues and refine previous computational techniques, enabling us to completely characterise all norm-Euclidean cyclic cubic fields.

math.NT↗

A round of Pintz to celebrate oscillations in sums

We explore a method, going back to Landau and developed by Pintz, for connecting sums of arithmetic functions with zero-free regions for $L$-functions. In particular, we make explicit a general result of Pintz of this form; showing how one can use arithmetical information to deduce information about zeroes of $L$-functions, rather than the other way around. As a prototype, we work through an example with the Riemann zeta-function and sums of the Möbius function, but we also outline the utility of this method in general.

math.NT↗

An update on the Linnik--Goldbach problem

We consider the Linnik--Goldbach problem of writing all large even integers as the sum of two primes and a fixed number of powers of 2. We show that, under the generalised Riemann hypothesis, one can use 6 powers of two. In addition, we discuss refinements to the unconditional case and to the related problem of Romanov in expressing a positive proportion of odd numbers as the sum of a prime and a power of 2.

math.NT↗

Zero-free regions inspired by work of Heath-Brown

We prove a new explicit zero-free region for the Riemann zeta-function, drawing substantially on Heath-Brown's seminal work on Linnik's constant. Using these ideas we are able to prove that $ζ(σ+ it)\ne 0$ whenever $t\geq 3$ and $σ\geq 1- 1/(4.896\log t)$.

math.NT↗

Applying hypersurface bounds to a conjecture by Carlet

A function from $\mathbb{F}_{2^n}$ to $\mathbb{F}_{2^n}$ is $k$th order sum-free if the sum of its values over each $k$-dimensional $\mathbb{F}_2$-affine subspace is nonzero. It is conjectured that for $n$ odd and prime, $f_\textrm{inv}=x^{-1}$ is not $k$th order sum-free for $3 \leq k \leq n-3$. This is the unresolved part of Carlet's conjecture, which gives exact values for which $f_\textrm{inv}$ is $k$th order sum-free. We give two results as improvements on an explicit estimate on the number of $q$-rational points of an $\mathbb{F}_q$-definable hypersurface previously proved by Cafure and Matera. We use these results to prove that $f_\textrm{inv}$ is not $k$th order sum-free for $3\leq k \leq \frac{3}{13}n+0.461$, improving on work previously done by Hou and Zhao.

math.NT↗

New exponent pairs, zero density estimates, and zero additive energy estimates: a systematic approach

We obtain several new bounds on exponents of interest in analytic number theory, including four new exponent pairs, new zero density estimates for the Riemann zeta-function, and new estimates for the additive energy of zeroes of the Riemann zeta-function. These results were obtained by creating the Analytic Number Theory Exponent Database (ANTEDB) to collect results and relationships between these exponents, and then systematically optimising these relationships to obtain the new bounds. We welcome further contributions to the database, which aims to allow easy conversion of new bounds on these exponents into optimised bounds on other related exponents of interest.

math.NT↗

Primitive elements with prescribed traces

Given a prime power $q$ and a positive integer $n$, let $\mathbb{F}_{q^{n}}$ denote the finite field with $q^n$ elements. Also let $a,b$ be arbitrary members of the ground field $\mathbb{F}_{q}$. We investigate the existence of a non-zero element $ξ\in \mathbb{F}_{q^{n}}$ such that $ξ+ ξ^{-1}$ is primitive and $T(ξ)=a, T(ξ^{-1})=b$, where $T(ξ)$ denotes the trace of $ξ$ in $\mathbb{F}_{q}$. This was a question intended to be addressed by Cao and Wang in 2014. Their work dealt instead with another problem already in the literature. Our solution deals with all values of $n \geq 5$. A related study involves the cubic extension $\mathbb{F}_{q^{3}}$ of $\mathbb{F}_{q}$. We show that if $q\geq 8\cdot 10^{12}$ then, for any $a\in \mathbb{F}_{q}$ we can find a primitive element $ξ\in \mathbb{F}_{q^{3}}$ such that $ξ+ ξ^{-1}$ is also a primitive element of $\mathbb{F}_{q^{3}}$, and for which the trace of $ξ$ is equal to $a$. The improves a result of Cohen and Gupta. Along the way we prove a hybridised lower bound on prime divisors in various residue classes, which may be of interest to related existence questions.

math.NT↗

Primitive element pairs with a prescribed trace in the cubic extension of a finite field

We prove that for any prime power $q\notin\{3,4,5\}$, the cubic extension $\mathbb{F}_{q^3}$ of the finite field $\mathbb{F}_q$ contains a primitive element $ξ$ such that $ξ+ξ^{-1}$ is also primitive, and $\textrm{Tr}_{\mathbb{F}_{q^3}/\mathbb{F}_q}(ξ)=a$ for any prescribed $a\in\mathbb{F}_q$. This completes the proof of a conjecture of Gupta, Sharma, and Cohen concerning the analogous problem over an extension of arbitrary degree $n\ge3$.

math.NT↗

The error term in the prime number theorem

We make explicit a theorem of Pintz concerning the error term in the prime number theorem. This gives an improved version of the prime number theorem with error term roughly square-root of that which was previously known. We apply this to a long-standing problem concerning an inequality studied by Ramanujan.

math.NT↗

The distribution of $k$-free numbers

Let $R_k(x)$ denote the error incurred by approximating the number of $k$-free integers less than $x$ by $x/ζ(k)$. It is well known that $R_k(x)=Ω(x^{\frac{1}{2k}})$, and widely conjectured that $R_k(x)=O(x^{\frac{1}{2k}+ε})$. By establishing weak linear independence of some subsets of zeros of the Riemann zeta function, we establish an effective proof of the lower bound, with significantly larger bounds on the constant compared to those obtained in prior work. For example, we show that $R_k(x)/x^{1/2k} > 3$ infinitely often and that $R_k(x)/x^{1/2k} < -3$ infinitely often, for $k=2$, $3$, $4$, and $5$. We also investigate $R_2(x)$ and $R_3(x)$ in detail and establish that our bounds far exceed the oscillations exhibited by these functions over a long range: for $0<x\leq10^{18}$ we show that $|R_2(x)| < 1.12543x^{1/4}$ and $|R_3(x)| < 1.27417x^{1/6}$. We also present some empirical results regarding gaps between square-free numbers and between cube-free numbers.

math.NT↗

The Riemann hypothesis is true up to $3\cdot 10^{12}$

We verify numerically, in a rigorous way using interval arithmetic, that the Riemann hypothesis is true up to height $3\cdot10^{12}$. That is, all zeroes $β+ iγ$ of the Riemann zeta-function with $0<γ\leq 3\cdot 10^{12}$ have $β= 1/2$.

math.NT↗

Sign changes in the prime number theorem

Let $V(T)$ denote the number of sign changes in $ψ(x) - x$ for $x\in[1, T]$. We show that $\liminf_{\;T\rightarrow\infty} V(T)/\log T \geq γ_{1}/π+ 1.867\cdot 10^{-30}$, where $γ_{1} = 14.13\ldots$ denotes the ordinate of the lowest-lying non-trivial zero of the Riemann zeta-function. This improves on a long-standing result by Kaczorowski.

math.NT↗