Drew Armstrong
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
Drew Armstrong has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Gregory S. Warrington
Gregory S. Warrington is a professor in the Department of Mathematics and Statistics at the University of Vermont in Burlington, Vermont, USA
3 shared publications - Nicholas A. Loehr
Department of Mathematics, Virginia Tech, Blacksburg, USA
3 shared publications - Brendon Rhoades
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
2 shared publications - Brendon Rhoades
Department of Mathematics, University of California, San Diego, La Jolla, USA
2 shared publications - Nathan Williams
University of Texas at Dallas, Richardson, USA
2 shared publications - Brant C. Jones
Department of Mathematics and Statistics, MSC 1911, James Madison University, Harrisonburg, USA
1 shared publication
Latest Publications
- Top Cited Papers
- 25 November 2015
- Published by Springer Nature in Annals of Combinatorics
- Vol. 20 (1) , 21-58
Rational Parking Functions and Catalan Numbers
- 25 November 2015
- Published by Springer Nature in Annals of Combinatorics
- Vol. 20 (1) , 21-58
Top Cited PapersRational Parking Functions and Catalan Numbers
- Open Access
Sweep maps: A continuous family of sorting algorithms
We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general. The sweep maps give concise combinatorial formulas for the q,t-Catalan numbers, the higher q,t-Catalan numbers, the q,t-square numbers, and many more general polynomials connected to the nabla operator and rational Catalan combinatorics. We prove that many algorithms that have appeared in the literature (including maps studied by Andrews, Egge, Gorsky, Haglund, Hanusa, Jones, Killpatrick, Krattenthaler, Kremer, Orsina, Mazin, Papi, Vaille, and the present authors) are all special cases of the sweep maps or their inverses. The sweep maps provide a very simple unifying framework for understanding all of these algorithms. We explain how inversion of the sweep map (which is an open problem in general) can be solved in known special cases by finding a "bounce path" for the lattice paths under consideration. We also define a generalized sweep map acting on words over arbitrary alphabets with arbitrary weights, which is also conjectured to be bijective.
Open AccessSweep maps: A continuous family of sorting algorithms
We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general. The sweep maps give concise combinatorial formulas for the q,t-Catalan numbers, the higher q,t-Catalan numbers, the q,t-square numbers, and many more general polynomials connected to the nabla operator and rational Catalan combinatorics. We prove that many algorithms that have appeared in the literature (including maps studied by Andrews, Egge, Gorsky, Haglund, Hanusa, Jones, Killpatrick, Krattenthaler, Kremer, Orsina, Mazin, Papi, Vaille, and the present authors) are all special cases of the sweep maps or their inverses. The sweep maps provide a very simple unifying framework for understanding all of these algorithms. We explain how inversion of the sweep map (which is an open problem in general) can be solved in known special cases by finding a "bounce path" for the lattice paths under consideration. We also define a generalized sweep map acting on words over arbitrary alphabets with arbitrary weights, which is also conjectured to be bijective.
- Open Access
Results and conjectures on simultaneous core partitions
An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b. These are related to abacus diagrams and the combinatorics of the affine symmetric group (type A). We observe that self-conjugate simultaneous core partitions correspond to the combinatorics of type C, and use abacus diagrams to unite the discussion of these two sets of objects. In particular, we prove that (2n)- and (2mn+1)-core partitions correspond naturally to dominant alcoves in the m-Shi arrangement of type C_n, generalizing a result of Fishel--Vazirani for type A. We also introduce a major statistic on simultaneous n- and (n+1)-core partitions and on self-conjugate simultaneous (2n)- and (2n+1)-core partitions that yield q-analogues of the Coxeter-Catalan numbers of type A and type C. We present related conjectures and open questions on the average size of a simultaneous core partition, q-analogs of generalized Catalan numbers, and generalizations to other Coxeter groups. We also discuss connections with the cyclic sieving phenomenon and q,t-Catalan numbers.
Open AccessResults and conjectures on simultaneous core partitions
An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b. These are related to abacus diagrams and the combinatorics of the affine symmetric group (type A). We observe that self-conjugate simultaneous core partitions correspond to the combinatorics of type C, and use abacus diagrams to unite the discussion of these two sets of objects. In particular, we prove that (2n)- and (2mn+1)-core partitions correspond naturally to dominant alcoves in the m-Shi arrangement of type C_n, generalizing a result of Fishel--Vazirani for type A. We also introduce a major statistic on simultaneous n- and (n+1)-core partitions and on self-conjugate simultaneous (2n)- and (2n+1)-core partitions that yield q-analogues of the Coxeter-Catalan numbers of type A and type C. We present related conjectures and open questions on the average size of a simultaneous core partition, q-analogs of generalized Catalan numbers, and generalizations to other Coxeter groups. We also discuss connections with the cyclic sieving phenomenon and q,t-Catalan numbers.
- Open Access
Rational parking functions and Catalan numbers
The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize this setup to rational parking functions indexed by a pair (a,b) of coprime positive integers. We show that these parking functions, which are counted by b^(a-1), carry a permutation representation of S_a in which the number of orbits is a rational Catalan number. We compute the Frobenius characteristic of the S_a-module of (a,b)-parking functions. Next we propose a combinatorial formula for a q-analogue of the rational Catalan numbers and relate this formula to a new combinatorial model for q-binomial coefficients. Finally, we discuss q,t-analogues of rational Catalan numbers and parking functions (generalizing the shuffle conjecture for the classical case) and present several conjectures.
Open AccessRational parking functions and Catalan numbers
The classical parking functions, counted by the Cayley number (n+1)^(n-1), carry a natural permutation representation of the symmetric group S_n in which the number of orbits is the n'th Catalan number. In this paper, we will generalize this setup to rational parking functions indexed by a pair (a,b) of coprime positive integers. We show that these parking functions, which are counted by b^(a-1), carry a permutation representation of S_a in which the number of orbits is a rational Catalan number. We compute the Frobenius characteristic of the S_a-module of (a,b)-parking functions. Next we propose a combinatorial formula for a q-analogue of the rational Catalan numbers and relate this formula to a new combinatorial model for q-binomial coefficients. Finally, we discuss q,t-analogues of rational Catalan numbers and parking functions (generalizing the shuffle conjecture for the classical case) and present several conjectures.
- Open Access
- 19 July 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (3) , P54
Rational Associahedra and Noncrossing Partitions
Each positive rational number $x>0$ can be written uniquely as $x=a/(b-a)$ for coprime positive integers $0<a0$ a simplicial complex $\mathsf{Ass}(x)=\mathsf{Ass}(a,b)$ called the rational associahedron. It is a pure simplicial complex of dimension $a-2$, and its maximal faces are counted by the rational Catalan number $$\mathsf{Cat}(x)=\mathsf{Cat}(a,b):=\frac{(a+b-1)!}{a!\,b!}.$$The cases $(a,b)=(n,n+1)$ and $(a,b)=(n,kn+1)$ recover the classical associahedron and its "Fuss-Catalan" generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that $\mathsf{Ass}(a,b)$ is shellable and give nice product formulas for its $h$-vector (the rational Narayana numbers) and $f$-vector (the rational Kirkman numbers). We define $\mathsf{Ass}(a,b)$ via rational Dyck paths: lattice paths from $(0,0)$ to $(b,a)$ staying above the line $y = \frac{a}{b}x$. We also use rational Dyck paths to define a rational generalization of noncrossing perfect matchings of $[2n]$. In the case $(a,b) = (n, mn+1)$, our construction produces the noncrossing partitions of $[(m+1)n]$ in which each block has size $m+1$.- 19 July 2013
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (3) , P54
Open AccessRational Associahedra and Noncrossing Partitions
Each positive rational number $x>0$ can be written uniquely as $x=a/(b-a)$ for coprime positive integers $0<a0$ a simplicial complex $\mathsf{Ass}(x)=\mathsf{Ass}(a,b)$ called the rational associahedron. It is a pure simplicial complex of dimension $a-2$, and its maximal faces are counted by the rational Catalan number $$\mathsf{Cat}(x)=\mathsf{Cat}(a,b):=\frac{(a+b-1)!}{a!\,b!}.$$The cases $(a,b)=(n,n+1)$ and $(a,b)=(n,kn+1)$ recover the classical associahedron and its "Fuss-Catalan" generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that $\mathsf{Ass}(a,b)$ is shellable and give nice product formulas for its $h$-vector (the rational Narayana numbers) and $f$-vector (the rational Kirkman numbers). We define $\mathsf{Ass}(a,b)$ via rational Dyck paths: lattice paths from $(0,0)$ to $(b,a)$ staying above the line $y = \frac{a}{b}x$. We also use rational Dyck paths to define a rational generalization of noncrossing perfect matchings of $[2n]$. In the case $(a,b) = (n, mn+1)$, our construction produces the noncrossing partitions of $[(m+1)n]$ in which each block has size $m+1$. - Open Access
Rational associahedra and noncrossing partitions
Each positive rational number x>0 can be written uniquely as x=a/(b-a) for coprime positive integers 0<a0 a simplicial complex \Ass(x)=\Ass(a,b) called the {\sf rational associahedron}. It is a pure simplicial complex of dimension a-2, and its maximal faces are counted by the {\sf rational Catalan number} \Cat(x)=\Cat(a,b):=\frac{(a+b-1)!}{a!\,b!}. The cases (a,b)=(n,n+1) and (a,b)=(n,kn+1) recover the classical associahedron and its "Fuss-Catalan" generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that \Ass(a,b) is shellable and give nice product formulas for its h-vector (the {\sf rational Narayana numbers}) and f-vector (the {\sf rational Kirkman numbers}). We define \Ass(a,b) via {\sf rational Dyck paths}: lattice paths from (0,0) to (b,a) staying above the line y = \frac{a}{b}x. We also use rational Dyck paths to define a rational generalization of noncrossing perfect matchings of [2n]. In the case (a,b) = (n, mn+1), our construction produces the noncrossing partitions of [(m+1)n] in which each block has size m+1.
Open AccessRational associahedra and noncrossing partitions
Each positive rational number x>0 can be written uniquely as x=a/(b-a) for coprime positive integers 0<a0 a simplicial complex \Ass(x)=\Ass(a,b) called the {\sf rational associahedron}. It is a pure simplicial complex of dimension a-2, and its maximal faces are counted by the {\sf rational Catalan number} \Cat(x)=\Cat(a,b):=\frac{(a+b-1)!}{a!\,b!}. The cases (a,b)=(n,n+1) and (a,b)=(n,kn+1) recover the classical associahedron and its "Fuss-Catalan" generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that \Ass(a,b) is shellable and give nice product formulas for its h-vector (the {\sf rational Narayana numbers}) and f-vector (the {\sf rational Kirkman numbers}). We define \Ass(a,b) via {\sf rational Dyck paths}: lattice paths from (0,0) to (b,a) staying above the line y = \frac{a}{b}x. We also use rational Dyck paths to define a rational generalization of noncrossing perfect matchings of [2n]. In the case (a,b) = (n, mn+1), our construction produces the noncrossing partitions of [(m+1)n] in which each block has size m+1.
- Open Access
- 1 March 2012
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 364 (3) , 1509-1528
The Shi arrangement and the Ish arrangement
This paper is about two arrangements of hyperplanes. The first -- the Shi arrangement -- was introduced by Jian-Yi Shi (1986) to describe the Kazhdan-Lusztig cells in the affine Weyl group of type . The second -- the Ish arrangement -- was recently defined by the first author, who used the two arrangements together to give a new interpretation of the -Catalan numbers of Garsia and Haiman. In the present paper we will define a mysterious ``combinatorial symmetry'' between the two arrangements and show that this symmetry preserves a great deal of information. For example, the Shi and Ish arrangements share the same characteristic polynomial, the same numbers of regions, bounded regions, dominant regions, regions with ``ceilings'' and ``degrees of freedom'', etc. Moreover, all of these results hold in the greater generality of ``deleted'' Shi and Ish arrangements corresponding to an arbitrary subgraph of the complete graph. Our proofs are based on nice combinatorial labelings of Shi and Ish regions and a new set partition-valued statistic on these regions.
- 1 March 2012
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 364 (3) , 1509-1528
Open AccessThe Shi arrangement and the Ish arrangement
This paper is about two arrangements of hyperplanes. The first -- the Shi arrangement -- was introduced by Jian-Yi Shi (1986) to describe the Kazhdan-Lusztig cells in the affine Weyl group of type . The second -- the Ish arrangement -- was recently defined by the first author, who used the two arrangements together to give a new interpretation of the -Catalan numbers of Garsia and Haiman. In the present paper we will define a mysterious ``combinatorial symmetry'' between the two arrangements and show that this symmetry preserves a great deal of information. For example, the Shi and Ish arrangements share the same characteristic polynomial, the same numbers of regions, bounded regions, dominant regions, regions with ``ceilings'' and ``degrees of freedom'', etc. Moreover, all of these results hold in the greater generality of ``deleted'' Shi and Ish arrangements corresponding to an arbitrary subgraph of the complete graph. Our proofs are based on nice combinatorial labelings of Shi and Ish regions and a new set partition-valued statistic on these regions.
- Open Access
Sorting orders, subword complexes, Bruhat order and total positivity
In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof of Bj\"orner and Wachs' result \cite{BW} that the proper part of Bruhat order is homotopy equivalent to the proper part of a Boolean algebra --- that is, to a sphere. We also obtain a geometric interpretation for sorting orders. We conclude with two new results: that the intersection of all sorting orders is the weak order, and the union of sorting orders is the Bruhat order.
Open AccessSorting orders, subword complexes, Bruhat order and total positivity
In this note we construct a poset map from a Boolean algebra to the Bruhat order which unveils an interesting connection between subword complexes, sorting orders, and certain totally nonnegative spaces. This relationship gives a new proof of Bj\"orner and Wachs' result \cite{BW} that the proper part of Bruhat order is homotopy equivalent to the proper part of a Boolean algebra --- that is, to a sphere. We also obtain a geometric interpretation for sorting orders. We conclude with two new results: that the intersection of all sorting orders is the weak order, and the union of sorting orders is the Bruhat order.
- Open Access
The Shi arrangement and the Ish arrangement
This paper is about two arrangements of hyperplanes. The first --- the Shi arrangement --- was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type $A$. The second --- the Ish arrangement --- was recently defined by the first author who used the two arrangements together to give a new interpretation of the $q,t$-Catalan numbers of Garsia and Haiman. In the present paper we will define a mysterious "combinatorial symmetry" between the two arrangements and show that this symmetry preserves a great deal of information. For example, the Shi and Ish arrangements share the same characteristic polynomial, the same numbers of regions, bounded regions, dominant regions, regions with $c$ "ceilings" and $d$ "degrees of freedom", etc. Moreover, all of these results hold in the greater generality of "deleted" Shi and Ish arrangements corresponding to an arbitrary subgraph of the complete graph. Our proofs are based on nice combinatorial labelings of Shi and Ish regions and a new set partition-valued statistic on these regions.Open AccessThe Shi arrangement and the Ish arrangement
This paper is about two arrangements of hyperplanes. The first --- the Shi arrangement --- was introduced by Jian-Yi Shi to describe the Kazhdan-Lusztig cells in the affine Weyl group of type $A$. The second --- the Ish arrangement --- was recently defined by the first author who used the two arrangements together to give a new interpretation of the $q,t$-Catalan numbers of Garsia and Haiman. In the present paper we will define a mysterious "combinatorial symmetry" between the two arrangements and show that this symmetry preserves a great deal of information. For example, the Shi and Ish arrangements share the same characteristic polynomial, the same numbers of regions, bounded regions, dominant regions, regions with $c$ "ceilings" and $d$ "degrees of freedom", etc. Moreover, all of these results hold in the greater generality of "deleted" Shi and Ish arrangements corresponding to an arbitrary subgraph of the complete graph. Our proofs are based on nice combinatorial labelings of Shi and Ish regions and a new set partition-valued statistic on these regions. - Top Cited Papers
- 1 January 2009
- Published by American Mathematical Society (AMS) in Memoirs of the American Mathematical Society
- Vol. 202 (949)
Generalized noncrossing partitions and combinatorics of Coxeter groups
- 1 January 2009
- Published by American Mathematical Society (AMS) in Memoirs of the American Mathematical Society
- Vol. 202 (949)
Top Cited PapersGeneralized noncrossing partitions and combinatorics of Coxeter groups