Related papers: Rooted Clusters for Graph LP Algebras
The Temperley-Lieb and Brauer algebras and their cyclotomic analogues, as well as the partition algebra, are all examples of twisted semigroup algebras. We prove a general theorem about the cellularity of twisted semigroup algebras of…
In the classic Correlation Clustering problem introduced by Bansal, Blum, and Chawla (FOCS 2002), the input is a complete graph where edges are labeled either $+$ or $-$, and the goal is to find a partition of the vertices that minimizes…
Plabic graphs are intimately connected to the positroid stratification of the positive Grassmannian. The duals to these graphs are quivers, and it is possible to associate to them cluster algebras. For the top-cell graph of $Gr_{+}(k,n)$,…
In the theory of generalized cluster algebras, we build the so-called cluster formula and $D$-matrix pattern. Then as applications, some fundamental conjectures of generalized cluster algebras are solved affirmatively.
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in connection with dual canonical bases. To a cluster algebra of simply laced Dynkin type one can associate the cluster category. Any cluster of the cluster algebra corresponds…
In this article, we extend some results about algebra $A$ with the group of units $U(A)$ having a special polynomial identity, Laurent polynomial. And we present a new version of B. Hartley Conjecture with these identities.
We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph…
The dilogarithm identities for the central charges of conformal field theories of simply laced type were conjectured by Bazhanov, Kirillov, and Reshetikhin. Their functional generalizations were conjectured by Gliozzi and Tateo. They have…
A family of quantum cluster algebras is introduced and studied. In general, these algebras are new, but subclasses have been studied previously by other authors. The algebras are indexed by double partitions or double flag varieties.…
The cluster analysis of very large objects is an important problem, which spans several theoretical as well as applied branches of mathematics and computer science. Here we suggest a novel approach: under assumption of local convergence of…
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
We study a family of algebras defined using a locally-finite endomorphism called a braiding map. When the braiding map is semi-simple, the algebra is a generalized vertex algebra, while when the braiding map is locally-nilpotent we have a…
The construction of the Leavitt path algebra associated to a directed graph $E$ is extended to incorporate a family $C$ consisting of partitions of the sets of edges emanating from the vertices of $E$. The new algebras, $L_K(E,C)$, are…
Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…
We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of…
For real number $\alpha,$ Generalised Laguerre Polynomials (GLP) is a family of polynomials defined by \begin{align*} L_n^{(\alpha)}(x)=(-1)^n\displaystyle\sum_{j=0}^{n}\binom{n+\alpha}{n-j}\frac{(-x)^j}{j!}. \end{align*}These orthogonal…
We consider variants of the clustered planarity problem for level-planar drawings. So far, only convex clusters have been studied in this setting. We introduce two new variants that both insist on a level-planar drawing of the input graph…
The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…
An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…