Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe scattering matrix with respect to an Hermitian matrix of a graph
113
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Recently, Gnutzmann and Smilansky presented a formula for the bond scattering matrix of a graph with respect to a Hermitian matrix. We present another proof for this Gnutzmann and Smilanskys formula by a technique used in the zeta function of a graph. Furthermore, we generalize Gnutzmann and Smilanskys formula to a regular covering of a graph. Finally, we define an $L$-fuction of a graph, and present a determinant expression. As a corollary, we express the generalization of Gnutzmann and Smilanskys formula to a regular covering of a graph by using its $L$-functions.
rate research
Read More
We define a zeta function woth respect to the twisted Grover matrix of a mixed digraph, and present an exponential expression and a determinant expression of this zeta function. As an application, we give a trace formula with respect to the twisted Grover matrix of a mixed digraph.
This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind introduced by Mohar [21]. This matrix is indexed by the vertices of the mixed graph, and the entry corresponding to an arc from $u$ to $v$ is equal to the sixth root of unity $omega=frac{1+{bf i}sqrt{3}}{2}$ (and its symmetric entry is $overline{omega}=frac{1-{bf i}sqrt{3}}{2}$); the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. The main results of this paper include the following: Some interesting properties are discovered about the characteristic polynomial of this novel matrix. Cospectral problems among mixed graphs, including mixed graphs and their underlying graphs, are studied. We give equivalent conditions for a mixed graph that shares the same spectrum of its Hermitian adjacency matrix of the second kind ($H_S$-spectrum for short) with its underlying graph. A sharp upper bound on the $H_S$-spectral radius is established and the corresponding extremal mixed graphs are identified. Operations which are called three-way switchings are discussed--they give rise to a large number of $H_S$-cospectral mixed graphs. We extract all the mixed graphs whose rank of its Hermitian adjacency matrix of the second kind ($H_S$-rank for short) is $2$ (resp. 3). Furthermore, we show that all connected mixed graphs with $H_S$-rank $2$ can be determined by their $H_S$-spectrum. However, this does not hold for all connected mixed graphs with $H_S$-rank $3$. We identify all mixed graphs whose eigenvalues of its Hermitian adjacency matrix of the second kind ($H_S$-eigenvalues for short) lie in the range $(-alpha,, alpha)$ for $alphainleft{sqrt{2},,sqrt{3},,2right}$.
We carry out diagonalization of a $3times3$ Hermitian matrix of which Real component and Imaginary part are commutative and apply it to Majorana neutrino mass matrix $M=M_ u M_ u^dagger$ which satisfies the same condition. It is shown in a model-independent way for the kind of matrix M of which Real component and Imaginary part are commutative that $delta = pmpi/2$ which implies the maximal strength of CP violation in neutrino oscillations. And we obtain the prediction $cos (2theta_{23})=0$ for this kind of M. It is shown that the kind of Hermitian Majorana neutrino mass matrix M has only five real parameters and furthermore, only one free real parameter (D or A) if using the measured values of three mixing angles and mass differences as input.
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link diagrams in terms of webs, producing quantum invariants like the well-known Jones polynomial. One important question in representation theory is to identify the relationships between different bases; coefficients in the change-of-basis matrix often describe combinatorial, algebraic, or geometric quantities (like, e.g., Kazhdan-Lusztig polynomials). By flattening the braiding maps, webs can also be viewed as the basis elements of a symmetric-group representation. In this paper, we define two new combinatorial structures for webs: band diagrams and their one-dimensional projections, shadows, that measure depths of regions inside the web. As an application, we resolve an open conjecture that the change-of-basis between the so-called Specht basis and web basis of this symmetric-group representation is unitriangular for $mathfrak{sl}_3$-webs. We do this using band diagrams and shadows to construct a new partial order on webs that is a refinement of the usual partial order. In fact, we prove that for $mathfrak{sl}_2$-webs, our new partial order coincides with the tableau partial order on webs studied by the authors and others. We also prove that though the new partial order for $mathfrak{sl}_3$-webs is a refinement of the previously-studied tableau order, the two partial orders do not agree for $mathfrak{sl}_3$.
We give a limit theorem with respect to the matrices related to non-backtracking paths of a regular graph. The limit obtained closely resembles the $k$th moments of the arcsine law. Furthermore, we obtain the asymptotics of the averages of the $p^m$th Fourier coefficients of the cusp forms related to the Ramanujan graphs defined by A. Lubotzky, R. Phillips and P. Sarnak.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
