Ashley Brereton

1. A computational algorithm for the Hardy function Z(t), utilising sub-sequences of generalised cubic Gauss sums, with an overall operational complexity of O((t/ε_t)^[.25,.3](log t)^2+o(1)), for t ∈ [10²³,10³⁵]
   2026/07/15 by David Lewis, Ashley Brereton
   #math.GM