Related papers: U-cross Gram matrices and their invertibility
Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…
In representations using frames, oblique duality appears in situations where the analysis and the synthesis has to be done in different subspaces. In some cases, we cannot obtain an explicit expression for the oblique duals and in others…
This paper generalizes results for alternate dual frames in Hilbert spaces on the situation of a Banach space. Additionally some properties of synthesys operator associated with alternate dual frame are investigated. The main result is that…
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…
We ask the question whether for a given unitary representation $U$ the associated operator $\rho_{U}\in\operatorname{Mor}(U,U^{c\, c})$ has spectrum invariant under inversion -- in this case we say that $\rho_{U}$ has symmetric eigenvalues.…
We construct the general permutation invariant Gaussian 2-matrix model for matrices of arbitrary size $D$. The parameters of the model are given in terms of variables defined using the representation theory of the symmetric group $S_D$. A…
We use Cramer's formula for the inverse of a matrix and a combinatorial expression for the determinant in terms of paths of an associated digraph (which can be traced back to Coates) to give a combinatorial interpretation of M\"obius…
The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note…
In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…
Gaussian graphical models have become a well-recognized tool for the analysis of conditional independencies within a set of continuous random variables. From an inferential point of view, it is important to realize that they are composite…
In this paper, the uniform stability of the inverse spectral problem is proved for the matrix Sturm-Liouville operator on a finite interval. Namely, we describe the sets of spectral data, on which the inverse spectral mapping is bounded…
We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are…
Gram's Law describes a pattern that frequently occurs in the distribution of the non-trivial zeros of the Riemann zeta function along the critical line. Whenever Gram's Law holds true, it reduces the difficulty of computing the…
Computing $p \rightarrow q$ norm for matrices is a classical problem in computational mathematics and power iteration is a well-known method for computing $p \rightarrow q $ norm for a matrix with nonnegative entries. Here we define an…
This article treats global uniform exponential stability (GUES) of discrete-time switched linear systems under restricted switching. Given admissible minimum and maximum dwell times, we provide sufficient conditions on the subsystems under…
If a geometry $\Gamma$ is isomorphic to the residue of a point $A$ of a shadow geometry of a spherical building $\Delta$, a representation $\varepsilon_\Delta^A$ of $\Gamma$ can be given in the unipotent radical $U_{A^*}$ of the stabilizer…
Tight frames can be characterized as those frames which possess optimal numerical stability properties. In this paper, we consider the question of modifying a general frame to generate a tight frame by rescaling its frame vectors; a process…
We consider graded Cartan matrices of the symmetric groups and the Iwahori-Hecke algebras of type A, which have entries in the ring $\mathbb Z[v,v^{-1}]$. These matrices may also be interpreted as Gram matrices of the Shapovalov form on…
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…