Related papers: Cluster Monomials in Graph Laurent Phenomenon Alge…
To any walk in a quiver, we associate a Laurent polynomial. When the walk is the string of a string module over a 2-Calabi-Yau tilted algebra, we prove that this Laurent polynomial coincides with the corresponding cluster character of the…
We consider skew-symmetrizable (upper) cluster algebras with a compatible Poisson structure, called $\mathsf{\Lambda}$-(upper) cluster algebras. For any two good elements (e.g., cluster monomials) in a $\mathsf{\Lambda}$-upper cluster…
One of the key points in Galois theory via field extensions is to build up a correspondence between subfields of a field and subgroups of its automorphism group, so as to study fields via methods of groups. As an analogue of the Galois…
The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in math.RT/0104151; their study continued in math.RA/0208229, math.RT/0305434. This is a family of commutative rings designed to serve as an algebraic framework for the theory…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
Cluster categories were introduced in 2006 by Buan-Marsh-Reineke-Reiten-Todorov in order to categorify acyclic cluster algebras without coefficients. Their construction was generalized by Amiot (2009) and Plamondon (2011) to arbitrary…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
In this article we explain how the coordinate ring of each (open) Schubert variety in the Grassmannian can be identified with a cluster algebra, whose combinatorial structure is encoded using (target labelings of) Postnikov's plabic graphs.…
We study Newton polytopes of cluster variables in type A_n cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments of a polygon. Our main results include an explicit description of the…
We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…
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…
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
In the CHY-frame for the tree-level amplitudes, the bi-adjoint scalar theory has played a fundamental role because it gives the on-shell Feynman diagrams for all other theories. Recently, an interesting generalization of the bi-adjoint…
Chain graphs combine directed and undirected graphs and their underlying mathematics combines properties of the two. This paper gives a simplified definition of chain graphs based on a hierarchical combination of Bayesian (directed) and…
We extend a T-path expansion formula for arcs on an unpunctured surface to the case of arcs on a once-punctured polygon and use this formula to give a combinatorial proof that cluster monomials form the atomic basis of a cluster algebra of…
Knopfmacher et all [1] was introduced the graph compositions` notion. In this note we add to these a new construction of tree-like graphs where nodes are graphs themselves. The first examples of these tree-like compositions, a corresponding…
Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…
Cluster algebras are a class of commutative algebras whose generators are defined by a recursive process called mutation. We give a brief introduction to cluster algebras, and explain how discrete integrable systems can appear in the…