Related papers: Dimer face polynomials in knot theory and cluster …
This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
A subset $S$ of vertices of a graph $G$ is called a perfectly matchable set of $G$ if the subgraph induced by $S$ contains a perfect matching. The perfectly matchable set polynomial of $G$, first made explicit by Ohsugi and Tsuchiya, is the…
We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…
Motivated by a recent paper of G. Gr\"atzer, a finite distributive lattice $D$ is said to be fully principal congruence representable if for every subset $Q$ of $D$ containing $0$, $1$, and the set $J(D)$ of nonzero join-irreducible…
We study cluster algebras with principal coefficient systems that are associated to unpunctured surfaces. We give a direct formula for the Laurent polynomial expansion of cluster variables in these cluster algebras in terms of perfect…
Let $\widehat G \subseteq G$ be complex reductive algebraic groups. The branching problem that aims to study $G$-modules as $\widehat G$-modules is encoded by a collection of branching multiplicities parameterised by pairs of dominant…
Symmetric edge polytopes are lattice polytopes associated with finite simple graphs that are of interest in both theory and applications. We investigate the facet structure of symmetric edge polytopes for various models of random graphs.…
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 study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
We define Bernstein-Gelfand-Ponomarev reflection functors in the cluster categories of hereditary algebras. They are triangle equivalences which provide a natural quiver realization of the "truncated simple reflections" on the set of almost…
We construct a distributive algebraic lattice D that is not isomorphic to the congruence lattice of any lattice. This solves a long-standing open problem, traditionally attributed to R. P. Dilworth, from the forties. The lattice D has…
Let $G = (V, E)$ be a simple graph of order $n$. The total dominating set of $G$ is a subset $D$ of $V$ that every vertex of $V$ is adjacent to some vertices of $D$. The total domination number of $G$ is equal to minimum cardinality of…
$F$-polynomials are integer coefficient polynomials encoding the mutations of cluster variables inside a cluster algebra. In this article, we study the $F$-polynomials associated with the action of Donaldson-Thomas transformations on…
Let A be an associative algebra with identity over a field k. An atomistic subsemiring R of the lattice of subspaces of A, endowed with the natural product, is a subsemiring which is a closed atomistic sublattice. When R has no zero…
Zonotopal algebras (external, central, and internal) of an undirected graph G introduced by Postnikov-Shapiro and Holtz-Ron, are finite-dimensional commutative graded algebras whose Hilbert series contain a wealth of combinatorial…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…
The study of images of noncommutative polynomials on algebras has attracted considerable attention. We investigate polynomial images and the additive structures they generate in associative algebras, focusing on sums and products of values.…
We study the dimer model for a planar bipartite graph N embedded in a disk, with boundary vertices on the boundary of the disk. Counting dimer configurations with specified boundary conditions gives a point in the totally nonnegative…