Related papers: Double Dimer Covers on Snake Graphs from Super Clu…
We give an explicit combinatorial formula for the Laurent expansion of any arc or closed curve on an unpunctured triangulated orbifold. We do this by extending the snake graph construction of Musiker, Schiffler, and Williams to unpunctured…
Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…
Motivated by the definition of super-Teichm\"uller spaces, and Penner-Zeitlin's recent extension of this definition to decorated super-Teichm\"uller space, as examples of super Riemann surfaces, we use the super Ptolemy relations to obtain…
Graph LP algebras are a generalization of cluster algebras introduced by Lam and Pylyavskyy. We provide a combinatorial proof of positivity for certain cluster variables in these algebras. This proof uses a hypergraph generalization of…
We provide multiple combinatorial expansion formulas - in terms of snake graphs, labelled posets, matrices, and $T$-walks - for elements in generalized cluster algebras associated to arcs on punctured orbifolds and illustrate their…
In this paper, we simplify and generalize formulas for the expansion of rank 2 cluster variables. In particular, we prove an equivalent, but simpler, description of the colored Dyck subpaths framework introduced by Lee and Schiffler. We…
This is a sequel to the second and third author's Mixed Dimer Configuration Model in Type $D$ Cluster Algebras where we extend our model to work for quivers that contain oriented cycles. Namely, we extend a combinatorial model for…
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…
The aim of the article is to understand the combinatorics of snake graphs by means of linear algebra. In particular, we apply Kasteleyn's and Temperley--Fisher's ideas about spectral properties of weighted adjacency matrices of planar…
One can explicitly compute the generators of a surface cluster algebra either combinatorially, through dimer covers of snake graphs, or homologically, through the CC-map applied to indecomposable modules over the appropriate algebra. Recent…
High-dimensional expanders generalize the notion of expander graphs to higher-dimensional simplicial complexes. In contrast to expander graphs, only a handful of high-dimensional expander constructions have been proposed, and no elementary…
Generalized cluster algebras from orbifolds were defined by Chekhov and Shapiro to give a combinatorial description of their Teichm\"uller spaces. One can also assign a gentle algebra to a triangulated orbifold, as in the work of…
In the past few years we have derived asymptotic expansions for lambda_d of the dimer problem and lambda_d(p) of the monomer-dimer problem. The many expansions so far computed are collected herein. We shine a light on results in two…
We prove a generalization of the Expander Mixing Lemma for arbitrary (finite) simplicial complexes. The original lemma states that concentration of the Laplace spectrum of a graph implies combinatorial expansion (which is also referred to…
Schur superpolynomials have been introduced recently as limiting cases of the Macdonald superpolynomials. It turns out that there are two natural super-extensions of the Schur polynomials: in the limit $q=t=0$ and $q=t\rightarrow\infty$,…
We give a module-theoretic interpretation of Schiffler's expansion formula which is defined combinatorially in terms of complete (T,r)-paths in order to get the expansion of the cluster variables in the cluster algebra of a marked surface…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
We conjecture a combinatorial formula for the monomial expansion of the image of any Schur function under the Bergeron-Garsia nabla operator. The formula involves nested labeled Dyck paths weighted by area and a suitable "diagonal…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
This paper uses the theory of dual equivalence graphs to give explicit Schur expansions for several families of symmetric functions. We begin by giving a combinatorial definition of the modified Macdonald polynomials and modified…