Remarks on "Resolving isospectral `drums' by counting nodal domains"

In [3] the authors studied the 4-parameter family of isospectral flat 4-tori T^\pm(a,b,c,d) discovered by Conway and Sloane. With a particular method of counting nodal domains they were able to distinguish these tori (numerically) by computing the corresponding nodal sequences relative to a few explicit tuples (a,b,c,d). In this note we confirm the expectation expressed in [3] by proving analytically that their nodal count distinguishes any 4-tuple of distinct positive real numbers.Comment: 5 page

Eigenfunction Statistics on Quantum Graphs

We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric sigma model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.Comment: 59 pages, 3 figure

Dynamics of nodal points and the nodal count on a family of quantum graphs

We investigate the properties of the zeros of the eigenfunctions on quantum graphs (metric graphs with a Schr\"odinger-type differential operator). Using tools such as scattering approach and eigenvalue interlacing inequalities we derive several formulas relating the number of the zeros of the n-th eigenfunction to the spectrum of the graph and of some of its subgraphs. In a special case of the so-called dihedral graph we prove an explicit formula that only uses the lengths of the edges, entirely bypassing the information about the graph's eigenvalues. The results are explained from the point of view of the dynamics of zeros of the solutions to the scattering problem.Comment: 34 pages, 12 figure

Coherent States For SU(3)

We define coherent states for SU(3) using six bosonic creation and annihilation operators. These coherent states are explicitly characterized by six complex numbers with constraints. For the completely symmetric representations (n,0) and (0,m), only three of the bosonic operators are required. For mixed representations (n,m), all six operators are required. The coherent states provide a resolution of identity, satisfy the continuity property, and possess a variety of group theoretic properties. We introduce an explicit parameterization of the group SU(3) and the corresponding integration measure. Finally, we discuss the path integral formalism for a problem in which the Hamiltonian is a function of SU(3) operators at each site.Comment: 18 pages, LaTeX, no figure

The Schwinger SU(3) Construction - II: Relations between Heisenberg-Weyl and SU(3) Coherent States

The Schwinger oscillator operator representation of SU(3), studied in a previous paper from the representation theory point of view, is analysed to discuss the intimate relationships between standard oscillator coherent state systems and systems of SU(3) coherent states. Both SU(3) standard coherent states, based on choice of highest weight vector as fiducial vector, and certain other specific systems of generalised coherent states, are found to be relevant. A complete analysis is presented, covering all the oscillator coherent states without exception, and amounting to SU(3) harmonic analysis of these states.Comment: Latex, 51 page

Universal spectral statistics in Wigner-Dyson, chiral and Andreev star graphs II: semiclassical approach

A semiclassical approach to the universal ergodic spectral statistics in quantum star graphs is presented for all known ten symmetry classes of quantum systems. The approach is based on periodic orbit theory, the exact semiclassical trace formula for star graphs and on diagrammatic techniques. The appropriate spectral form factors are calculated upto one order beyond the diagonal and self-dual approximations. The results are in accordance with the corresponding random-matrix theories which supports a properly generalized Bohigas-Giannoni-Schmit conjecture.Comment: 15 Page

A lower bound for nodal count on discrete and metric graphs

According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes: N-th eigenfunction cannot have more than N domains. He also gave an example of a eigenfunction high in the spectrum with a minimal number of nodal domains, thus excluding the existence of a non-trivial lower bound. An analogue of Sturm's result for discretizations of the interval was discussed by Gantmacher and Krein. The discretization of an interval is a graph of a simple form, a chain-graph. But what can be said about more complicated graphs? It has been known since the early 90s that the nodal count for a generic eigenfunction of the Schrodinger operator on quantum trees (where each edge is identified with an interval of the real line and some matching conditions are enforced on the vertices) is exact too: zeros of the N-th eigenfunction divide the tree into exactly N subtrees. We discuss two extensions of this result in two directions. One deals with the same continuous Schrodinger operator but on general graphs (i.e. non-trees) and another deals with discrete Schrodinger operator on combinatorial graphs (both trees and non-trees). The result that we derive applies to both types of graphs: the number of nodal domains of the N-th eigenfunction is bounded below by N-L, where L is the number of links that distinguish the graph from a tree (defined as the dimension of the cycle space or the rank of the fundamental group of the graph). We also show that if it the genericity condition is dropped, the nodal count can fall arbitrarily far below the number of the corresponding eigenfunction.Comment: 15 pages, 4 figures; Minor corrections: added 2 important reference

Proof of the generalized Lieb-Wehrl conjecture for integer indices larger than one

Gnutzmann and Zyczkowski have proposed the Renyi-Wehrl entropy as a generalization of the Wehrl entropy, and conjectured that its minimum is obtained for coherent states. We prove this conjecture for the Renyi index q=2,3,... in the cases of compact semisimple Lie groups. A general formula for the minimum value is given.Comment: 8 pages, typos fixed, published versio

Nodal domains in open microwave systems

Nodal domains are studied both for real $\psi_R$ and imaginary part $\psi_I$ of the wavefunctions of an open microwave cavity and found to show the same behavior as wavefunctions in closed billiards. In addition we investigate the variation of the number of nodal domains and the signed area correlation by changing the global phase $\phi_g$ according to $\psi_R+i\psi_I=e^{i\phi_g}(\psi_R'+i\psi_I')$. This variation can be qualitatively, and the correlation quantitatively explained in terms of the phase rigidity characterising the openness of the billiard.Comment: 7 pages, 10 figures, submitted to PR

On the connection between the number of nodal domains on quantum graphs and the stability of graph partitions

Courant theorem provides an upper bound for the number of nodal domains of eigenfunctions of a wide class of Laplacian-type operators. In particular, it holds for generic eigenfunctions of quantum graph. The theorem stipulates that, after ordering the eigenvalues as a non decreasing sequence, the number of nodal domains $\nu_n$ of the $n$-th eigenfunction satisfies $n\ge \nu_n$. Here, we provide a new interpretation for the Courant nodal deficiency $d_n = n-\nu_n$ in the case of quantum graphs. It equals the Morse index --- at a critical point --- of an energy functional on a suitably defined space of graph partitions. Thus, the nodal deficiency assumes a previously unknown and profound meaning --- it is the number of unstable directions in the vicinity of the critical point corresponding to the $n$-th eigenfunction. To demonstrate this connection, the space of graph partitions and the energy functional are defined and the corresponding critical partitions are studied in detail.Comment: 22 pages, 6 figure