We prove and extend the longest-standing conjecture in ‘ -Catalan combinatorics,’ namely, the combinatorial formula for conjectured by Loehr and Warrington, where is a Schur function and is an eigenoperator on Macdonald polynomials. Our approach is to establish a stronger identity of infinite series of characters involvingSchur Catalanimals; these were recently shown by the authors to represent Schur functions in subalgebras isomorphic to the algebra of symmetric functions over , where is the elliptic Hall algebra of Burban and Schiffmann. We establish a combinatorial formula for Schur Catalanimals as weighted sums of LLT polynomials, with terms indexed by configurations of nested lattice paths callednests, having endpoints and bounding constraints controlled by data called aden. The special case for proves the Loehr-Warrington conjecture, giving as a weighted sum of LLT polynomials indexed by systems of nested Dyck paths. In general, for our formula implies a new version of the Loehr-Warrington conjecture. In the case where each nest consists of a single lattice path, the nests in a den formula reduce to our previous shuffle theorem for paths under any line. Both this and the Loehr-Warrington formula generalize the shuffle theorem proven by Carlsson and Mellit (for ) and Mellit. Our formula here unifies these two generalizations.
more »
« less
Fixed points of parking functions
We define an action of words in on to give a new characterization of rational parking functions—they are exactly those words whose action has a fixed point. We use this viewpoint to give a simple definition of Gorsky, Mazin, and Vazirani’s zeta map on rational parking functions when and are coprime [Trans. Amer. Math. Soc. 368 (2016), pp. 8403–8445], and prove that this zeta map is invertible. A specialization recovers Loehr and Warrington’s sweep map on rational Dyck paths (see D. Armstrong, N. A. Loehr, and G. S. Warrington [Adv. Math. 284 (2015), pp. 159–185; E. Gorsky, M. Mazin, and M. Vazirani [Electron. J. Combin. 24 (2017), p. 29; H. Thomas and N. Williams, Selecta Math. (N.S.) 24 (2018), pp. 2003–2034]).
more »
« less
- Award ID(s):
- 2246877
- PAR ID:
- 10510571
- Publisher / Repository:
- Trans. Amer. Math. Soc.
- Date Published:
- Journal Name:
- Transactions of the American Mathematical Society
- ISSN:
- 0002-9947
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Let be analytic on with for some constants and and all . We show that the median estimate of under random linear scrambling with points converges at the rate for any . We also get a super-polynomial convergence rate for the sample median of random linearly scrambled estimates, when is bounded away from zero. When has a ’th derivative that satisfies a -Hölder condition then the median of means has error for any , if as . The proof techniques use methods from analytic combinatorics that have not previously been applied to quasi-Monte Carlo methods, most notably an asymptotic expression from Hardy and Ramanujan on the number of partitions of a natural number.more » « less
-
We show that for any even log-concave probability measure on , any pair of symmetric convex sets and , and any , where . This constitutes progress towards the dimensional Brunn-Minkowski conjecture (see Richard J. Gardner and Artem Zvavitch [Tran. Amer. Math. Soc. 362 (2010), pp. 5333–5353]; Andrea Colesanti, Galyna V. Livshyts, Arnaud Marsiglietti [J. Funct. Anal. 273 (2017), pp. 1120–1139]). Moreover, our bound improves for various special classes of log-concave measures.more » « less
-
Let be a bounded -Reifenberg flat domain, with small enough, possibly with locally infinite surface measure. Assume also that is an NTA (non-tangentially accessible) domain as well and denote by and the respective harmonic measures of and with poles . In this paper we show that the condition that is equivalent to being a chord-arc domain with inner unit normal belonging to .more » « less
-
We show that for any polynomial with positive leading coefficient and irreducible over , if is large enough then there is a string of consecutive integers for which is composite. This improves the result by Kevin Ford, Sergei Konyagin, James Maynard, Carl Pomerance, and Terence Tao [J. Eur. Math. Soc. (JEMS) 23 (2023), pp. 667–700], which has the exponent of being a constant depending on which can be exponentially small in the degree of .more » « less
An official website of the United States government

