Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 97 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 38 tok/s
GPT-5 High 37 tok/s Pro
GPT-4o 101 tok/s
GPT OSS 120B 466 tok/s Pro
Kimi K2 243 tok/s Pro
2000 character limit reached

Fractal Complex Dimensions, Riemann Hypothesis and Invertibility of the Spectral Operator (1210.0882v3)

Published 2 Oct 2012 in math.FA

Abstract: A spectral reformulation of the Riemann hypothesis was obtained in [LaMa2] by the second author and H. Maier in terms of an inverse spectral problem for fractal strings. This problem is related to the question "Can one hear the shape of a fractal drum?" and was shown in [LaMa2] to have a positive answer for fractal strings whose dimension is $c\in(0,1)-{1/2}$ if and only if the Riemann hypothesis is true. Later on, the spectral operator was introduced heuristically by M. L. Lapidus and M. van Frankenhuijsen in their theory of complex fractal dimensions [La-vF2, La-vF3] as a map that sends the geometry of a fractal string onto its spectrum. We focus here on presenting the rigorous results obtained by the authors in [HerLa1] about the invertibility of the spectral operator. We show that given any $c\geq0$, the spectral operator $\mathfrak{a}=\mathfrak{a}{c}$, now precisely defined as an unbounded normal operator acting in a Hilbert space $\mathbb{H}{c}$, is `quasi-invertible' (i.e., its truncations are invertible) if and only if the Riemann zeta function $\zeta=\zeta(s)$ does not have any zeroes on the line $Re(s)=c$. It follows that the associated inverse spectral problem has a positive answer for all possible dimensions $c\in (0,1)$, other than the mid-fractal case when $c=1/2$, if and only if the Riemann hypothesis is true.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.