Related papers: Prime geodesic theorem for the modular group

It is well-known that the traditional Chinese remainder theorem (CRT) is not robust in the sense that a small error in a remainder may cause a large error in the reconstruction solution. A robust CRT was recently proposed for a special case…

For $n\geq 3$ and $\Gamma$ a cocompact lattice acting on the hyperbolic space $\mathbb{H}^n$, we investigate the average behaviour of the error term in the circle problem. First, we explore the local average of the error term over compact…

We show that the semigroup Zariski topology on a group can be strictly coarser than the group Zariski topology on it, answering a question of Elliott, Jonusas, Mesyan, Mitchell, Morayne, and Peresse.

A polynomial is called self-reciprocal (or palindromic) if the sequence of its coefficients is palindromic. In this paper we obtain improved error bounds for the number of irreducible polynomials and self-reciprocal irreducible monic…

We estimate the sums \[ \sum_{c\leq x} \frac{S(m,n,c,\chi)}{c}, \] where the $S(m,n,c,\chi)$ are Kloosterman sums of half-integral weight on the modular group. Our estimates are uniform in $m$, $n$, and $x$ in analogy with Sarnak and…

Probabilistic rounding error analysis can yield much sharper bounds than classical worst-case theory, but existing results typically rely on zero-mean rounding errors and often leave the confidence parameter implicit. This work revisits…

This note is a response to [7] in which it is claimed that [13, Proposition 11] is false. We demonstrate here that this assertion in [7] is false, and is based on a misreading of the notion of set membership in [13, Proposition 11]. We…

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…

In 1878, Jordan proved that if a finite group $G$ has a faithful representation of dimension $n$ over $\mathbb{C}$, then $G$ has a normal abelian subgroup with index bounded above by a function of $n$. The same result fails if one replaces…

The purpose of this note is to show that, in contrast to the ${\Bbb F}_p$-case (proven in [7]), the $p$-primary and $p$-adic cases of the Isotropy Conjecture, claiming that the isotropic Chow groups with ${\Bbb Z}/p^r$, $r>1$, respectively,…

Let $$\gamma^*=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:.$$ Let $\gamma^*<\gamma_0\leq 1$, $c_0=1/\gamma_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$.\\ We prove on assumption of the Generalized Riemann…

We show the primes have level of distribution $66/107\approx 0.617$ using triply well-factorable weights. This gives the highest level of distribution for primes in any setting, improving on the prior record level $3/5=0.60$ of Maynard. We…

We prove mod-Gaussian convergence for a Dirichlet polynomial which approximates $\operatorname{Im}\log\zeta(1/2+it)$. This Dirichlet polynomial is sufficiently long to deduce Selberg's central limit theorem with an explicit error term.…

Let $m \in \mathbb{N}$ be large. We show that there exist infinitely many primes $q_{1}< \cdot\cdot\cdot < q_{m+1}$ such that \[ q_{m+1}-q_{1}=O(e^{7.63m}) \] and $q_{j}+2$ has at most \[ \frac{7.36m}{\log 2} + \frac{4\log m}{\log 2} + 21…

We prove results that imply, under various hypotheses, that every elliptic curve over a number field $k$ corresponding to a point on a modular curve has bad reduction at a certain prime $p$ of $\mathcal{O}_k$. For example, every elliptic…

The following is an improved version of Chapter 12 of my book [Sm17]. Among others, we present a new unified approach to the Archimedean Positivstellens\"atze for quadratic modules and semirings in Section 12.4 and we add a number of new…

We introduce a modification of the linear sieve whose weights satisfy strong factorization properties, and consequently equidistribute primes up to size $x$ in arithmetic progressions to moduli up to $x^{10/17}$. This surpasses the level of…

Under the assumption of infinitely many Siegel zeroes $s$ with $Re(s)>1-\frac{1}{(\log q)^{R}}$ for a sufficiently large value of $R$, we prove that there exist infinitely many $m$-tuples of primes that are $\ll e^{1.9828m}$ apart. This…

We show that the classical discrete logarithm problem over prime fields can be reduced to that of solving a system of linear modular equations.

Using Watt's mean value theorem and a delicate sieve decomposition, the author shows that the interval $[x, x+x^{\frac{1}{2}+\varepsilon}]$ contains an integer with a prime factor larger than $x^{\frac{35}{36}-\varepsilon}$ for sufficiently…