Average first-passage times for character sums
Number Theory
2026-01-21 v2
Abstract
Let and, for an odd prime , set Define the first-passage time We prove that there exists a constant such that, as ,
Cite
@article{arxiv.2512.24631,
title = {Average first-passage times for character sums},
author = {Quanyu Tang and Hao Zhang},
journal= {arXiv preprint arXiv:2512.24631},
year = {2026}
}
Comments
9 pages. v2: added a reference and corrected several typos