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 The Discrete Fundamental Group of the Associahedron

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Christopher Severs ◽  
Jacob White
Keyword(s):  
Fundamental Group ◽  
Lattice Theory ◽  
Homotopy Theory ◽  
Equivalence Classes ◽  
Point Of View ◽  
Cluster Algebras ◽  
Type B ◽  
Simple Description ◽  
Generating Set ◽  
International Audience

International audience 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, that is we consider 5-cycles in the 1-skeleton of the associahedron to be combinatorial holes, but 4-cycles to be contractible. We give a simple description of the equivalence classes of 5-cycles in the 1-skeleton and then identify a set of 5-cycles from which we may produce all other cycles. This set of 5-cycle equivalence classes turns out to be the generating set for the abelianization of the discrete fundamental group of the associahedron. In this paper we provide presentations for the discrete fundamental group and the abelianization of the discrete fundamental group. We also discuss applications to cluster algebras as well as generalizations to type B and D associahedra. \par L'associahèdre est un objet bien etudié que l'on retrouve dans plusieurs contextes. Par exemple, il est associé à la théorie des opérades, à l'étude des partitions non-croisées, à la théorie des treillis et plus récemment aux algèbres dámas. Nous étudions cet objet par le biais de la théorie des homotopies discretes. En bref cette théorie signifie qu'un cycle de longueur 5 (sur le squelette de l'associahèdre) est considéré comme étant le bord d'un trou combinatoire, alors qu'un cycle de longueur 4 peut être contracté sans problème. Les classes d'homotopies discrètes sont donc des classes d'équivalence de cycles de longueurs 5. Nous donnons une description simple de ces classes d'équivalence et identifions un ensemble de générateurs du groupe correspondant (abélien) d'homotopies discrètes. Nous d'ecrivons également les liens entre notre construction et les algèbres d'amas.

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 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 Multi-cluster complexes

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Cesar Ceballos ◽  
Jean-Philippe Labbé ◽  
Christian Stump
Keyword(s):  
Coxeter Groups ◽  
Type A ◽  
Simplicial Complexes ◽  
Cluster Complex ◽  
Geometric Properties ◽  
Cluster Complexes ◽  
Combinatorial Description ◽  
Compatibility Relation ◽  
Positive Roots ◽  
International Audience

International audience We present a family of simplicial complexes called \emphmulti-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types ${A}$ and ${B}$ to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among the set of almost positive roots in the cluster complex. Nous présentons une famille de complexes simpliciaux appelés \emphcomplexes des multi-amas. Ces complexes généralisent le concept de complexes des amas et étendent la notion de multi-associaèdre de type ${A}$ et ${B}$ aux groupes de Coxeter finis. Nous étudions des propriétés combinatoires et géométriques de ces objets et, en particulier nous fournissons une description combinatoire simple de la relation de compatibilité sur l'ensemble des racines presque positives du complexe des amas.

scholarly journals A Note on Three Types of Quasisymmetric Functions

10.37236/1958 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
T. Kyle Petersen
Keyword(s):  
Generating Functions ◽  
Type A ◽  
Type B ◽  
Quasisymmetric Functions ◽  
Descent Algebra ◽  
Combinatorial Description ◽  
Partition Theorems

In the context of generating functions for $P$-partitions, we revisit three flavors of quasisymmetric functions: Gessel's quasisymmetric functions, Chow's type B quasisymmetric functions, and Poirier's signed quasisymmetric functions. In each case we use the inner coproduct to give a combinatorial description (counting pairs of permutations) to the multiplication in: Solomon's type A descent algebra, Solomon's type B descent algebra, and the Mantaci-Reutenauer algebra, respectively. The presentation is brief and elementary, our main results coming as consequences of $P$-partition theorems already in the literature.

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}})$.

Sign in / Sign up

Export Citation Format

Share Document