activity
20002026
most citedKazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations

16 citations · 62 across the 23 of their papers we have counts for

collaborators

29 papers

math.CO2026

Quantized rational chip-firing

Spencer Backman, Nicholas A. Loehr, Gregory S. Warrington

This article introduces a quantized chip-firing model with close connections to the theory of rational lattice paths and rational parking functions. Given a graph with a sink and p…

math.CO2024

Skeletal generalizations of Dyck paths, parking functions, and chip-firing games

Spencer Backman, Cole Charbonneau, Nicholas A. Loehr +3

For , we introduce a family of -skeletal paths which are counted by the -th Catalan number for each , and specialize to Dyck paths when . We simila…

math.CO2022

A rooted variant of Stanley's chromatic symmetric function

Nicholas A. Loehr, Gregory S. Warrington

Richard Stanley defined the chromatic symmetric function of a graph and asked whether there are non-isomorphic trees and with . We study variants of the…

math.CO2020

Abacus-histories and the combinatorics of creation operators

Nicholas A. Loehr, Gregory S. Warrington

Creation operators act on symmetric functions to build Schur functions, Hall--Littlewood polynomials, and related symmetric functions one row at a time. Haglund, Morse, Zabrocki, a…

physics.soc-ph2020

Simulated packing and cracking

Jeffrey S. Buzas, Gregory S. Warrington

We introduce simulated packing and cracking as a technique for evaluating partisan-gerrymandering measures. We apply it to historical congressional and legislative elections to eva…

physics.soc-ph2019

Accumulation charts for instant-runoff elections

Bridget Eileen Tenner, Gregory S. Warrington

We propose a new graphical format for instant-runoff voting election results. We call this proposal an "accumulation chart." This model, a modification of standard bar charts, is e…