相关论文: Quantum graphs whose spectra mimic the zeros of th…
The Riemann hypothesis, which states that the non-trivial zeros of the Riemann zeta function all lie on a certain line in the complex plane, is one of the most important unresolved problems in mathematics. Inspired by the P\'olya-Hilbert…
The Riemann hypothesis is proved by quantum-extending the zeta Riemann function to a quantum mapping between quantum $1$-spheres with quantum algebra $A=\mathbb{C}$, in the sense of A. Pr\'astaro \cite{PRAS01, PRAS02}. Algebraic topologic…
In this article we construct zeta functions of quantum graphs using a contour integral technique based on the argument principle. We start by considering the special case of the star graph with Neumann matching conditions at the center of…
Non-hermitian quantum graphs possessing real (i.e., in principle, observable) spectra are studied via their discretization. The discretized Hamiltonians are assigned, constructively, an elementary pseudometric and/or a more complicated…
A strategy for proving (not a proof of, as was the first over-optimistic belief) the Riemann hypothesis is suggested. The vanishing of Riemann Zeta reduces to an orthogonality condition for the eigenfunctions of a non-Hermitian operator D^+…
Manifestly non-Hermitian quantum graphs with real spectra are introduced and shown tractable as a new class of phenomenological models with several appealing descriptive properties. For illustrative purposes, just equilateral star-graphs…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
This paper compares the distribution of zeros of the Riemann zeta function $\zeta(s)$ with those of a symmetric combination of zeta functions, denoted ${\cal T}_+(s)$, known to have all its zeros located on the critical line $\Re(s)=1/2$.…
In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
Physics is a fertile environment for trying to solve some number theory problems. In particular, several tentative of linking the zeros of the Riemann-zeta function with physical phenomena were reported. In this work, the Riemann operator…
The Neumann points of an eigenfunction $f$ on a quantum (metric) graph are the interior zeros of $f'$. The Neumann domains of $f$ are the sub-graphs bounded by the Neumann points. Neumann points and Neumann domains are the counterparts of…
A strategy for proving Riemann hypothesis is suggested. The vanishing of the Rieman Zeta reduces to an orthogonality condition for the eigenfunctions of a non-Hermitian operator $D^+$ having the zeros of Riemann Zeta as its eigenvalues. The…
A variant for the Hilbert and Polya spectral interpretation of the Riemann zeta function is proposed. Instead of looking for a self-adjoint linear operator H, whose spectrum coincides with the Riemann zeta zeros, we look for the complex…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
A quasisymmetric graph is a curve whose projection onto a line is a quasisymmetric map. We show that this class of curves is related to solutions of the reduced Beltrami equation and to a generalization of the Zygmund class $\Lambda_*$.…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…