Related papers: Minimal Matchings for dP3 Cluster Variables
We give a combinatorial model for F-polynomials and g-vectors for type D cluster algebras where the associated quiver is acyclic. Our model utilizes a combination of dimer configurations and double dimer configurations which we refer to as…
To every knot (or link) diagram K, we associate a cluster algebra A that contains a cluster x with the property that every cluster variable in x specializes to the Alexander polynomial of K. We call x the knot cluster of A. Furthermore,…
Classification of cluster variables in cluster algebras (in particular, Grassmannian cluster algebras) is an important problem, which has direct application to computations of scattering amplitudes in physics. In this paper, we apply the…
We study the deformation theory of the Stanley-Reisner rings associated to cluster complexes for skew-symmetrizable cluster algebras of geometric and finite cluster type. In particular, we show that in the skew-symmetric case, these cluster…
Associated to any acyclic cluster algebra is a corresponding triangulated category known as the cluster category. It is known that there is a one-to-one correspondence between cluster variables in the cluster algebra and exceptional…
First, this article develops the theory of weaves and their cluster structures for the affine cones of positroid varieties. In particular, we explain how to construct a weave from a reduced plabic graph, show it is Demazure, compare their…
We give an account of mutation of theta functions in cluster scattering diagrams, starting with a notion of mutation that is related to, but different from, the notion of mutation defined by Gross, Hacking, Keel, and Kontsevich. This…
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. The number or size of the output clusters is not constrained…
We prove that each semi-invariant ring of the complete triple flag of length $n$ is an upper cluster algebra associated to an ice hive quiver. We find a rational polyhedral cone ${\sf G}_n$ such that the generic cluster character maps its…
Cylindrical Algebraic Decomposition (CAD) algorithms typically produce a decomposition adapted to a finite family of semi-algebraic sets $\mathcal{F}$ (i.e. every member of $\mathcal{F}$ is a union of cells). Different algorithms may…
The cluster algebra of any acyclic quiver can be realized as the coordinate ring of a subvariety of a Kac-Moody group -- the quiver is an orientation of its Dynkin diagram, defining a Coxeter element and thereby a double Bruhat cell. We use…
Context Mixed-metal clusters have long been studied because of their peculiar properties and how they change with cluster size, composition and charge state and their potential roles in catalysis. The characterization of these clusters is…
We give an explicit description of the mutation classes of quivers of type \tilde{A}_n. Furthermore, we provide a complete classification of cluster tilted algebras of type \tilde{A}_n up to derived equivalence. We show that the bounded…
We introduce a family of cluster algebras of infinite rank associated with root systems of type $A$, $D$, $E$. We show that suitable completions of these cluster algebras are isomorphic to the Grothendieck rings of the categories…
Let $\mathbf{P}_{2n+2}$ be the regular polygon with $2n+2$ vertices, and let $\theta$ be the rotation of 180$^\circ$. Fomin and Zelevinsky proved that $\theta$-invariant triangulations of $\mathbf{P}_{2n+2}$ are in bijection with the…
The exchange graph of a cluster algebra encodes the combinatorics of mutations of clusters. Through the recent "categorifications" of cluster algebras using representation theory one obtains a whole variety of exchange graphs associated…
Dimensionality reduction techniques play an essential role in data analytics, signal processing and machine learning. Dimensionality reduction is usually performed in a preprocessing stage that is separate from subsequent data analysis,…
On a finite weighted graph, the dimer model is a probability measure on its dimer covers, that assigns to any cover a probability proportional to the product of the weights of its edges. For planar bipartite graphs, dimer correlations are…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
Fairly shortly after the publication of the Aztec diamond theorem of Elkies, Kuperberg, Larsen and Propp in 1992, interest arose in finding the number of domino tilings of an Aztec diamond with an ``Aztec window,'' i.e.\ a hole in the shape…