Related papers: Comments on Exchange Graphs in Cluster Algebras
The low-energy expansion of closed-string scattering amplitudes at genus one introduces infinite families of non-holomorphic modular forms called modular graph forms. Their differential and number-theoretic properties motivated Brown's…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
Cluster algebras were introduced by S. Fomin and A. Zelevinsky in math.RT/0104151; their study continued in math.RA/0208229, math.RT/0305434. This is a family of commutative rings designed to serve as an algebraic framework for the theory…
Complex networks of real-world systems are believed to be controlled by common phenomena, producing structures far from regular or random. Clustering, community structure and assortative mixing by degree are perhaps among most prominent…
Computational problems concerning the orbit of a point under the action of a matrix group occur throughout computer science, including in program analysis, complexity theory, quantum computation, and automata theory. In many cases the focus…
The structure of many complex networks includes edge directionality and weights on top of their topology. Network analysis that can seamlessly consider combination of these properties are desirable. In this paper, we study two important…
We study the behavior of the clustering coefficient in tagged networks. The rich variety of tags associated with the nodes in the studied systems provide additional information about the entities represented by the nodes which can be…
Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…
Traditional clustering identifies groups of objects that share certain qualities. Tangles do the converse: they identify groups of qualities that often occur together. They can thereby discover, relate, and structure types: of behaviour,…
Let $A$ be a hereditary algebra. We construct a fundamental domain for the cluster category of $A$ inside the category of modules over the duplicated algebra $\bar{A}$ of $A$. We then prove that there exists a bijection between the tilting…
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…
In this thesis we give a construction of cyclic cocycles on convolution algebras twisted by gerbes over discrete translation groupoids. In his seminal book, Connes constructs a map from the equivariant cohomology of a manifold carrying the…
We introduce two refinements of the class of $5/2$-groups, inspired by the classes of automorphism groups of configurations and automorphism groups of unit circulant digraphs. We show that both of these classes have the property that any…
Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…
We consider skew-symmetrizable (upper) cluster algebras with a compatible Poisson structure, called $\mathsf{\Lambda}$-(upper) cluster algebras. For any two good elements (e.g., cluster monomials) in a $\mathsf{\Lambda}$-upper cluster…
We establish a cluster theoretical interpretation of the isomorphisms of [F.-H.-O.-O., J. Reine Angew. Math., 2022] among quantum Grothendieck rings of representations of quantum loop algebras. Consequently, we obtain a quantization of the…
We establish certain fundamental properties of $f$-vectors and $F$-matrices for generalized cluster algebras, including the initial and final seed mutation formulas, the compatibility property and the symmetry property. Along the way, we…
This is an introduction to some aspects of Fomin-Zelevinsky's cluster algebras and their links with the representation theory of quivers and with Calabi-Yau triangulated categories. It is based on lectures given by the author at summer…
We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…
We describe a connection between the subjects of cluster algebras, polynomial identity algebras and discriminants. For this, we define the notion of root of unity quantum cluster algebras and prove that they are polynomial identity…