Related papers: Rooted Clusters for Graph LP Algebras
We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…
Graph clustering has been studied extensively on both plain graphs and attributed graphs. However, all these methods need to partition the whole graph to find cluster structures. Sometimes, based on domain knowledge, people may have…
In this paper, we define a number of closely related isomorphisms. On one side of these isomorphisms sit a number of of algebras generalizing the Hecke and affine Hecke algebras, which we call the "Hecke family"; on the other, we find…
Root subgroup factorization is a refinement of triangular (or LDU) factorization. For a complex reductive Lie group, and a choice of reduced factorization of the longest Weyl group element, the forward map from root subgroup coordinates to…
The Chekanov-Eliashberg differential graded algebra of a Legendrian knot L is a rich source of Legendrian knot invariants, as is the theory of generating families. The set P(L) of homology groups of augmentations of the Chekanov-Eliashberg…
Let $\mathbb{F}$ be a field of characteristic zero and let $\mathfrak{g}$ be a non-zero finite-dimensional split semisimple Lie algebra with root system $\Delta$. Let $\Gamma$ be a finite set of integral weights of $\mathfrak{g}$ containing…
In this note we generalize a result from a recent paper of Hajac, Reznikoff and Tobolski (2020). In that paper they give conditions they call admissibility on a pushout diagram in the category of directed graphs implying that the…
Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras L(1,n). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs…
We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…
There is a cell decomposition of the nonnegative Grassmannian. For each cell, totally positive bases(TP-bases) is defined as the minimal set of Pl\"ucker variables such that all other nonzero Pl\"ucker variables in the cell can be expressed…
We give a presentation of a finite crystallographic reflection group in terms of an arbitrary seed in the corresponding cluster algebra of finite type and interpret the presentation in terms of companion bases in the associated root system.
We introduce the notion of a polyptych lattice, which encodes a collection of lattices related by piecewise linear bijections. We initiate a study of the new theory of convex geometry and polytopes associated to polyptych lattices. In…
Let $E$ be a finite directed graph, and let $I$ be the poset obtained as the antisymmetrization of its set of vertices with respect to a pre-order $\le$ that satisfies $v\le w$ whenever there exists a directed path from $w$ to $v$. Assuming…
We introduce admissible group actions on cluster algebras, cluster categories and quivers with potential and study the resulting orbit spaces. The orbit space of the cluster algebra has the structure of a generalized cluster algebra. This…
Tangles of graphs have been introduced by Robertson and Seymour in the context of their graph minor theory. Tangles may be viewed as describing "k-connected components" of a graph (though in a twisted way). They play an important role in…
We construct geometric realization for non-exceptional mutation-finite cluster algebras by extending the theory of Fomin and Thurston to skew-symmetrizable case. Cluster variables for these algebras are renormalized lambda lengths on…
Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…
We introduce a notion of a root groupoid as a replacement of the notion of Weyl group for (Kac-Moody) Lie superalgebras. The objects of the root groupoid classify certain root data, the arrows are defined by generators and relations. As an…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…
Cohen and Taylor, following an idea of Plesken, introduced a Lie algebra to the complex group algebra of a finite group and determined its structure, based on the character theory of the group. We show how the definition of this Plesken Lie…