Related papers: Adjacency Matrices of Configuration Graphs
Inhomogeneous lattice paths are introduced as ordered sequences of rectangular Young tableaux thereby generalizing recent work on the Kostka polynomials by Nakayashiki and Yamada and by Lascoux, Leclerc and Thibon. Motivated by these works…
W.Specht (1940) proved that two $n\times n$ complex matrices $A$ and $B$ are unitarily similar if and only if $\operatorname{trace} w(A,A^{\ast}) = \operatorname{trace} w(B,B^{\ast})$ for every word $w(x,y)$ in two noncommuting variables.…
The adjacency matrices of graphs form a special subset of the set of all integer symmetric matrices. The description of which graphs have all their eigenvalues in the interval [-2,2] (i.e., those having spectral radius at most 2) has been…
This thesis consists of two parts: the construction of a jointly universal family of graphs, and then an exploration of set-theoretic geology. Firstly we shall construct a model in which…
Let $G$ be an $n$-vertex graph with adjacency matrix $A$, and $W=[e,Ae,\ldots,A^{n-1}e]$ be the walk matrix of $G$, where $e$ is the all-one vector. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author showed that any graph…
We prove that a type II$_1$ factor $M$ can have at most one Cartan subalgebra $A$ satisfying a combination of rigidity and compact approximation properties. We use this result to show that within the class $\Cal H \Cal T$ of factors $M$…
Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…
Let $p$ be a prime, $n \geq 1$, $K(n)$ the $n$th Morava $K$-theory spectrum, $\mathbb{G}_n$ the extended Morava stabilizer group, and $K(A)$ the algebraic $K$-theory spectrum of a commutative $S$-algebra $A$. For a type $n+1$ complex $V_n$,…
We consider a 3-parameter family of linear special double confluent Heun equations introduced and studied by V.M.Buchstaber and S.I.Tertychnyi, which is an equivalent presentation of a model of Josephson junction in superconductivity.…
Given a matrix $A$, let $A_{I,J}$ denote the submatrix of $A$ determined by rows $I$ and columns $J$. Fischer's Inequalities state that for each $n \times n$ Hermitian positive semidefinite matrix $A$, and each subset $I$ of…
Matrices are the most common representations of graphs. They are also used for the representation of algebras and cluster algebras. This paper shows some properties of matrices in order to facilitate the understanding and locating…
The properties of a hypergraph explored through the spectrum of its unified matrix was made by the authors in [26]. In this paper, we introduce three different hypergraph matrices: unified Laplacian matrix, unified signless Laplacian…
Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…
Given an abstract simplicial complex G, the connection graph G' of G has as vertex set the faces of the complex and connects two if they intersect. If A is the adjacency matrix of that connection graph, we prove that the Fredholm…
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the…
A graph $G$ is \textit{asymmetric} if its automorphism group of vertices is trivial. Asymmetric graphs were introduced by Erd\H{o}s and R\'{e}nyi in 1963. They showed that the probability of a graph on $n$ vertices being asymmetric tends to…
A $n\times n$ matrix $A$ has normal defect one if it is not normal, however can be embedded as a north-western block into a normal matrix of size $(n+1)\times (n+1)$. The latter is called a minimal normal completion of $A$. A construction…
The question of matrix similarity is a classical one in linear algebra. For a field $\mathbb{F}$ and some positive integer $n \in \mathbb{N}$, one may consider the following problems: 1. Given two matrices $A, B \in \mathrm{GL}(n,…
This article reviews some recent progress in our understanding of the structure of Rational Conformal Field Theories, based on ideas that originate for a large part in the work of A. Ocneanu. The consistency conditions that generalize…
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…