Gregory S. Warrington
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Gregory S. Warrington has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Nicholas A. Loehr
Department of Mathematics, Virginia Tech, Blacksburg, USA
9 shared publications Nicholas A. Loehr
6 shared publications- Drew Armstrong
University of Miami
3 shared publications - Cole Charbonneau2 shared publications
- Mazie O'COnnor2 shared publications
- Nicholas A. Loehr
Department of Mathematics University of Pennsylvania 19104 Philadelphia PA
2 shared publications
Latest Publications
- Open Access
- 2 February 2026
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 5 (4)
Skeletal generalizations of chip-firing games, parking functions, and Dyck paths
For 0 ⩽ k ⩽ n-1, we introduce a family of k-skeletal paths which are counted by the nth Catalan number for each k, and specialize to Dyck paths when k = n-1. We similarly introduce k-skeletal parking functions which are equinumerous with spanning trees on the complete graph with n + 1 vertices for each k, and specialize to classical parking functions for k = n-1. The preceding constructions are generalized to paths lying in a trapezoid with base c > 0 and southeastern diagonal of slope 1/m; c and m need not be integers. We give bijections among these families when k varies with m and c fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry.
- 2 February 2026
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 5 (4)
Open AccessSkeletal generalizations of chip-firing games, parking functions, and Dyck paths
For 0 ⩽ k ⩽ n-1, we introduce a family of k-skeletal paths which are counted by the nth Catalan number for each k, and specialize to Dyck paths when k = n-1. We similarly introduce k-skeletal parking functions which are equinumerous with spanning trees on the complete graph with n + 1 vertices for each k, and specialize to classical parking functions for k = n-1. The preceding constructions are generalized to paths lying in a trapezoid with base c > 0 and southeastern diagonal of slope 1/m; c and m need not be integers. We give bijections among these families when k varies with m and c fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry.
- Open Access
Skeletal generalizations of Dyck paths, parking functions, and chip-firing games
For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are equinumerous with the spanning trees on $n+1$ vertices for each $k$, and specialize to classical parking functions for $k=n-1$. The preceding constructions are generalized to paths lying in a trapezoid with base $c > 0$ and southeastern diagonal of slope $1/m$; $c$ and $m$ need not be integers. We give bijections among these families when $k$ varies with $m$ and $c$ fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry.Open AccessSkeletal generalizations of Dyck paths, parking functions, and chip-firing games
For $0\leq k\leq n-1$, we introduce a family of $k$-skeletal paths which are counted by the $n$-th Catalan number for each $k$, and specialize to Dyck paths when $k=n-1$. We similarly introduce $k$-skeletal parking functions which are equinumerous with the spanning trees on $n+1$ vertices for each $k$, and specialize to classical parking functions for $k=n-1$. The preceding constructions are generalized to paths lying in a trapezoid with base $c > 0$ and southeastern diagonal of slope $1/m$; $c$ and $m$ need not be integers. We give bijections among these families when $k$ varies with $m$ and $c$ fixed. Our constructions are motivated by chip firing and have connections to combinatorial representation theory and tropical geometry. - 25 November 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
A rooted variant of Stanley's chromatic symmetric function
- 25 November 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
A rooted variant of Stanley's chromatic symmetric function
- Open Access
A rooted variant of Stanley's chromatic symmetric function
Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we require the root vertex to either use or avoid a specified color. We present combinatorial identities and recursions satisfied by these rooted chromatic polynomials, explain their relation to pointed chromatic functions and rooted $U$-polynomials, and prove three main theorems. First, for all non-empty connected graphs $G$, Stanley's polynomial $X_G(x_1,\ldots,x_N)$ is irreducible in $\mathbb{Q}[x_1,\ldots,x_N]$ for all large enough $N$. The same result holds for our rooted variant where the root node must avoid a specified color. We prove irreducibility by a novel combinatorial application of Eisenstein's Criterion. Second, we prove the rooted version of Stanley's Conjecture: two rooted trees are isomorphic as rooted graphs if and only if their rooted chromatic polynomials are equal. In fact, we prove that a one-variable specialization of the rooted chromatic polynomial (obtained by setting $x_0=x_1=q$, $x_2=x_3=1$, and $x_n=0$ for $n>3$) already distinguishes rooted trees. Third, we answer a question of Pawlowski by providing a combinatorial interpretation of the monomial expansion of pointed chromatic functions.Open AccessA rooted variant of Stanley's chromatic symmetric function
Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we require the root vertex to either use or avoid a specified color. We present combinatorial identities and recursions satisfied by these rooted chromatic polynomials, explain their relation to pointed chromatic functions and rooted $U$-polynomials, and prove three main theorems. First, for all non-empty connected graphs $G$, Stanley's polynomial $X_G(x_1,\ldots,x_N)$ is irreducible in $\mathbb{Q}[x_1,\ldots,x_N]$ for all large enough $N$. The same result holds for our rooted variant where the root node must avoid a specified color. We prove irreducibility by a novel combinatorial application of Eisenstein's Criterion. Second, we prove the rooted version of Stanley's Conjecture: two rooted trees are isomorphic as rooted graphs if and only if their rooted chromatic polynomials are equal. In fact, we prove that a one-variable specialization of the rooted chromatic polynomial (obtained by setting $x_0=x_1=q$, $x_2=x_3=1$, and $x_n=0$ for $n>3$) already distinguishes rooted trees. Third, we answer a question of Pawlowski by providing a combinatorial interpretation of the monomial expansion of pointed chromatic functions. - 1 December 2021
- Published by SAGE Publications in Election Law Journal: Rules, Politics, and Policy
- Vol. 20 (4) , 330-344
Simulated Packing and Cracking
We introduce simulated packing and cracking as a technique for evaluating partisan-gerrymandering measures. We apply it to historical congressional and legislative elections to evaluate four measures: partisan bias, declination, efficiency gap, and mean-median difference. While the efficiency gap recognizes simulated packing and cracking in a completely predictable manner (a fact that follows immediately from the efficiency gap's definition) and the declination does a very good job of recording simulated packing and cracking, we conclude that both of the other two measures record it less well. This variation is especially notable given the frequent use of such measures in outlier analyses.
- 1 December 2021
- Published by SAGE Publications in Election Law Journal: Rules, Politics, and Policy
- Vol. 20 (4) , 330-344
Simulated Packing and Cracking
We introduce simulated packing and cracking as a technique for evaluating partisan-gerrymandering measures. We apply it to historical congressional and legislative elections to evaluate four measures: partisan bias, declination, efficiency gap, and mean-median difference. While the efficiency gap recognizes simulated packing and cracking in a completely predictable manner (a fact that follows immediately from the efficiency gap's definition) and the declination does a very good job of recording simulated packing and cracking, we conclude that both of the other two measures record it less well. This variation is especially notable given the frequent use of such measures in outlier analyses.
- 1 September 2019
- Published by SAGE Publications in Election Law Journal: Rules, Politics, and Policy
- Vol. 18 (3) , 262-281
A Comparison of Partisan-Gerrymandering Measures
We compare and contrast 14 measures that have been proposed for the purpose of quantifying partisan gerrymandering. We consider measures that, rather than examining the shapes of districts, utilize only the partisan vote distribution among districts. The measures considered are two versions of partisan bias, the efficiency gap and several of its variants, the mean-median difference and the equal vote weight standard, the declination and one variant, and the lopsided-means test. Our primary means of evaluating these measures is a suite of hypothetical elections we classify from the start as fair or unfair. We conclude that the declination is the most successful measure in terms of avoiding false positives and false negatives on the elections considered. We include in a Supplementary appendix the most extreme outliers for each measure among historical congressional and state legislative elections.
- 1 September 2019
- Published by SAGE Publications in Election Law Journal: Rules, Politics, and Policy
- Vol. 18 (3) , 262-281
A Comparison of Partisan-Gerrymandering Measures
We compare and contrast 14 measures that have been proposed for the purpose of quantifying partisan gerrymandering. We consider measures that, rather than examining the shapes of districts, utilize only the partisan vote distribution among districts. The measures considered are two versions of partisan bias, the efficiency gap and several of its variants, the mean-median difference and the equal vote weight standard, the declination and one variant, and the lopsided-means test. Our primary means of evaluating these measures is a suite of hypothetical elections we classify from the start as fair or unfair. We conclude that the declination is the most successful measure in terms of avoiding false positives and false negatives on the elections considered. We include in a Supplementary appendix the most extreme outliers for each measure among historical congressional and state legislative elections.
- Open Access
Accumulation charts for instant-runoff elections
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 easy to understand, clearly indicates the winner, depicts the instant-runoff algorithm, and summarizes the votes cast. Moreover, it includes the pedigree of each accumulated vote and gives a clear depiction of candidates' coalitions.
Open AccessAccumulation charts for instant-runoff elections
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 easy to understand, clearly indicates the winner, depicts the instant-runoff algorithm, and summarizes the votes cast. Moreover, it includes the pedigree of each accumulated vote and gives a clear depiction of candidates' coalitions.
- 1 January 2019
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (1) , 113-127
Quasisymmetric and Schur expansions of cycle index polynomials
- 1 January 2019
- Published by Elsevier in Discrete Mathematics
- Vol. 342 (1) , 113-127
Quasisymmetric and Schur expansions of cycle index polynomials
- Open Access
Introduction to the declination function for gerrymanders
The declination is a quantitative method for identifying possible partisan gerrymanders by analyzing vote distributions. In this expository note we explain and motivate the definition of the declination. The minimal computer code required for computing the declination is included. We end by computing its value on several recent elections.
Open AccessIntroduction to the declination function for gerrymanders
The declination is a quantitative method for identifying possible partisan gerrymanders by analyzing vote distributions. In this expository note we explain and motivate the definition of the declination. The minimal computer code required for computing the declination is included. We end by computing its value on several recent elections.
- 1 October 2017
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 531, 285-304
Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and Sudoku boards
- 1 October 2017
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 531, 285-304
Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and Sudoku boards