Related papers: Cluster Monomials in Graph Laurent Phenomenon Alge…
In this note, we study Laplacians on graphs for which connectivity within certain subgraphs tends to infinity. Our main focus are graphs sharing a common node set on which edge weights within certain clusters grow to infinity. As…
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…
We formalize the way in which one can think about cluster algebras of infinite rank by showing that every rooted cluster algebra of infinite rank can be written as a colimit of rooted cluster algebras of finite rank. Relying on the proof of…
We show that for cluster algebras associated with finite quivers without oriented cycles (with no coefficients), a seed is determined by its cluster, as conjectured by Fomin and Zelevinsky.We also obtain an interpretation of the monomial in…
Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a…
We show that clustered planarity with overlapping clusters as introduced by Didimo et al. can be solved in polynomial time if each cluster induces a connected subgraph. It can be solved in linear time if the set of clusters is the union of…
We introduce admissible group actions on cluster algebras, cluster categories and quivers with potential and study the resulting orbit spaces. The orbit space of the cluster algebra has the structure of a generalized cluster algebra. This…
We study a recurrence defined on a three dimensional lattice and prove that its values are Laurent polynomials in the initial conditions with all coefficients equal to one. This recurrence was studied by Propp and by Fomin and Zelivinsky.…
We study a type of calculus for proving inequalities between subgraph densities which is based on Jensen's inequality for the logarithmic function. As a demonstration of the method we verify the conjecture of Erd\"os-Simonovits and…
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 $\zS$ in a…
Motivated by a recent conjecture by Hernandez and Leclerc [arXiv:0903.1452], we embed a Fomin-Zelevinsky cluster algebra [arXiv:math/0104151] into the Grothendieck ring R of the category of representations of quantum loop algebras U_q(Lg)…
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between…
Building on work of Derksen-Fei and Plamondon, we formulate a conjectural correspondence between additive and monoidal categorifications of cluster algebras, which reveals a new connection between the additive reachability conjecture and…
We provide a concrete realization of the cluster algebras associated with Q-systems as amalgamations of cluster structures on double Bruhat cells in simple algebraic groups. For nonsimply-laced groups, this provides a cluster-algebraic…
This paper introduces a method for studying the correlation structure of a range of responses modelled by a multivariate generalised linear mixed model (MGLMM). The methodology requires the existence of clusters of observations and that…
We study a twisted version of Fraser, Lam, and Le's higher boundary measurement map, using face weights instead of edge weights, thereby providing Laurent polynomial expansions, in Pl\"ucker coordinates, for twisted web immanants for…
Polynomials in a category have been studied as a generalization of the traditional notion in mathematics. Their construction has recently been extended to higher groupoids, as formalized in homotopy type theory, by Finster, Mimram, Lucas…
In this paper, we apply the techniques developed in [5] to present several consequences of studying UMP algebras and the ramifications graph of a monomial bound quiver algebra. Specifically, we prove that every weakly connected component of…
The general linear group $GL_{n}$, along with its adjoint simple group $PGL_n$, can be described by means of weighted planar networks. In this paper we give a network description for simple Lie groups of types $B$ and $C$. The corresponding…
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…