Related papers: Operators Induced by Graphs
We survey the operator algebras arising as commutants modulo normed ideals of finite sets of hermitian operators and connections to perturbations of operators and noncommutative geometry.
This paper considers averaging operators on various algebraic structures and studies the induced structures. We first introduce the notion of an averaging operator on a group $G$ and show that it induces a rack structure. Moreover, the…
To a weighted graph can be associated a bipartite graph planar algebra P. We construct and study the symmetric enveloping inclusion of P. We show that this construction is equivariant with respect to the automorphism group of P. The…
We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
A recent example of a non-hyponormal injective composition operator in an $L^2$-space generating Stieltjes moment sequences, invented by three of the present authors, was built over a non-locally finite directed tree. The main goal of this…
Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…
Given a directed graph, there exists a universal operator algebra and universal C*-algebra associated to the directed graph. In this paper we give intrinsic constructions of these objects. We provide an explicit construction for the maximal…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path $P_4$ as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
The graph of a Hecke operator encodes all information about the action of this operator on automorphic forms. Let $X$ be a curve over $\mathbb{F}_q$, $F$ its function field and $\mathbb{A}$ the adele ring of $F$. In this paper we will…
A categorical formalism for directed graphs is introduced, featuring natural notions of morphisms and subgraphs, and leading to two elementary descriptions of the free-properad monad, first in terms of presheaves on elementary graphs,…
The groups distinguish their von Neumann algebras, in the case when these are factors.
A characterization is given for directed graphs that yield graph $C^*$-algebras with continuous trace. This is established for row-finite graphs with no sources first using a groupoid approach, and extended to the general case via the…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
Relativizing an idea from multiplicity theory, we say that an element x of a von Neumann algebra M is n-divisible if (W*(x)' cap M) unitally contains a factor of type I_n. We decide the density of the n-divisible operators, for various n,…
We consider non-selfadjoint operator algebras $\mathfrak{L}(G,\lambda)$ generated by weighted creation operators on the Fock-Hilbert spaces of countable directed graphs $G$. These algebras may be viewed as noncommutative generalizations of…
It is now well known that ultracontractive properties of semigroups with infinitesimal generator given by an undirected graph Laplacian operator can be obtained through an understanding of the geometry of the underlying infinite weighted…
In this article, we study directed graphs (digraphs) with a coloring constraint due to Von Neumann and related to Nim-type games. This is equivalent to the notion of kernels of digraphs, which appears in numerous fields of research such as…
In this partly expository paper we discuss and describe some of our old and recent results on partial orders on the set (m,n)-graphs (i.e. graphs with n vertices and m edges) and some operations on graphs that are monotone with respect to…