Related papers: Combinatorial frameworks for cluster algebras

This is a sequel to the second and third author's Mixed Dimer Configuration Model in Type $D$ Cluster Algebras where we extend our model to work for quivers that contain oriented cycles. Namely, we extend a combinatorial model for…

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…

We introduce combinatorial objects named matricubes that provide a generalization of the theory of matroids. As matroids provide a combinatorial axiomatization of hyperplane arrangements, matricubes provide a combinatorial axiomatization of…

We give a functorial definition of $G$-gerbes over a simplicial complex when the local symmetry group $G$ is non-Abelian. These combinatorial gerbes are naturally endowed with a connective structure and a curving. This allows us to define a…

In this paper we initiate the study of racks from the combined perspective of combinatorics and finite group theory. A rack R is a set with a self-distributive binary operation. We study the combinatorics of the partially ordered set {\cal…

Given a symmetrizable generalized Cartan matrix $A$, for any index $k$, one can define an automorphism associated with $A,$ of the field $\mathbf{Q}(u_1, >..., u_n)$ of rational functions of $n$ independent indeterminates $u_1,..., u_n.$ It…

We characterize mutation-finite cluster algebras of rank at least 3 using positive semi-definite quadratic forms. In particular, we associate with every unpunctured bordered surface a positive semi-definite quadratic space $V$, and with…

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…

Combinatorial Exploration is a new domain-agnostic algorithmic framework to automatically and rigorously study the structure of combinatorial objects and derive their counting sequences and generating functions. We describe how it works and…

In the authors book, Associative Algebraic Geometry, 2023, and the following article Shemes of Associative Algebras,\\ https://doi.org/10.48550/arXiv.2410.17703,2024, we use an algebraization of the semi-local formal moduli of simple…

Many combinatorial optimisation problems hide algebraic structures that, once exposed, shrink the search space and improve the chance of finding the global optimal solution. We present a general framework that (i) identifies algebraic…

Implicative algebras have been recently introduced by Miquel in order to provide a unifying notion of model, encompassing the most relevant and used ones, such as realizability (both classical and intuitionistic), and forcing. In this work,…

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…

In this paper we introduce compressed commuting graph of rings. It can be seen as a compression of the standard commuting graph (with the central elements added) where we identify the vertices that generate the same subring. The compression…

Graph convolutional networks (GCNs) have gained popularity due to high performance achievable on several downstream tasks including node classification. Several architectural variants of these networks have been proposed and investigated…

This is the compendium of the cluster algebra and quiver package for sage. The purpose of this package is to provide a platform to work with cluster algebras in graduate courses and to further develop the theory by working on examples, by…

Frieze patterns have an interesting combinatorial structure, which has proven very useful in the study of cluster algebras. We introduce $(k,n)$-frieze patterns, a natural generalisation of the classical notion. A generalisation of the…

In this paper we give a geometric-combinatorial description of the cluster categories of type E. In particular, we give an explicit geometric description of all cluster tilting objects in the cluster category of type E_6. The model we…

We complete classification of mutation-finite cluster algebras by extending the technique derived by Fomin, Shapiro, and Thurston to skew-symmetrizable case. We show that for every mutation-finite skew-symmetrizable matrix a diagram…

In this work we develop a theory of hierarchical clustering for graphs. Our modeling assumption is that graphs are sampled from a graphon, which is a powerful and general model for generating graphs and analyzing large networks. Graphons…