Nicholas A. Loehr
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Nicholas A. Loehr has a total of 6 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
2 shared publications Herbert S. Wilf
Department of Mathematics University of Pennsylvania Philadelphia 19104-6395 PA
1 shared publication- Herbert S. Wilf
University of Pennsylvania
1 shared publication - James Haglund
Department of Mathematics, University of Pennsylvania, Philadelphia, USA
1 shared publication - Jeffrey B. Remmel
Department of Mathematics, UC San Diego, La Jolla, California 92093
1 shared publication - Mark Haiman
Dept. of Mathematics, University of California, Berkeley, CA
1 shared publication
Latest Publications
- Open Access
- 7 January 2005
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 12 (1) , R9
Conjectured Statistics for the Higher $q,t$-Catalan Sequences
This article describes conjectured combinatorial interpretations for the higher $q,t$-Catalan sequences introduced by Garsia and Haiman, which arise in the theory of symmetric functions and Macdonald polynomials. We define new combinatorial statistics generalizing those proposed by Haglund and Haiman for the original $q,t$-Catalan sequence. We prove explicit summation formulas, bijections, and recursions involving the new statistics. We show that specializations of the combinatorial sequences obtained by setting $t=1$ or $q=1$ or $t=1/q$ agree with the corresponding specializations of the Garsia-Haiman sequences. A third statistic occurs naturally in the combinatorial setting, leading to the introduction of $q,t,r$-Catalan sequences. Similar combinatorial results are proved for these trivariate sequences.- 7 January 2005
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 12 (1) , R9
Open AccessConjectured Statistics for the Higher $q,t$-Catalan Sequences
This article describes conjectured combinatorial interpretations for the higher $q,t$-Catalan sequences introduced by Garsia and Haiman, which arise in the theory of symmetric functions and Macdonald polynomials. We define new combinatorial statistics generalizing those proposed by Haglund and Haiman for the original $q,t$-Catalan sequence. We prove explicit summation formulas, bijections, and recursions involving the new statistics. We show that specializations of the combinatorial sequences obtained by setting $t=1$ or $q=1$ or $t=1/q$ agree with the corresponding specializations of the Garsia-Haiman sequences. A third statistic occurs naturally in the combinatorial setting, leading to the introduction of $q,t,r$-Catalan sequences. Similar combinatorial results are proved for these trivariate sequences. - 1 December 2004
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 143 (1) , 141-156
The combinatorics of a three-line circulant determinant
- 1 December 2004
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 143 (1) , 141-156
The combinatorics of a three-line circulant determinant
- Open Access
A Combinatorial Formula for Macdonald Polynomials
We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new combinatorial rule for the Kostka-Macdonald coefficients K_{lambda,mu}(q,t) in the case that mu is a partition with parts less than or equal to 2.
Open AccessA Combinatorial Formula for Macdonald Polynomials
We prove a combinatorial formula for the Macdonald polynomial H_mu(x;q,t) which had been conjectured by the first author. Corollaries to our main theorem include the expansion of H_mu(x;q,t) in terms of LLT polynomials, a new proof of the charge formula of Lascoux and Schutzenberger for Hall-Littlewood polynomials, a new proof of Knop and Sahi's combinatorial formula for Jack polynomials as well as a lifting of their formula to integral form Macdonald polynomials, and a new combinatorial rule for the Kostka-Macdonald coefficients K_{lambda,mu}(q,t) in the case that mu is a partition with parts less than or equal to 2.
- Open Access
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R68
Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weighted sums of labelled Dyck paths (or parking functions) relative to suitable statistics. This article introduces a third combinatorial formula that is shown to be equivalent to the first two. We show that the four statistics on labelled Dyck paths appearing in these formulas all have the same univariate distribution, which settles an earlier question of Haglund and Loehr. We then introduce analogous statistics on other collections of labelled lattice paths contained in trapezoids. We obtain a fermionic formula for the generating function for these statistics. We give bijective proofs of the equivalence of several forms of this generating function. These bijections imply that all the new statistics have the same univariate distribution. Using these new statistics, we conjecture combinatorial formulas for the Hilbert series of certain generalizations of the diagonal harmonics modules.
- 2 January 2004
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 11 (1) , R68
Open AccessConjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weighted sums of labelled Dyck paths (or parking functions) relative to suitable statistics. This article introduces a third combinatorial formula that is shown to be equivalent to the first two. We show that the four statistics on labelled Dyck paths appearing in these formulas all have the same univariate distribution, which settles an earlier question of Haglund and Loehr. We then introduce analogous statistics on other collections of labelled lattice paths contained in trapezoids. We obtain a fermionic formula for the generating function for these statistics. We give bijective proofs of the equivalence of several forms of this generating function. These bijections imply that all the new statistics have the same univariate distribution. Using these new statistics, we conjecture combinatorial formulas for the Hilbert series of certain generalizations of the diagonal harmonics modules.
- Open Access
The combinatorics of a three-line circulant determinant
We study the determinant of the pxp circulant matrix whose first row is (1,-x,0,...,0,-y,0,...,0), the -y being in position q+1. The coefficients of this polynomial are integers that count certain classes of permutations. We show that all of the permutations that contribute to a fixed monomial x^ry^s have the same sign, and we determine that sign. We prove that a monomial x^ry^s appears if and only if p divides r+sq. Finally, we show that the size of the largest coefficient of the monomials that appear grows exponentially with p. We do this by proving that the permanent of the circulant whose first row is (1,1,0,...,0,1,0,...,0) is the sum of the absolute values of the coefficients of the monomials in the original determinant.
Open AccessThe combinatorics of a three-line circulant determinant
We study the determinant of the pxp circulant matrix whose first row is (1,-x,0,...,0,-y,0,...,0), the -y being in position q+1. The coefficients of this polynomial are integers that count certain classes of permutations. We show that all of the permutations that contribute to a fixed monomial x^ry^s have the same sign, and we determine that sign. We prove that a monomial x^ry^s appears if and only if p divides r+sq. Finally, we show that the size of the largest coefficient of the monomials that appear grows exponentially with p. We do this by proving that the permanent of the circulant whose first row is (1,1,0,...,0,1,0,...,0) is the sum of the absolute values of the coefficients of the monomials in the original determinant.