scholarly journals Cluster Algebras of Type D: Pseudotriangulations Approach

10.37236/5282 ◽  
2015 ◽  
Vol 22 (4) ◽  
Author(s):  
Cesar Ceballos ◽  
Vincent Pilaud
Keyword(s):  
Perfect Matchings ◽  
Cluster Algebras ◽  
Combinatorial Interpretation ◽  
Small Disk ◽  
Cluster Complexes ◽  
Type D ◽  
Initial Cluster ◽  
Centrally Symmetric ◽  
Combinatorial Model ◽  
Exchange Relations

We present a combinatorial model for cluster algebras of type $D_n$ in terms of centrally symmetric pseudotriangulations of a regular $2n$ gon with a small disk in the centre. This model provides convenient and uniform interpretations for clusters, cluster variables and their exchange relations, as well as for quivers and their mutations. We also present a new combinatorial interpretation of cluster variables in terms of perfect matchings of a graph after deleting two of its vertices. This interpretation differs from known interpretations in the literature. Its main feature, in contrast with other interpretations, is that for a fixed initial cluster seed, one or two graphs serve for the computation of all cluster variables. Finally, we discuss applications of our model to polytopal realizations of type $D$ associahedra and connections to subword complexes and $c$-cluster complexes.

scholarly journals The Cube Recurrence

10.37236/1826 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Gabriel D. Carroll ◽  
David Speyer
Keyword(s):  
Recurrence Relation ◽  
Planar Graphs ◽  
Perfect Matchings ◽  
Laurent Polynomials ◽  
Combinatorial Interpretation ◽  
Combinatorial Model

We construct a combinatorial model that is described by the cube recurrence, a quadratic recurrence relation introduced by Propp, which generates families of Laurent polynomials indexed by points in ${\Bbb Z}^3$. In the process, we prove several conjectures of Propp and of Fomin and Zelevinsky about the structure of these polynomials, and we obtain a combinatorial interpretation for the terms of Gale-Robinson sequences, including the Somos-6 and Somos-7 sequences. We also indicate how the model might be used to obtain some interesting results about perfect matchings of certain bipartite planar graphs.

scholarly journals Perfect Matchings and Cluster Algebras of Classical Type

2008 ◽  
Vol DMTCS Proceedings vol. AJ,... (Proceedings) ◽  
Author(s):  
Gregg Musiker
Keyword(s):  
Recent Work ◽  
Cluster Expansion ◽  
Perfect Matchings ◽  
Laurent Polynomial ◽  
Cluster Algebras ◽  
Classical Type ◽  
Combinatorial Interpretation ◽  
Expansion Formula ◽  
Graph Theoretic ◽  
International Audience

International audience In this paper we give a graph theoretic combinatorial interpretation for the cluster variables that arise in most cluster algebras of finite type. In particular, we provide a family of graphs such that a weighted enumeration of their perfect matchings encodes the numerator of the associated Laurent polynomial while decompositions of the graphs correspond to the denominator. This complements recent work by Schiffler and Carroll-Price for a cluster expansion formula for the $A_n$ case while providing a novel interpretation for the $B_n$, $C_n$, and $D_n$ cases. Dans cet article nous donnons une interprétation combinatoire en termes de théorie des graphes pour les variables de clusters qui apparaissent dans la plupart des algèbres à clusters de type fini. En particulier, nous décrivons une famille de graphes tels qu'une énumération pondérée de leurs matchings parfaits encode le numérateur du polynôme de Laurent associé, tandis que les décompositions du graphe correspondent au dénominateur. Ceci complète les récents travaux de Schiffler et Carroll-Price qui donnent une formule pour le développement d'une variable de cluster dans le cas $A_n$, tout en fournissant une nouvelle interprétation dans les cas $B_n$, $C_n$ et $D_n$.

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 Cluster algebras of unpunctured surfaces and snake graphs

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Gregg Musiker ◽  
Ralf Schiffler
Keyword(s):  
Perfect Matchings ◽  
Laurent Polynomial ◽  
Cluster Algebras ◽  
Polynomial Expansion ◽  
International Audience ◽  
Polynomial Expansions

International audience We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect matchings of a certain graph $G_{T,\gamma}$ that is constructed from the surface by recursive glueing of elementary pieces that we call tiles. We also give a second formula for these Laurent polynomial expansions in terms of subgraphs of the graph $G_{T,\gamma}$ . Nous étudions des algèbres amassées avec coefficients principaux associées aux surfaces. Nous présentons une formule directe pour les développements de Laurent des variables amassées dans ces algèbres en terme de couplages parfaits d'un certain graphe $G_{T,\gamma}$ que l'on construit a partir de la surface en recollant des pièces élémentaires que l'on appelle carreaux. Nous donnons aussi une seconde formule pour ces développements en termes de sous-graphes de $G_{T,\gamma}$ .

scholarly journals On positive geometries of quartic interactions: one loop integrands from polytopes

2021 ◽  
Vol 2021 (7) ◽  
Author(s):  
Mrunmay Jagadale ◽  
Alok Laddha
Keyword(s):  
Large Class ◽  
Scattering Amplitude ◽  
Cluster Algebras ◽  
Seminal Work ◽  
New Class ◽  
Type D ◽  
Kinematic Space ◽  
The One

Abstract Building on the seminal work of Arkani-Hamed, He, Salvatori and Thomas (AHST) [1] we explore the positive geometry encoding one loop scattering amplitude for quartic scalar interactions. We define a new class of combinatorial polytopes that we call pseudo-accordiohedra whose poset structures are associated to singularities of the one loop integrand associated to scalar quartic interactions. Pseudo-accordiohedra parametrize a family of projective forms on the abstract kinematic space defined by AHST and restriction of these forms to the type-D associahedra can be associated to one-loop integrands for quartic interactions. The restriction (of the projective form) can also be thought of as a canonical top form on certain geometric realisations of pseudo-accordiohedra. Our work explores a large class of geometric realisations of the type-D associahedra which include all the AHST realisations. These realisations are based on the pseudo-triangulation model for type-D cluster algebras discovered by Ceballos and Pilaud [2].

scholarly journals Combinatorial Cluster Expansion Formulas from Triangulated Surfaces

10.37236/8351 ◽  
2019 ◽  
Vol 26 (2) ◽  
Author(s):  
Toshiya Yurikusa
Keyword(s):  
Bipartite Graph ◽  
Cluster Expansion ◽  
Independent Sets ◽  
Perfect Matchings ◽  
Cluster Algebras ◽  
Expansion Formula ◽  
Triangulated Surfaces ◽  
Quiver With Potential ◽  
Maximal Independent Sets

We give a cluster expansion formula for cluster algebras with principal coefficients defined from triangulated surfaces in terms of maximal independent sets of angles. Our formula simplifies the cluster expansion formula given by Musiker, Schiffler and Williams in terms of perfect matchings of snake graphs. A key point of our proof is to give a bijection between maximal independent sets of angles in some triangulated polygon and perfect matchings of the corresponding snake graph. Moreover, they also correspond bijectively with perfect matchings of the corresponding bipartite graph and minimal cuts of the corresponding quiver with potential.

scholarly journals Atomic Bases and $T$-path Formula for Cluster Algebras of Type $D$

2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Emily Gunawan ◽  
Gregg Musiker
Keyword(s):  
Cluster Algebra ◽  
Cluster Algebras ◽  
Combinatorial Proof ◽  
Expansion Formula ◽  
Type D ◽  
International Audience ◽  
T Path ◽  
Nous Utilisons

International audience 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 type $D$. Nous généralisons une formule de développement en $T$-chemins pour les arcs sur une surface non-perforée aux arcs sur un polygone à une perforation. Nous utilisons cette formule pour donner une preuve combinatoire du fait que les monômes amassées constituent la base atomique d’une algèbre amassée de type $D$.

scholarly journals Cluster algebras and triangulated surfaces. Part I: Cluster complexes

2008 ◽  
Vol 201 (1) ◽  
pp. 83-146 ◽  
Author(s):  
Sergey Fomin ◽  
Michael Shapiro ◽  
Dylan Thurston
Keyword(s):  
Cluster Algebras ◽  
Cluster Complexes ◽  
Triangulated Surfaces

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 Cumulants of the q-semicircular law, Tutte polynomials, and heaps

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Matthieu Josuat-Vergès
Keyword(s):  
Tutte Polynomial ◽  
Combinatorial Interpretation ◽  
Poisson Law ◽  
Semicircular Law ◽  
Combinatorial Model ◽  
Tutte Polynomials ◽  
International Audience ◽  
Nonnegative Coefficients

International audience The q-semicircular law as introduced by Bożejko and Speicher interpolates between the Gaussian law and the semicircular law, and its moments have a combinatorial interpretation in terms of matchings and crossings. We prove that the cumulants of this law are, up to some factor, polynomials in q with nonnegative coefficients. This is done by showing that they are obtained by an enumeration of connected matchings, weighted by the evaluation at (1,q) of a Tutte polynomial. The two particular cases q=0 and q=2 have also alternative proofs, related with the fact that these particular evaluation of the Tutte polynomials count some orientations on graphs. Our methods also give a combinatorial model for the cumulants of the free Poisson law. La loi q-semicirculaire introduite par Bożejko et Speicher interpole entre la loi gaussienne et la loi semi-circulaire, et ses moments ont une interprétation combinatoire en termes de couplages et croisements. Nous prouvons que les cumulants de cette loi sont, à un facteur près, des polynômes en q à coefficients positifs. La méthode consiste à obtenir ces cumulants par une énumération de couplages connexes, pondérés par l’évaluation en (1,q) d'un polynôme de Tutte. Les cas particuliers q=0 et q=2 ont une preuve alternative, reliè au fait que des évaluations particulières du polynôme de Tutte comptent certaines orientations de graphes. Nos méthodes donnent aussi un modèle combinatoire aux cumulants de la loi de Poisson libre.

Sign in / Sign up

Export Citation Format

Share Document