Related papers: Subordinacy Theory on Star-Like Graphs
The Jacobian group (also known as the critical group or sandpile group) is an important invariant of a finite, connected graph $X$; it is a finite abelian group whose cardinality is equal to the number of spanning trees of $X$ (Kirchhoff's…
We consider positive Jacobi matrices $J$ with compact inverses and consequently with purely discrete spectra. A number of properties of the corresponding sequence of orthogonal polynomials is studied including the convergence of their…
The Jacobian conjecture over a field of characteristic zero is considered directly in view of the nonlinear partial differential equations it is associated with. Exploring the integrals of such partial differential equations, this work…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
This paper investigates the spectral properties of Jacobi matrices with limit-periodic coefficients. We show that for a residual set of such matrices, the spectrum is a Cantor set of zero Lebesgue measure, and the spectral measures are…
We look at periodic Jacobi matrices on trees. We provide upper and lower bounds on the gap of such operators analogous to the well known gap in the spectrum of the Laplacian on the upper half-plane with hyperbolic metric. We make some…
We investigate trace formulas for Jacobi operators which are trace class perturbations of quasi-periodic finite-gap operators using Krein's spectral shift theory. In particular we establish the conserved quantities for the solutions of the…
The inverse eigenvalue problem of a given graph $G$ is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G$. Barrett et al. introduced the Strong Spectral Property…
We adapt the notion of Jacobi diagrams on surfaces (considered by Andersen-Mattes-Reshetikhin), and construct a LMO-like map that we use to compare some functoriality properties of WRT and LMO invariants.
Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
We present examples of rooted tree graphs for which the Laplacian has singular continuous spectral measures. For some of these examples we further establish fractional Hausdorff dimensions. The singular continuous components, in these…
To each graph on $n$ vertices there is an associated subspace of the $n \times n$ matrices called the operator system of the graph. We prove that two graphs are isomorphic if and only if their corresponding operator systems are unitally…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
In this paper we discuss a general framework based on symplectic geometry for the study of second order conditions in constrained variational problems on curves. Using the notion of L-derivatives we construct Jacobi curves, which represent…
We consider two-sided Jacobi matrices whose coefficients are obtained by continuous sampling along the orbits of a homeomorphim of a compact metric space. Given an ergodic probability measure, we study the topological structure of the…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
The spectral properties of two special classes of Jacobi operators are studied. For the first class represented by the $2M$-dimensional real Jacobi matrices whose entries are symmetric with respect to the secondary diagonal, a new…