Related papers: Comments on Exchange Graphs in Cluster Algebras
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
Rooted acyclic graphs appear naturally when the phylogenetic relationship of a set $X$ of taxa involves not only speciations but also recombination, horizontal transfer, or hybridization, that cannot be captured by trees. A variety of…
The finite dihedral group generated by one rotation and one flip is the simplest case of the non-abelian group. Cayley graphs are diagrammatic counterparts of groups. In this paper, much attention is given to the Cayley graph of the…
This is a reasonably self-contained exposition of the fascinating interplay between cluster algebras and the dilogarithm in the past two decades. The dilogarithm has a long and rich history since it was studied by Euler. The most intriguing…
Apart from the role the clustering coefficient plays in the definition of the small-world phenomena, it also has great relevance for practical problems involving networked dynamical systems. To study the impact of the clustering coefficient…
We introduce a category of cluster algebras with fixed initial seeds. This category has countable coproducts, which can be constructed combinatorially, but no products. We characterise isomorphisms and monomorphisms in this category and…
For any simple Lie algebra g and any complex number q which is not zero or a nontrivial root of unity, we construct a dynamical quantum group (Hopf algebroid), whose representation theory is essentially the same as the representation theory…
We use the periodicities of cluster groupoid mutations established by Li and the second author to prove that the dilogarithm identities of higher degree obtained by Nakanishi follow from the classical dilogarithm identities associated to a…
We conjecture a characterization of a cluster automorphism as an algebra homomorphism from the cluster algebra to itself that restricts to a bijection between two clusters. This formulation does not require that the map commutes with…
Trait allocations are a class of combinatorial structures in which data may belong to multiple groups and may have different levels of belonging in each group. Often the data are also exchangeable, i.e., their joint distribution is…
The goal of invariant theory is to find all the generators for the algebra of representations of a group that leave the group invariant. Such generators will be called \emph{basic invariants}. In particular, we set out to find the set of…
The Temperley-Lieb and Brauer algebras and their cyclotomic analogues, as well as the partition algebra, are all examples of twisted semigroup algebras. We prove a general theorem about the cellularity of twisted semigroup algebras of…
Recently, graph matching algorithms have been successfully applied to the problem of network de-anonymization, in which nodes (users) participating to more than one social network are identified only by means of the structure of their links…
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…
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
Construction of non-isomorphic cospectral graphs is a nontrivial problem in spectral graph theory specially for large graphs. In this paper, we establish that graph theoretical partial transpose of a graph is a potential tool to create…
Context: Edge graphs are graphs whose edges are labelled with identifiers, and nodes can have multiple edges between them. They are used to model a wide range of systems, including networks with distances or degrees of connection and…
This paper studies cluster algebras locally, by identifying a special class of localizations which are themselves cluster algebras. A `locally acyclic cluster algebra' is a cluster algebra which admits a finite cover (in a geometric sense)…
Recent advances in Bayesian models for random partitions have led to the formulation and exploration of Exchangeable Sequences of Clusters (ESC) models. Under ESC models, it is the cluster sizes that are exchangeable, rather than the…
Inspired by the ideas and techniques used in the study of cluster algebras we construct a new class of algebras, called bistellar cluster algebras, from closed oriented triangulated even-dimensional manifolds by performing…