scholarly journals New Combinatorial Formulas for Cluster Monomials of Type $A$ Quivers

10.37236/6464 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Kyungyong Lee ◽  
Li Li ◽  
Ba Nguyen
Keyword(s):  
Cluster Algebra ◽  
Theta Functions ◽  
Type A ◽  
Perfect Matchings ◽  
Cluster Algebras ◽  
Combinatorial Formula ◽  
Natural Basis ◽  
Combinatorial Formulas ◽  
New Formula

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 formula for the cluster monomials in terms of the so-called globally compatible collections. We give bijective proofs of these formulas by comparing with the well-known combinatorial models of the $T$-paths and of the perfect matchings in a snake diagram. For cluster variables of a type $A$ cluster algebra, we give a bijection that relates our new formula with the theta functions constructed by Gross, Hacking, Keel and Kontsevich.

scholarly journals THE DISCRETE FUNDAMENTAL GROUP OF THE ASSOCIAHEDRON, AND THE EXCHANGE MODULE

2013 ◽  
Vol 23 (04) ◽  
pp. 745-762
Author(s):  
HÉLÈNE BARCELO ◽  
CHRISTOPHER SEVERS ◽  
JACOB A. WHITE
Keyword(s):  
Fundamental Group ◽  
Lattice Theory ◽  
Homotopy Theory ◽  
Cluster Algebra ◽  
Type A ◽  
Point Of View ◽  
Cluster Algebras ◽  
Combinatorial Description

The associahedron is an object that has been well studied and has numerous applications, particularly in the theory of operads, the study of non-crossing partitions, lattice theory and more recently in the study of cluster algebras. We approach the associahedron from the point of view of discrete homotopy theory. We study the abelianization of the discrete fundamental group, and show that it is free abelian of rank [Formula: see text]. We also find a combinatorial description for a basis of this rank. We also introduce the exchange module of the type An cluster algebra, used to model the relations in the cluster algebra. We use the discrete fundamental group to the study of exchange module, and show that it is also free abelian of rank [Formula: see text].

scholarly journals Combinatorial Formulas for Macdonald and Hall-Littlewood Polynomials

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Cristian Lenart
Keyword(s):  
Weyl Group ◽  
Type A ◽  
Macdonald Polynomials ◽  
Combinatorial Formula ◽  
Young Diagrams ◽  
Affine Weyl Group ◽  
Littlewood Polynomials ◽  
Combinatorial Formulas ◽  
International Audience ◽  
Type C

International audience A breakthrough in the theory of (type $A$) Macdonald polynomials is due to Haglund, Haiman and Loehr, who exhibited a combinatorial formula for these polynomials in terms of fillings of Young diagrams. Recently, Ram and Yip gave a formula for the Macdonald polynomials of arbitrary type in terms of the corresponding affine Weyl group. In this paper, we show that a Haglund-Haiman-Loehr type formula follows naturally from the more general Ram-Yip formula, via compression. Then we extend this approach to the Hall-Littlewood polynomials of type $C$, which are specializations of the corresponding Macdonald polynomials at $q=0$. We note that no analog of the Haglund-Haiman-Loehr formula exists beyond type $A$, so our work is a first step towards finding such a formula.

scholarly journals Cluster algebras and continued fractions

2017 ◽  
Vol 154 (3) ◽  
pp. 565-593 ◽  
Author(s):  
İlke Çanakçı ◽  
Ralf Schiffler
Keyword(s):  
Asymptotic Behavior ◽  
Continued Fractions ◽  
Continued Fraction ◽  
Cluster Algebra ◽  
Perfect Matchings ◽  
Cluster Algebras ◽  
Laurent Polynomials ◽  
Periodic Continued Fractions

We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To a continued fraction $[a_{1},a_{2},\ldots ,a_{n}]$ we associate a snake graph ${\mathcal{G}}[a_{1},a_{2},\ldots ,a_{n}]$ such that the continued fraction is the quotient of the number of perfect matchings of ${\mathcal{G}}[a_{1},a_{2},\ldots ,a_{n}]$ and ${\mathcal{G}}[a_{2},\ldots ,a_{n}]$. We also show that snake graphs are in bijection with continued fractions. We then apply this connection between cluster algebras and continued fractions in two directions. First we use results from snake graph calculus to obtain new identities for the continuants of continued fractions. Then we apply the machinery of continued fractions to cluster algebras and obtain explicit direct formulas for quotients of elements of the cluster algebra as continued fractions of Laurent polynomials in the initial variables. Building on this formula, and using classical methods for infinite periodic continued fractions, we also study the asymptotic behavior of quotients of elements of the cluster algebra.

scholarly journals A Cluster Expansion Formula ($A_n$ case)

10.37236/788 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Ralf Schiffler
Keyword(s):  
Finite Type ◽  
Cluster Expansion ◽  
Regular Polygon ◽  
Cluster Algebra ◽  
Type A ◽  
Cluster Algebras ◽  
Expansion Formula ◽  
Cluster Variable

We consider the Ptolemy cluster algebras, which are cluster algebras of finite type $A$ (with non-trivial coefficients) that have been described by Fomin and Zelevinsky using triangulations of a regular polygon. Given any seed $\Sigma$ in a Ptolemy cluster algebra, we present a formula for the expansion of an arbitrary cluster variable in terms of the cluster variables of the seed $\Sigma$. Our formula is given in a combinatorial way, using paths on a triangulation of the polygon that corresponds to the seed $\Sigma$.

scholarly journals Oriented Flip Graphs and Noncrossing Tree Partitions

2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Alexander Garver ◽  
Thomas McConville
Keyword(s):  
Cluster Algebra ◽  
Type A ◽  
Cluster Algebras ◽  
Exchange Graph ◽  
Simple Characterization ◽  
International Audience ◽  
Flip Graph

International audience Given a tree embedded in a disk, we define two lattices - the oriented flip graph of noncrossing arcs and the lattice of noncrossing tree partitions. When the interior vertices of the tree have degree 3, the oriented flip graph is equivalent to the oriented exchange graph of a type A cluster algebra. Our main result is an isomorphism between the shard intersection order of the oriented flip graph and the lattice of noncrossing tree partitions. As a consequence, we deduce a simple characterization of c-matrices of type A cluster algebras.

scholarly journals Solution of tetrahedron equation and cluster algebras

2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
P. Gavrylenko ◽  
M. Semenyakin ◽  
Y. Zenkevich
Keyword(s):  
Integrable System ◽  
Cluster Algebra ◽  
Newton Polygon ◽  
Cluster Algebras ◽  
Weyl Groups ◽  
Newton Polygons ◽  
Tetrahedron Equation ◽  
Affine Weyl Groups ◽  
New Formalism ◽  
Bruhat Cell

Abstract We notice a remarkable connection between the Bazhanov-Sergeev solution of Zamolodchikov tetrahedron equation and certain well-known cluster algebra expression. The tetrahedron transformation is then identified with a sequence of four mutations. As an application of the new formalism, we show how to construct an integrable system with the spectral curve with arbitrary symmetric Newton polygon. Finally, we embed this integrable system into the double Bruhat cell of a Poisson-Lie group, show how triangular decomposition can be used to extend our approach to the general non-symmetric Newton polygons, and prove the Lemma which classifies conjugacy classes in double affine Weyl groups of A-type by decorated Newton polygons.

scholarly journals Notes on cluster algebras and some all-loop Feynman integrals

2021 ◽  
Vol 2021 (6) ◽  
Author(s):  
Song He ◽  
Zhenjie Li ◽  
Qinglin Yang
Keyword(s):  
Configuration Space ◽  
Strong Evidence ◽  
Wilson Loop ◽  
Cluster Algebra ◽  
Cluster Algebras ◽  
Gauge Invariant ◽  
Feynman Integrals ◽  
Cluster Function ◽  
Invariant Description ◽  
Cluster Configuration

Abstract We study cluster algebras for some all-loop Feynman integrals, including box-ladder, penta-box-ladder, and double-penta-ladder integrals. In addition to the well-known box ladder whose symbol alphabet is $$ {D}_2\simeq {A}_1^2 $$ D 2 ≃ A 1 2 , we show that penta-box ladder has an alphabet of D3 ≃ A3 and provide strong evidence that the alphabet of seven-point double-penta ladders can be identified with a D4 cluster algebra. We relate the symbol letters to the u variables of cluster configuration space, which provide a gauge-invariant description of the cluster algebra, and we find various sub-algebras associated with limits of the integrals. We comment on constraints similar to extended-Steinmann relations or cluster adjacency conditions on cluster function spaces. Our study of the symbol and alphabet is based on the recently proposed Wilson-loop d log representation, which allows us to predict higher-loop alphabet recursively; by applying it to certain eight-point and nine-point double-penta ladders, we also find D5 and D6 cluster functions respectively.

scholarly journals Unistructurality of cluster algebras

2020 ◽  
Vol 156 (5) ◽  
pp. 946-958 ◽  
Author(s):  
Peigen Cao ◽  
Fang Li
Keyword(s):  
Cluster Algebra ◽  
Cluster Algebras

We prove that any skew-symmetrizable cluster algebra is unistructural, which is a conjecture by Assem, Schiffler and Shramchenko. As a corollary, we obtain that a cluster automorphism of a cluster algebra ${\mathcal{A}}({\mathcal{S}})$ is just an automorphism of the ambient field ${\mathcal{F}}$ which restricts to a permutation of the cluster variables of ${\mathcal{A}}({\mathcal{S}})$.

scholarly journals Bar-invariant bases of the quantum cluster algebra of type A 2 (2)

2011 ◽  
Vol 61 (4) ◽  
pp. 1077-1090 ◽  
Author(s):  
Xueqing Chen ◽  
Ming Ding ◽  
Jie Sheng
Keyword(s):  
Cluster Algebra ◽  
Type A ◽  
Quantum Cluster Algebra ◽  
Quantum Cluster
Sign in / Sign up

Export Citation Format

Share Document