Skip to search formSkip to main contentSkip to account menu

Rowmotion Orbits of Trapezoid Posets

Rowmotion is an invertible operator on the order ideals of a poset which has been extensively studied and is well understood for the rectangle poset. In this paper, we show that rowmotion is…
View PDF on arXiv (opens in a new tab)

An Expansion Formula for Decorated Super-Teichmüller Spaces

Motivated by the definition of super-Teichmüller spaces, and Penner–Zeitlin’s recent extension of this definition to decorated super-Teichmüller space, as examples of super Riemann surfaces, we use…
View PDF on arXiv (opens in a new tab)

Double Dimer Covers on Snake Graphs from Super Cluster Expansions

View PDF on arXiv (opens in a new tab)

Arborescences of covering graphs

An arborescence of a directed graph $\Gamma$ is a spanning tree directed toward a particular vertex $v$. The arborescences of a graph rooted at a particular vertex may be encoded as a polynomial…
View PDF on arXiv (opens in a new tab)

Matrix Formulae for Decorated Super Teichmüller Spaces

View PDF on arXiv (opens in a new tab)

A Lattice Model for Super LLT Polynomials

We introduce a solvable lattice model for supersymmetric LLT polynomials, also known as super LLT polynomials, based upon particle interactions in super n-ribbon tableaux. Using operators on a Fock…
View PDF on arXiv (opens in a new tab)

RIBBON LATTICES AND RIBBON FUNCTION IDENTITIES

We construct a family of generalized lattice models depending on a positive integer n whose partition functions are equal to the n-ribbon functions introduced by Lascoux, Leclerc and Thibon. Using…

SCANNABLE DIVIDES OF FINITE MUTATION TYPE

Ever since the inception of cluster algebras by S. Fomin and A. Zelevinsky [FZ01], the combinatorial theory of quiver mutations has been found to bridge seemingly unrelated areas of mathematics.…

ARBORESCENCES OF DERIVED GRAPHS

1.1. Arborescences. Let Γ = (V,E,wt) be an edge-weighted quiver—that is, a directed multigraph with a function on the edges wt ∶ E → R, where R is some ring. We usually abbreviate “edge-weighted” to…

Rooted Clusters for Graph LP Algebras

This work proves positivity for clusters of LP algebras by giving explicit formulas for each cluster variable and gives a combinatorial interpretation for these expansions using a generalization of T-paths.
View PDF on arXiv (opens in a new tab)
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)