Author pages are created from data sourced from our academic publisher partnerships and public sources.

Publications Influence

Share This Author

Rowmotion Orbits of Trapezoid Posets

- Quang Dao, Julian Wellman, C. Yost-Wolff, Sylvester W. Zhang
- MathematicsThe Electronic Journal of Combinatorics
- 12 February 2020

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… Expand

An Expansion Formula for Decorated Super-Teichmüller Spaces

- Gregg Musiker, N. Ovenhouse, Sylvester W. Zhang
- MathematicsSymmetry, Integrability and Geometry: Methods and…
- 18 February 2021

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… Expand

Double Dimer Covers on Snake Graphs from Super Cluster Expansions

- Gregg Musiker, N. Ovenhouse, Sylvester W. Zhang
- Mathematics
- 13 October 2021

In a recent paper, the authors gave combinatorial formulas for the Laurent expansions of super λ-lengths in a marked disk, generalizing Schiffler’s T -path formula. In the present paper, we give an… Expand

Rooted Clusters for Graph LP Algebras

- Esther Banaian, Sunita Chepuri, Elizabeth Kelley, Sylvester W. Zhang
- Mathematics, Computer Science
- 30 July 2021

TLDR

A Lattice Model for Super LLT Polynomials

- M. Curran, Claire Fréchette, C. Yost-Wolff, Sylvester W. Zhang, Valerie Zhang
- Mathematics
- 14 October 2021

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… Expand

RIBBON LATTICES AND RIBBON FUNCTION IDENTITIES

- M. Curran, C. Y. –. Wolff, Sylvester W. Zhang, Valerie Zhang
- Mathematics
- 2019

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… Expand

Arborescences of covering graphs

- Sunita Chepuri, CJ Dowd, A. Hardt, Greg Michel, Sylvester W. Zhang, Valerie Zhang
- MathematicsAlgebraic Combinatorics
- 2 December 2019

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… Expand

ARBORESCENCES OF DERIVED GRAPHS

- Valerie Zhang, Sylvester W. Zhang
- Mathematics
- 2019

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… Expand