Related papers: Ordered Exchange Graphs
We construct a new class of symmetric algebras of tame representation type that are also the endomorphism algebras of cluster tilting objects in 2-Calabi-Yau triangulated categories, hence all their non-projective indecomposable modules are…
This article is an expository account of the theory of twisted commutative algebras, which simply put, can be thought of as a theory for handling commutative algebras with large groups of linear symmetries. Examples include the coordinate…
In representation theory of algebras the notion of `mutation' often plays important roles, and two cases are well known, i.e. `cluster tilting mutation' and `exceptional mutation'. In this paper we focus on `tilting mutation', which has a…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
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…
Previous work on symmetric group equivariant neural networks generally only considered the case where the group acts by permuting the elements of a single vector. In this paper we derive formulae for general permutation equivariant layers,…
A theory of orientation on gain graphs (voltage graphs) is developed to generalize the notion of orientation on graphs and signed graphs. Using this orientation scheme, the line graph of a gain graph is studied. For a particular family of…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct…
For any cluster algebra whose underlying combinatorial data can be encoded by a bordered surface with marked points, we construct a geometric realization in terms of suitable decorated Teichmueller space of the surface. On the geometric…
Every two seeds in a field of fractions $\mathcal{F}$ together with a symmetric group element gives rise to an automorphism of $\mathcal{F}$ called an exchange automorphism. For positive cluster algebras, we provide equivalent conditions…
We establish a connection between knot theory and cluster algebras via representation theory. To every knot diagram (or link diagram), we associate a cluster algebra by constructing a quiver with potential. The rank of the cluster algebra…
We continue the study of quivers with potentials and their representations initiated in the first paper of the series. Here we develop some applications of this theory to cluster algebras. As shown in the "Cluster algebras IV" paper, the…
Network-based modeling of complex systems and data using the language of graphs has become an essential topic across a range of different disciplines. Arguably, this graph-based perspective derives its success from the relative simplicity…
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…
Any cluster-tilted algebra is the relation extension of a tilted algebra. We present a method to, given the distribution of a cluster-tilting object in the Auslander-Reiten quiver of the cluster category, construct all tilted algebras whose…
A cluster algebra is an algebraic structure generated by operations of a quiver (a directed graph) called the mutations and their associated simple birational mappings. By using a graph-combinatorial approach, we present a systematic way to…
A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…
Motivated by the problem of designing inference-friendly Bayesian nonparametric models in probabilistic programming languages, we introduce a general class of partially exchangeable random arrays which generalizes the notion of hierarchical…
Language theory, symbolic dynamics, modelisation of viral insertion into the genetic code of a host cell motivate the introduction of new types of bialgebras whose coalgebra parts are not necessarily coassociative. One of the aim of this…
We study the relationship between $n$-cluster tilting modules over $n$ representation finite algebras and the Euler forms. We show that the dimension vectors of cluster-indecomposable modules give the roots of the Euler form. Moreover, we…