Related papers: Atomic Representations of Rank 2 Graph Algebras

Given a group $G$ of automorphisms of a matroid $M$, we describe the representations of $G$ on the homology of the independence complex of the dual matroid $M^*$. These representations are related with the homology of the lattice of flats…

The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…

We categorify Lusztig's version of the quantized enveloping algebra for sl(2). Using a graphical calculus a 2-category is constructed whose split Grothendieck ring is isomorphic to Lusztig's algebra. The indecomposable morphisms of this…

We complete a classification of the two-vertex geometrically irreducible algebras. We also classify the algebras in new classes of hom- and ext-irreducible algebras.

We show that nuclear C*-algebras have a refined version of the completely positive approximation property, in which the maps that approximately factorize through finite dimensional algebras are convex combinations of order zero maps. We use…

We study deterministic constructions of graphs for which the unique completion of low rank matrices is generically possible regardless of the values of the entries. We relate the completability to the presence of some patterns (particular…

By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…

A segment representation of a graph is an assignment of line segments in 2D to the vertices in such a way that two segments intersect if and only if the corresponding vertices are adjacent. Not all graphs have such segment representations,…

We study C*-algebras generated by two partitions of unity subject to orthogonality relations governed by a bipartite graph which we also call "bipartite graph C*-algebras". These algebras generalize at the same time the C*-algebra…

This is an expository book on unitary representations of topological groups, and of several dual spaces, which are spaces of such representations up to some equivalence. The most important notions are defined for topological groups, but a…

The completely positive rank is an analogue of topological covering dimension, defined for nuclear C*-algebras via completely positive approximations. These may be thought of as simplicial approximations of the algebra, which leads to the…

We construct a description of graded derivations in group algebras. Using this result for arbitrary graduation of the group algebra, we describe all possible structures of DG algebras. The corresponding examples are given. The description…

In this paper, the 2-category $\mathfrak{Rep}_{{\bf 2Mat}_{\mathbb{C}}}(\mathbb{G})$ of (weak) representations of an arbitrary (weak) 2-group $\mathbb{G}$ on (some version of) Kapranov and Voevodsky's 2-category of (complex) 2-vector spaces…

Unitary graphs are arc-transitive graphs with vertices the flags of Hermitian unitals and edges defined by certain elements of the underlying finite fields. They played a significant role in a recent classification of a class of…

We establish simple combinatorial descriptions of the radical and irreducible representations specifically for the descent algebra of a Coxeter group of type $D$ over any field.

In this paper we study of *-representations for polynomial algebras on quantum matrix spaces. We deal with two special cases of the polynomial algebras, namely the algebra of polynomials on quantum complex matrices $\mathrm{Mat_2}$ and on…

We investigate families of two-dimensional simplicial complexes defined in terms of vertex decompositions. They include nonevasive complexes, strongly collapsible complexes of Barmak and Miniam and analogues of 2-trees of Harary and Palmer.…

For representation by partial functions in the signature with intersection, composition and antidomain, we show that a representation is meet complete if and only if it is join complete. We show that a representation is complete if and only…

A set $S$ of vertices in a graph $G$ is a $2$-dominating set if every vertex of $G$ not in $S$ is adjacent to at least two vertices in $S$, and $S$ is a $2$-independent set if every vertex in $S$ is adjacent to at most one vertex of $S$.…

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…