SearcharxivSearch

arXiv subjects

Michael Harm

Publications and source records attributed to Michael Harm.

4 recordsLinked to original sources

The reverse Goldbach problem and a refined Zsiflaw--Legeis theorem

We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at representations of integers as the sum of primes and reversed primes. We show that: (1) Every large odd integer is the sum of a prime and two reversed primes ($N=p_1+\overleftarrow{p_2}+\overleftarrow{p_3}$). (2) Every large odd integer is the sum of two primes and a reversed prime ($N=p_1+p_2+\overleftarrow{p_3}$). (3) Almost all even integers are the sum of a prime and a reversed prime ($N=p_1+\overleftarrow{p_2}$). (4) All large integers are the sum of a reversed prime and a square-free number ($N=\overleftarrow{p}+\eta$, $\mu^2(\eta)=1$). To obtain our results, along with associated asymptotics, we apply the Hardy--Littlewood circle method and a novel refinement of the ``Zsiflaw--Legeis" theorem on the distribution of reversed primes in arithmetic progressions. Notably, our variant of the Zsiflaw--Legeis theorem does not require one to fix the digit length, unlike previous versions.

math.NT

On the Goldbach problem with restricted primes

Let $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density estimate for Dirichlet $L$-functions, we may unconditionally take $U= N^{\frac{4}{49}}\exp(\log^{\frac{2}{3}+\varepsilon}N)$ for any $\varepsilon>0$. If we assume the Generalized Riemann Hypothesis instead, we may take $U= \log^{4+\varepsilon}N$.

math.NT

Refinements for primes in short arithmetic progressions

Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example, if we assume the Generalized Density Hypothesis, then for any arithmetic progression modulo $q\leq \log^{\ell} x$ with $\ell>0$ and any $\varepsilon>0$, the prime number theorem holds in all intervals $(x-\sqrt{x}\exp(\log^{\frac{2}{3}+\varepsilon} x),x]$ and almost all intervals $(x-\exp(\log^{\frac{2}{3}+\varepsilon} x),x]$ as $x\rightarrow\infty$. This refines the classic intervals $(x-x^{1/2+\varepsilon},x]$ and $(x-x^\varepsilon,x]$ for any $\varepsilon>0$.

math.NT

Distribution of solutions to systems of congruences in balls

Let $G_1,\dots, G_n\in \mathbb{F}_p[X_1,\dots,X_m]$ be $n$ polynomials in $m$ variables over the finite field $\mathbb{F}_p$ of $p$ elements. For any sufficiently large prime $p$ and non-trivial bounds for the Weyl sums associated to the non-trivial linear combinations of $G=(G_1,\dots, G_n)$, we study various properties regarding the distribution of the vectors by fractional parts \begin{equation*} \bigg(\bigg\{ \frac{G_1(\textbf{x})}{p}\bigg\},\cdots,\bigg\{ \frac{G_n(\textbf{x})}{p}\bigg\}\bigg)\in \mathbb{T}^n,\hspace{10pt} \textbf{x}\in \mathbb{F}_p^m. \end{equation*} We prove refinements of equidistribution, such as bounds for the ball discrepancy and variance.

math.NT