Related papers: Cluster Monomials in Graph Laurent Phenomenon Alge…
We develop and prove the analogs of some results shown in [Berenstein A., Fomin S., Zelevinsky A., Duke Math. J. 126 (2005), 1-52] concerning lower and upper bounds of cluster algebras to the generalized cluster algebras of geometric type.…
We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…
Cluster algebras were introduced by Fomin-Zelevinsky in 2002 in order to give a combinatorial framework for phenomena occurring in the context of algebraic groups. Cluster algebras also have links to a wide range of other subjects,…
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…
We give an explicit combinatorial description of cluster structures in Schubert varieties of the Grassmannian in terms of (target labelings of) Postnikov's plabic graphs. This description is a natural generalization of the description given…
All algebras in a very large, axiomatically defined class of quantum nilpotent algebras are proved to possess quantum cluster algebra structures under mild conditions. Furthermore, it is shown that these quantum cluster algebras always…
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…
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…
We study monoidal categorifications of certain monoidal subcategories $\mathcal{C}_J$ of finite-dimensional modules over quantum affine algebras, whose cluster algebra structures coincide and arise from the category of finite-dimensional…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
In this paper we propose the notion of cluster superalgebras which is a supersymmetric version of the classical cluster algebras introduced by Fomin and Zelevinsky. We show that the symplectic-orthogonal supergroup $SpO(2|1)$ admits a…
We prove a duality theorem applicable to a a wide range of specialisations, as well as to some generalisations, of tangles in graphs. It generalises the classical tangle duality theorem of Robertson and Seymour, which says that every graph…
Factor systems are a tool for working on the extension problem of algebraic structures such as groups, Lie algebras, and associative algebras. Their applications are numerous and well-known in these common settings. We construct…
We study Newton polytopes for cluster variables in cluster algebras $\mathcal{A}(\Sigma)$ of types A and D. A famous property of cluster algebras is the Laurent phenomenon: each cluster variable can be written as a Laurent polynomial in the…
In this note, we find an explicit formula for the Laurent expression of cluster variables of coefficient-free rank two cluster algebras associated with the matrix $\left(\begin{array}{cc} 0 & c -c & 0 \end{array}\right)$, and show that a…
Clustering is a fundamental property of complex networks and it is the mathematical expression of a ubiquitous phenomenon that arises in various types of self-organized networks such as biological networks, computer networks or social…
We generalize the construction of the bracelet and bangle bases defined by Musiker, Schiffler and Williams, and the band basis defined by D. Thurston to cluster algebras arising from orbifolds. We prove that the bracelet bases are positive,…
We prove a conjecture about the vertices and edges of the exchange graph of a cluster algebra $\A$ in two cases: when $\A$ is of geometric type and when $\A$ is arbitrary and its exchange matrix is nondegenerate. In the second case we also…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
The evolution of random undirected graphs by the clustering attachment (CA) both without node and edge deletion and with uniform node or edge deletion is investigated. Theoretical results are obtained for the CA without node and edge…