Related papers: Kac's Theorem for equipped graphs and for maximal …
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
For a representation of a Lie algebra, one can construct a diagram of the representation, i. e. a directed graph with edges labeled by matrix elements of the representation. This article explains how to use these diagrams to describe normal…
The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. A reduced graph $G$ is said to be maximal if any reduced…
We present a unitary approach to the construction of representations and intertwining operators. We apply it to the $C^*$-algebras, groups, Gabor type unitary systems and wavelets. We give an application of our method to the theory of…
Given a row-finite $k$-graph $\Lambda$ with no sources we investigate the $K$-theory of the higher rank graph $C^*$-algebra, $C^*(\Lambda)$. When $k=2$ we are able to give explicit formulae to calculate the $K$-groups of $C^*(\Lambda)$. The…
We consider the tensor product of modules over the polynomial algebra corresponding to the usual tensor product of linear operators. We present a general description of the representation ring in case the ground field k is perfect. It is…
We study systems of linear and semilinear mappings considering them as representations of a directed graph $G$ with full and dashed arrows: a representation of $G$ is given by assigning to each vertex a complex vector space, to each full…
We present a characterization of sets for which Cartwright's theorem holds true. The connection is discussed between these sets and sampling sets for entire functions of exponential type.
Quiver theories constitute an important class of supersymmetric gauge theories with well-defined holographic duals. Motivated by holographic duality, we use localisation on $S^d$ to study long linear quivers at large-N. The large-N solution…
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles.…
The goal of this paper is to prove a version of the non-abelian localization theorem for the rational equivariant K-theory of a smooth variety $X$ with the action of a linear algebraic group $G$. We then use this to prove a Riemann-Roch…
We introduce the notion of a topological higher-rank graph, a unified generalization of the higher-rank graph and the topological graph. Using groupoid techniques, we define the Toeplitz and Cuntz-Krieger algebras of topological higher-rank…
The aim of this note is to provide a self-contained classification of the irreducible representations of generalised Kac--Paljutkin Hopf algebras, recently introduced by the second author.
A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices…
A graph with a semiregular group of automorphisms can be thought of as the derived cover arising from a voltage graph. Since its inception, the theory of voltage graphs and their derived covers has been a powerful tool used in the study of…
We systematically investigate the problem of representing Markov chains by families of random maps, and which regularity of these maps can be achieved depending on the properties of the probability measures. Our key idea is to use…
In this paper we state the basics for a signal processing framework on quiver representations. A quiver is a directed graph and a quiver representation is an assignment of vector spaces to the nodes of the graph and of linear maps between…
The Brouwer conjecture (BC) in spectral graph theory claims that the sum of the largest k Kirchhoff eigenvalues of a graph are bounded above by the number m of edges plus k(k+1)/2. We show that (BC) holds for all graphs with n vertices if n…
We present an elementary proof of a generalization of Kirchoff's matrix tree theorem to directed, weighted graphs. The proof is based on a specific factorization of the Laplacian matrices associated to the graphs, which only involves the…
We introduce the notion of the full quiver of a representation of an algebra, which is a cover of the (classical) quiver, but which captures properties of the representation itself. Gluing of vertices and of arrows enables one to study…