Rational Catalan combinatorics

Similar documents
Rational Catalan Combinatorics: Intro

Catalan numbers, parking functions, and invariant theory

Counting chains in noncrossing partition lattices

Rational Catalan Combinatorics

Noncrossing Parking Functions

Torus Knots and q, t-catalan Numbers

A Survey of Parking Functions

Factorisations of the Garside element in the dual braid monoids

On the H-triangle of generalised nonnesting partitions

Outline. Some Reflection Group Numerology. Root Systems and Reflection Groups. Example: Symmetries of a triangle. Paul Renteln

Hyperplane Arrangements & Diagonal Harmonics

Dynamical algebraic combinatorics

SHELLABILITY AND HIGHER COHEN-MACAULAY CONNECTIVITY OF GENERALIZED CLUSTER COMPLEXES

RCC. Drew Armstrong. FPSAC 2017, Queen Mary, London. University of Miami armstrong

Finding parking when not commuting. Jon McCammond U.C. Santa Barbara

Finding parking when not commuting. Jon McCammond U.C. Santa Barbara

Affine permutations and rational slope parking functions

PARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA

Some Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley

arxiv: v2 [math.co] 9 May 2012

Hidden Symmetries of the Root Systems

Euler characteristic of the truncated order complex of generalized noncrossing partitions

q,t-fuß Catalan numbers for finite reflection groups

Lecture 3: Tropicalizations of Cluster Algebras Examples David Speyer

Rational Parking Functions

Some Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley

DISSERTATION. Titel der Dissertation. q, t-fuß-catalan numbers for finite reflection groups. q, t-fuß-catalan Zahlen für endliche Spiegelungsgruppen

arxiv: v2 [math.co] 10 Sep 2010

Catalan numbers Wonders of Science CESCI, Madurai, August

ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction

Combinatorial Algebra meets Algebraic Combinatorics Schedule

Schedule for Combinatorial Algebra meets Algebraic Combinatorics

DISSERTATION. Titel der Dissertation. q, t-fuß-catalan Zahlen für endliche Spiegelungsgruppen. Verfasser. Christian Stump

LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS

Catalan Numbers. Richard P. Stanley. June 9, 2017

arxiv: v2 [math.co] 21 Apr 2015

A proof of the Square Paths Conjecture

Tesler Matrices. Drew Armstrong. Bruce Saganfest Gainesville, March University of Miami armstrong

Equality of P-partition Generating Functions

A Proof of the q, t-square Conjecture

SB-LABELINGS AND POSETS WITH EACH INTERVAL HOMOTOPY EQUIVALENT TO A SPHERE OR A BALL

RESEARCH STATEMENT EUGENE GORSKY

Combinatorial Reciprocity Theorems

MA 524 Final Fall 2015 Solutions

NONCROSSING PARTITIONS FOR THE GROUP D n

arxiv: v1 [math.co] 24 Jul 2013

The Sorting Order on a Coxeter Group

Standard Young Tableaux Old and New

Problem 1. Let f n (x, y), n Z, be the sequence of rational functions in two variables x and y given by the initial conditions.

ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University

Outline. 1 Geometry and Commutative Algebra. 2 Singularities and Resolutions. 3 Noncommutative Algebra and Deformations. 4 Representation Theory

Clusters, Coxeter-sortable elements and noncrossing partitions

Enumerative Combinatorics with Fillings of Polyominoes

Combinatorics of the Cell Decomposition of Affine Springer Fibers

PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS

The (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania

A Combinatorial Proof for the Rank-Unimodality of Poset Order Ideals

CHRISTOS A. ATHANASIADIS, THOMAS BRADY, AND COLUM WATT

12. Hilbert Polynomials and Bézout s Theorem

Classification of root systems

Enumerative Combinatorics with Fillings of Polyominoes

CATALAN NUMBERS AND EXCEPTIONAL SEQUENCES

An injection from standard fillings to parking functions

Hereditary discrepancy and factorization norms

Dunkl operators, special functions and harmonic analysis. Schedule (as of August 8)

Workshop on B-stable ideals and nilpotent orbits

RSI 2009 ABSTRACTS Anirudha Balasubramanian

Fibonacci-18 Conference Schedule

NOTES FOR 128: COMBINATORIAL REPRESENTATION THEORY OF COMPLEX LIE ALGEBRAS AND RELATED TOPICS

Symmetries and Polynomials

The structure of euclidean Artin groups

PROPERTIES OF THE POSET OF DYCK PATHS ORDERED BY INCLUSION. by: Jennifer Woodcock for: Dr. Mike Zabrocki Math 6002 York University

Lecture 1. Toric Varieties: Basics

LECTURES ON SYMPLECTIC REFLECTION ALGEBRAS

A proof of the Square Paths Conjecture

Structural properties of non-crossing partitions from algebraic and geometric perspectives

A multiplicative deformation of the Möbius function for the poset of partitions of a multiset

Philip Puente. Statement of Research and Scholarly Interests 1 Areas of Interest

NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions

A diagrammatic representation of the Temperley Lieb algebra. Dana C. Ernst

arithmetic properties of weighted catalan numbers

MATH 402 : 2017 page 1 of 6

An Investigation on an Extension of Mullineux Involution

Combinatorial Reciprocity Theorems

Knot invariants, Hilbert schemes and Macdonald polynomials (joint with A. Neguț, J. Rasmussen)

arxiv:math/ v1 [math.co] 10 Nov 1998

arxiv: v2 [math.co] 11 Oct 2016

CS 468: Computational Topology Group Theory Fall b c b a b a c b a c b c c b a

The centers of gravity of the associahedron and of the permutahedron are the same

NOTES ON CHEREDNIK ALGEBRAS AND ALGEBRAIC COMBINATORICS, MONTREAL 2017

Categorified Hecke algebras, link homology, and Hilbert schemes

CHAINS OF MAXIMUM LENGTH IN THE TAMARI LATTICE

The Catalan matroid.

arxiv: v2 [math.co] 21 Mar 2017

arxiv: v2 [math.co] 3 Jan 2019

DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO

d-regular SET PARTITIONS AND ROOK PLACEMENTS

Root system chip-firing

Definitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations

A cyclic sieving phenomenon in Catalan Combinatorics

Transcription:

Rational Catalan combinatorics organized by Drew Armstrong, Stephen Griffeth, Victor Reiner, and Monica Vazirani Workshop Summary 1. Topics of the Workshop 1 The mathematics associated with the classical Catalan numbers 2n ) n+1( n is broad and surprisingly deep. In recent years this mathematics has become systematized under the framework of reflection groups. 1.1. RCA At the most general level, let G be a finite group acting irreducibly on V = C n and generated by reflections (where a reflection is a unitary operator fixing a hyperplane). Let N be the number of reflecting hyperplanes and let N be the number of reflections in G. We define the Coxeter number of G by h = N + N. n Recall that ring of coinvariants C[V ]/C[V ] G + is a graded version of the regular representation of G. Hence if U is any irreducible representation of G, then U appears with multiplicity dim U in the coinvariant ring. Let e 1 (U) e 2 (U) e dimu (U) be the degrees in which U occurs, and call these the exponents of U. If e 1 e 2 e n are the exponents of the defining representation V (called the exponents of G itself), then we call d i := e i + 1 the degrees of G. The Weyl algebra C[V V ] G encodes the action of G on differential operators. The Cherednik algebra H c (G) is the universal deformation of this algebra. For general parameters c C, H c (G) has no finite-dimensional representations. However, Berest, Etingof and Ginzburg proved that for a real reflection group G and each positive integer p equal to 1 modulo to the Coxeter number h, there exists a special finite dimensional representation of H p/h (G) called L p/h (triv), and calculated its W -equivariant Hilbert series. Griffeth and Gordon later proved analogous results for all reflection groups G and positive integers p coprime to h. In this generality, the Hilbert series of L p/c (triv) G equals Cat q (G, p) := n i=1 [p + e i (V )] q [d i ] q, (1) where V is an irreducible representation of G of dimension n (another reflection representation, closely related to the defining representation V ) and [A] q = 1 + q + q 2 + + q A 1 is the standard q-integer. We call (1) the rational Catalan number. Various simplifications occur in special cases. For example, if G = S a is the symmetric group with Coxeter number 1

2 h = a and if p = b coprime to a, then we have [ ] 1 a + b Cat q (S a, b) = [a + b] q a, b q = [a + b 1] q!, (2) [a] q! [b] q! where [A] q! = [A] q [A 1] q [2] q [1] q is the standard q-factorial. (The symmetry in (2) between a and b is interesting and not obvious.) Finally, as a special case of this we recover the classical q-catalan number [ ] 1 2n Cat q (S n, n + 1) =. (3) [n + 1] q n q 1.2. Enumeration At the other end of the spectrum, Nicolaus Fuss showed in 1791 that the numbers Cat(S n, mn + 1) = 1 ( ) (m + 1)n n n 1 enumerate the dissections of a convex (mn + 1)-gon into (m + 2)-gons. (The case m = 1 of polygon triangulations was studied earlier by his grandfather-in-law, Leonhard Euler.) Since then the Catalan numbers and their relatives have played a central role in enumerative combinatorics. Richard Stanley maintains a catalogue with hundreds of examples of interesting structures counted by Catalan numbers. In recent years, several families of such objects have begun to unify under the language of root systems and reflection groups. To name three examples: (1) The classical lattice of noncrossing partitions has been generalized to reflection groups. The structure of this poset is related to Garside structures, which provide classifying spaces and normal forms for Artin braid groups. Chain enumeration in the poset is related to Hurwitz type problems and the Lyashko-Looijenga map on the discriminant hypersurface. (2) The classical nonnesting partitions are defined as antichains in the poset of positive roots of a Weyl group. They are related to combinatorial labelings for the regions of the Shi hyperplane arrangement and the theory of parking functions. This is the combinatorics most clearly underlying the representation theory of RCA s. However, it seems not to generalize to non-crystallographic groups. (3) The classicial associahedron is a polytope whose incidence relations describe the dissections of a convex polygon. It was introduced by Stasheff as a basis for the homology of H-spaces. Fomin and Zelevinsky have generalized the associahedron to all root systems via their theory of cluster algebras. The occurrence of the Catalan numbers in example (2) is well-understood. However, Catalan formulas that occur in examples (1) and (3) have only been proved case-by-case using the classification of reflection groups. This is deeply unsatisfactory. A workshop was held at AIM in January 2005 ( Braid Groups, Clusters and Free Probability ) to examine these numerological coincidences. Since 2005, the subject of Catalan combinatorics has grown up to try to unify the examples (1), (2), (3). 1.3. Diagonal Harmonics. At the intersection of RCA theory and Catalan combinatorics, there is an extremely rich combinatorial theory that so far is specific to type A (the symmetric group). This is the theory of diagonal harmonics and the q, t-catalan numbers of Garsia

and Haiman. The central objects here are the nabla operator and the Macdonald symmetric functions. Recently there has emerged a q, t-version of the type A rational Catalan number: Cat q,t (a, b). Both of the symmetries Cat q,t (a, b) = Cat t,q (a, b) and Cat q,t (a, b) = Cat q,t (b, a) are interesting, non-trivial, and worthy of further study. 2. Goals of the workshop The program of Catalan Combinatorics emerged from the January 2005 AIM Workshop on Braid Groups, Clusters and Free Probability. In short: The same Catalan numerology had emerged in several different subjects and everyone wanted to know why. Since 2005 there have been several important breakthroughs, and the Catalan Combinatorics program has grown closer to the subject of q, t-catalan numbers and diagonal harmonics. However, a unifying framework is still missing. The three cultures working on the theories of rational Cherednik algebras, Catalan combinatorics and diagonal harmonics have until now been mostly disjoint. The main goal of the Dec 2012 workshop on Rational Catalan Combinatorics was to bring these three cultures together, in order to search for a unifying framework for Catalan combinatorics, stimulate each subject with outside points of view, catalyze progress on open problems, discover common interests and foundations for future collaboration, and open future possibilities in all three subjects. The strength of the RCA approach is that one can define rational Cherednik algebras for all complex reflection groups, and the representation-theoretic phenomena they share are casefee (i.e., independent of the Shephard-Todd classification). We hoped that the flexibility and generality of rational Cherednik algebras would suggest a unification of Catalan phenomena, under a new framework that we termed Rational Catalan Combinatorics. The theory of diagonal harmonics, being closely related to both RCA and Catalan combinatorics, may serve as a bridge between the two points of view. 3. Outcomes of the Workshop 3.1. Workshop activities There were two lectures each morning except for Friday, which had a single lecture. In addition to the lectures, there were guided exercise sessions on the first two afternoons. Since the workshop participants were coming from somewhat disjoint backgrounds, we felt it was important to get some hands-on experience with the objects of the workshop. Several participants remarked that these exercise sessions were helpful. The problems and solutions from the sessions will be available on the workshop website. On the Wednesday, Thursday and Friday afternoons we broke into small working groups. We came together twice (on Wednesday and Friday afternoon) for moderated problem sessions, to record and discuss the main open problems and questions. These problems will also be available on the workshop website. 3

4 The following was the schedule of the workshop: Monday Tuesday Morning Talks by Vic Reiner and Iain Gordon Talks by Drew Armstrong and Mark Haiman Wednesday Talks by Francois Bergeron and Eugene Gorsky Thursday Talks by Iain Gordon and Adriano Garsia Friday Talk by Roman Bezrukavnikov Afternoon Parallel exercise sessions run by Gwyn Bellamy and Christian Stump Exercise session run by Brendon Rhoades and Nathan Williams, followed by moderated problem session Working groups Working groups Moderated problem session, followed by working groups 3.2. Working groups Before breaking into working groups on Wednesday, Thursday and Friday afternoon, a moderator wrote down the proposed working topics and then participants voted on which working group to join. In the first round everyone voted as many times as they wished. In the second round the topics were read in increasing order of votes received, and each participant could only vote once. The AIM staff then sent the working groups to appropriate areas based on their size. Here are the topics discussed during the working groups: Posets of rational noncrossing partitions q, t-combinatorics of parallelogram polyominoes A nabla operator for wreath Macdonald polynomials Degenerating a distinguished basis from a finite-dimensional DAHA representation to the RCA Open problems for type A rational q, t-catalan numbers Cat q,t (a, b), including the invertibility of the Zeta map Lapointe s type B Macdonald polynomials Main Conjecture from the paper Parking Spaces and the magic HSOP Rational Tamari posets Cat(a, b) structures when gcd(a, b) = d > 1 3.3. Collaborations Several working groups reported progress on their problems and the beginnings of new collaborations. Haiman had some interesting discussions with Bezrukavnikov that led him to formulating a new plan of attack on a current project. Assaf, Bergeron and Niese are working a paper that arose from their Tamari combinatorics group. Various subsets of Armstrong, Fishel, Gorsky, Mazin, Vazirani, Warrington and Williams are working

on papers about the Zeta map on parking functions and the Pak-Stanley bijection to the Shi arrangement, and extending these results from (a, ma ± 1) to (a, b) coprime. More collaborations will become clear when the workshop website is up and running. 3.4. Future Impact This workshop discussed problems that are of deep interest from at least three different points of view. Groups of researchers came together who normally would not meet (Bezrukavnikov and Pak, for example, have known each other since high school, but this is the first conference that they have both attended). We learned about exciting work going on in closely related areas (Eugene Gorsky s talk, in particular, inspired many people). It too early yet to see, but we expect that the collaborations born at this workshop will have an important impact on the future of the field. 5