相关论文: Degeneracies in the length spectra of metric graph…
We evaluate the variance of coefficients of the characteristic polynomial for binary quantum graphs using a dynamical approach. This is the first example where a spectral statistic can be evaluated in terms of periodic orbits for a system…
Degeneracies in the spectrum of an adiabatically transported quantum system are important to determine the geometrical phase factor, and may be interpreted as magnetic monopoles. We investigate the mechanism by which constraints acting on…
A new scheme of the iterative perturbation theory is proposed for the strongly correlated electron systems with orbital degeneracy. The method is based on the modified self-energy of Yeyati, et al. which interpolates between the weak and…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
A cactus graph is a connected graph in which every block is either an edge or a cycle. In this paper, we consider several problems of graph theory and developed optimal algorithms to solve such problems on cactus graphs. The running time of…
Regular sequences are natural generalisations of fixed points of constant-length substitutions on finite alphabets, that is, of automatic sequences. Using the harmonic analysis of measures associated with substitutions as motivation, we…
As a discrete analogue of Kac's celebrated question on "hearing the shape of a drum", and towards a practical graph isomorphism test, it is of interest to understand which graphs are determined up to isomorphism by their spectrum (of their…
In this paper we consider flat metrics (semi-translation structures) on surfaces of finite type. There are two main results. The first is a complete description of when a set of simple closed curves is spectrally rigid, that is, when the…
Counting the number of homomorphisms of a pattern graph H in a large input graph G is a fundamental problem in computer science. There are myriad applications of this problem in databases, graph algorithms, and network science. Often, we…
Let $k$ be an algebraically closed field and $\alpha$, $\beta$, $\gamma$ be partitions. An algebraic group acts on the constructible set of short exact sequences of nilpotent $k$-linear operators of Jordan types $\alpha$, $\beta$, and…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…
In the spirit of Arthur's trace formula, we establish a general trace formula for symmetric spaces associated with the variety of involutions of a finite $D$-module where $D$ is a division algebra central over a number field $F$. Such a…
It is known that under some assumptions the hitting time in quantum Markov chains is quadratically smaller than the hitting time in classical Markov chains. This work extends this result for decoherent quantum Markov chains. The decoherence…
We study the ring theory of the multiparameter deformations of the quantum Schubert cell algebras obtained from 2-cocycle twists. This is a large family, which extends the Artin-Schelter-Tate algebras of twisted quantum matrices. We…
In this paper, a new measurement to compare two large-scale graphs based on the theory of quantum probability is proposed. An explicit form for the spectral distribution of the corresponding adjacency matrix of a graph is established. Our…
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…
We study the spectrum of some periodic differential operators, in particular the periodic Schr\"{o}dinger operator acting on infinite $n$-cubic graphs. Using Floquet-Bloch theory, we derive and analyze on the dispersion relations of the…
In this talk we discuss mathematical structures associated to Feynman graphs. Feynman graphs are the backbone of calculations in perturbative quantum field theory. The mathematical structures -- apart from being of interest in their own…
Graph invariants provide a powerful analytical tool for investigation of abstract structures of graphs. They, combined in convenient relations, carry global and general information about a graph and its various substructures such as cycle…
We investigate numerically the scattering of waves on discrete graphs. An efficient algorithm is developed to compute the reflection and transmission (spectral) coefficients. We then explore various configurations of input and output leads,…