Quantum graphs: Self-adjoint, and yet exhibiting a nontrivial PT-symmetry

@article{Exner2021QuantumGS,
  title={Quantum graphs: Self-adjoint, and yet exhibiting a nontrivial PT-symmetry},
  author={Pavel Exner and Milo{\vs} Tater},
  journal={Physics Letters A},
  year={2021}
}
1 Citations

Figures from this paper

Ring chains with vertex coupling of a preferred orientation
We consider a family of Schrödinger operators supported by a periodic chain of loops connected either tightly or loosely through connecting links of the length [Formula: see text] with the vertex

References

SHOWING 1-10 OF 37 REFERENCES
PT-symmetric quantum graphs
We consider PT-symmetric quantum graphs, in which the branching points provide PT-symmetric boundary conditions for the Schrödinger equation on a graph. For such branched quantum wires, we derive
RT-symmetric Laplace operators on star graphs : real spectrum and self-adjointness
How ideas of -symmetric quantum mechanics can be applied to quantum graphs is analyzed, in particular to the star graph. The class of rotationally symmetric vertex conditions is analyzed. It is shown
A family of quantum graph vertex couplings interpolating between different symmetries
The paper discusses quantum graphs with a vertex coupling which interpolates between the common one of the δ type and a coupling introduced recently by two of the authors which exhibits a preferred
Quantum graphs with vertices of a preferred orientation
Real Spectra in Non-Hermitian Hamiltonians Having PT Symmetry
The condition of self-adjointness ensures that the eigenvalues of a Hamiltonian are real and bounded below. Replacing this condition by the weaker condition of $\mathrm{PT}$ symmetry, one obtains new
Quantum graphs: PT -symmetry and reflection symmetry of the spectrum
Not necessarily self-adjoint quantum graphs—differential operators on metric graphs—are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) P . If the
Periodic Orbit Theory and Spectral Statistics for Quantum Graphs
Abstract We quantize graphs (networks) which consist of a finite number of bonds and vertices. We show that the spectral statistics of fully connected graphs is well reproduced by random matrix
Non-self-adjoint graphs
On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a
The self-adjointness of Hermitian Hamiltonians
For several examples of Hermitian operators, the issues involved in their possible self-adjoint extension are shown to conform with recognizable properties in the solutions to the associated
...
...