skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: q,t$q,t$‐Catalan measures
Abstract We introduce the ‐Catalan measures, a sequence of piece‐wise polynomial measures on . These measures are defined in terms of suitable area, dinv, and bounce statistics on continuous families of paths in the plane, and have many combinatorial similarities to the ‐Catalan numbers. Our main result realizes the ‐Catalan measures as a limit of higher ‐Catalan numbers as . We also give a geometric interpretation of the ‐Catalan measures. They are the Duistermaat–Heckman measures of the punctual Hilbert schemes parametrizing subschemes of supported at the origin.  more » « less
Award ID(s):
1945212
PAR ID:
10508996
Author(s) / Creator(s):
Publisher / Repository:
London Math. Soc.
Date Published:
Journal Name:
Bulletin of the London Mathematical Society
Volume:
56
Issue:
3
ISSN:
0024-6093
Page Range / eLocation ID:
1207 to 1226
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. We define two symmetric $q,t$-Catalan polynomials in terms of the area and depth statistic and in terms of the dinv and dinv of depth statistics. We prove symmetry using an involution on plane trees. The same involution proves symmetry of the Tutte polynomials. We also provide a combinatorial proof of a remark by Garsia et al. regarding parking functions and the number of connected graphs on a fixed number of vertices. 
    more » « less
  2. Chen, Zezhi (Ed.)
    We analyze both finite and infinite systems of Riccati equations derived from stochastic differential games on infinite networks. We discuss a connection to the Catalan numbers and the convergence of the Catalan functions by Fourier transforms. 
    more » « less
  3. Abstract For a Weyl group W of rank r , the W -Catalan number is the number of antichains of the poset of positive roots, and the W -Narayana numbers refine the W -Catalan number by keeping track of the cardinalities of these antichains. The W -Narayana numbers are symmetric – that is, the number of antichains of cardinality k is the same as the number of cardinality $r-k$ . However, this symmetry is far from obvious. Panyushev posed the problem of defining an involution on root poset antichains that exhibits the symmetry of the W -Narayana numbers. Rowmotion and rowvacuation are two related operators, defined as compositions of toggles, that give a dihedral action on the set of antichains of any ranked poset. Rowmotion acting on root posets has been the subject of a significant amount of research in the recent past. We prove that for the root posets of classical types, rowvacuation is Panyushev’s desired involution. 
    more » « less
  4. We initiate a systematic study of key-avoidance on alternating sign matrices (ASMs) defined via pattern-avoidance on an associated permutation called the \emph{key} of an ASM. We enumerate alternating sign matrices whose key avoids a given set of permutation patterns in several instances. We show that ASMs whose key avoids $231$ are permutations, thus any known enumeration for a set of permutation patterns including $231$ extends to ASMs. We furthermore enumerate by the Catalan numbers ASMs whose key avoids both $312$ and $321$. We also show ASMs whose key avoids $312$ are in bijection with the gapless monotone triangles of [Ayyer, Cori, Gouyou-Beauchamps 2011]. Thus key-avoidance generalizes the notion of $312$-avoidance studied there. Finally, we enumerate ASMs with a given key avoiding $312$ and $321$ using a connection to Schubert polynomials, thereby deriving an interesting Catalan identity. Comment: 28 pages 
    more » « less
  5. Abstract We solve two open problems in Coxeter–Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type‐uniform proof that these noncrossing Catalan objects are counted by the rational Coxeter–Catalan number, using the character theory of the associated Hecke algebra and the properties of Lusztig's exotic Fourier transform. We solve the same problems for rational noncrossing parking objects. 
    more » « less