The (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania
|
|
- Jane Barber
- 5 years ago
- Views:
Transcription
1 The (q, t)-catalan Numbers and the Space of Diagonal Harmonics James Haglund University of Pennsylvania
2 Outline Intro to q-analogues inv and maj q-catalan Numbers MacMahon s q-analogue The Carlitz-Riordan q-analogue Intro to Symmetric Functions The monomial symmetric functions The elementary symmetric functions The power-sum symmetric functions The Schur functions
3 The Macdonald Polynomials Selberg s Integral Plethysm and the q, t-kostka matrix The modules V (µ) and the diagonal action The Space of Diagonal Harmonics The Hilbert and Frobenius Series The operator and the q, t- Catalan Combinatorial Interpretations The bounce statistic Extension to parking functions The m-parameter q, t-catalan
4 Permutation Statistics and q-analogues In combinatorics a statistic on a finite set S is a mapping from S N given by an explicit combinatorial rule. Ex. Given π = π 1 π 2 π n S n, define invπ = {(i, j) : i<j and π i >π j } and majπ = If π = 31542, and π i >π i+1 i. invπ =2+2+1=5 majπ =1+3+4=8.
5 Let and (n) q =(1 q n )/(1 q) (n!) q = =1+q q n 1 n (i) q i=1 =(1+q)(1+q+q 2 ) (1+q+...+q n 1 ) be the q-analogues of n and n!. Then q invπ =(n!) q = q majπ. π Sn π Sn
6 Partitions and the Gaussian Polynomials Let λ =(λ 1,λ 2,...,λ n ), λ i N for 1 i n be a partition and let λ = i λ i. Define ( n k ) q = (n!) q (k!) q ((n k)!) q. Theorem. For n, k N, ( ) n + k = k q (λ 1,...,λn) (k,k,...,k) q λ. Note: We denote the conjugate partition by λ. Example n = k =2. TheFerrers shapes are
7 1 2 q q q 2 q 3 q 4 The Catalan Numbers Recurrence: C n = 1 n +1 C n = n k=1 ( ) 2n n C k 1 C n k Over 70 interpretations in Stanley s Enumerative Combinatorics Volume 2, including
8 The number of standard tableaux of shape (n, n): The number of Catalan words, i.e. mulitset permutations of {0 n 1 n } where in any initial segment, the number of zeros is at least as big as the number of ones The number of Catalan paths from (0, 0) to (n, n), i.e. lattice paths consisting of N and E steps which never go below the main diagonal.
9 A Catalan Path
10 Theorem. (MacMahon) q maj(σ) 1 = (n +1) q Catalan words σ The Carlitz-Riordan q-catalan Let D n denote the set of Catalan paths, and set C n (q) = σ Dn q area(σ) where area(σ) isthenumberof squares below the path and strictly above the diagonal. Proposition. n C n (q) = q k 1 C k 1 (q)c n k (q). k=1 ( 2n n ) q.
11 Symmetric Functions A symmetric function is a polynomial f(x 1,x 2,...,x n ) which satisfies f(x π1,...,x π n)=f(x 1,...,x n ), i.e. πf = f, for all π S n. Examples The monomial symmetric functions m λ (X) m (2,1) (x 1,x 2,x 3 )=x 2 1x 2 +x 2 1x 3 + x 2 2x 1 + x 2 2x 3 + x 2 3x 1 + x 2 3x 2. The elementary symmetric functions e k (X) e 2 (x 1,x 2,x 3 )=x 1 x 2 +x 1 x 3 +x 2 x 3. The power-sums p k (X) = i xk i.
12 The Schur functions s λ (X), which are important in the representation theory of the symmetric group: s λ (X) = β n K λ,β m β (X) where K λ,β equals the number of ways of filling the Ferrers shape of λ with elements of the multiset {1 β 12 β 2 }, weakly increasing across rows and strictly increasing down columns. For example K (4,2),(2,2,1,1) =
13 Selberg s Integral For k, a, b C, (x i x j ) 2k = n i=1 (0,1) n n i=1 1 i<j n x a 1 i (1 x i ) b 1 dx 1 dx n Γ(a +(i 1)k)Γ(b +(i 1)k) Γ(a + b +(n + i 2)k) Γ(ik +1) Γ(k +1).
14 Macdonald s Generalization: There exist symmetric functions P λ (X; q, t) such that 1 P λ (X; q, t) n! (0,1) n k 1 (x i q r x j )(x i q r x j ) 1 i<j n n i=1 = q F n r=0 x a 1 i (x i ; q) b 1 d q x 1 d q x n i=1 1 i<j n Γ q (λ i + a +(i 1)k) Γ q (λ i + a + b +(n + i 2)k) Γ q (b +(i 1)k) Γ q (λ i λ j +(j i +1)k) Γ q (λ i λ j +(j i)k)
15 where k N, F = kη(λ) +kan(n 1)/2+k 2 n(n 1)(n 2)/3, t = q k, Γ q (z) =(1 q) 1 z (q; q) /(q z ; q) is the q-gamma function with (x; q) = i 0(1 xq i ), and 1 0 f(x)d q x = i=0 is the q-integral. f(q i )(q i q i+1 )
16 Plethysm: If F (X) is a symmetric function, then F [(1 t)x] is defined by expressing F (X) as a polynomial in the p k (X) = i xk i s and then replacing each p k (X) by (1 t k )p k (X). Macdonald expanded scalar multiples of his P λ (q, t) in terms of the basis s λ [(1 t)x] and called the coefficients K λ,µ (q, t). He conjectured these coefficients were in N [q, t]. He proved K λ,µ (1, 1) = K λ,1 n and asked if K λ,µ (q, t) = q a(µ,t ) t b(µ,t ) T for some statistics a, b on partitions µ and standard tableaux T.
17 (0,0) (0,1) µ (1,0) (1,1) (2,0) (µ) = 1 y 1 x 1 x 1 y 1 x y 2 x 2 x 2 y 2 x y 3 x 3 x 3 y 3 x y 4 x 4 x 4 y 4 x y 5 x 5 x 5 y 5 x 2 5
18 For µ n let V (µ) denotethe linear span over Q of all partial derivatives of all orders of (µ).
19 π( a basis element ) = linear combo. of basis elements. π( a basis ) = matrix M(π). M(π) M(β) =M(π β). The character χ is the trace of M(π), which is independent of the basis. Furthermore a basis for which
20 Μ = ****** ****** ****** 0 ****** ****** **** 0 **** **** **** 0 0 0
21 V (µ) decomposes as a direct sum of its bihomogeneous subspaces V i,j (µ) of degree i in the x-variables and j in the y-variables. There is an S n -action on V i,j (µ) givenby πf = f(x π1,...,x π n,y π1,...,y π n) called the diagonal action. The Frobenius Series is the symmetric function s λ (X) q i t j m ij, λ n i,j 0 where m ij is the multiplicity of the irreducible S n -character χ λ in the diagonal action on V i,j (µ).
22 Conjecture. (Garsia, Haiman; PNAS 1993) The Frobenius Series of V (µ) is given by the modified Macdonald polynomial H µ (X; q, t) = λ n t η(µ) K λ,µ (q, 1/t)s λ (X), where η(µ) = i (i 1)λ i. Garsia and Haiman also pioneered the study of the space of diagonal harmonics R n, which is n {f : x h i yi k f =0, h+k >0}. i=1 This is known to be isomorphic to the quotient ring Q [x 1,...,x n,y 1,...,y n ]/I,
23 where I is the ideal generated by the set of all polarized power sums n i=1 xh i yk i, h+k >0. The V (µ) are S n -submodules of R n. Conjecture. (Haiman) The dimension of the space of diagonal harmonics, as a vector space over Q,is(n +1) n 1. The space R n decomposes as a direct sum of subspaces of bihomogeneous degree (i, j); R n = i,j Ri,j The Hilbert Series is the sum i,j 0 q i t j dim(r i,j n ). Example: If n = 2, a basis for n.
24 the space is 1,x 2 x 1,y 2 y 1,and the Hilbert Series is 1 + q + t. The Frobenius Series is the sum s λ (X) q i t j m i,j λ n i,j 0 where m i,j is the multiplicity of χ λ in the character of Rn i,j under the diagonal action of S n.for n = 2 this is s 2 (X)+s 1 2(X)(q + t). Let be a linear operator on the basis H µ (X; q, t) givenby H µ (X; q, t) =t η(µ) q η(µ ) Hµ (X; q, t).
25 Conjecture. (Garsia, Haiman) The Frobenius Series of R n is given by e n (X). A polynomial f is alternating if πf =( 1) invπ f for all π S n. A special case of the above conjecture is that the coefficient of S 1 n(x) in e n (X), corresponding to the sign character χ 1n,is the Hilbert Series of the subspace R ɛ n of alternates. When q, t 1 in e n (X) they showed this coefficient equals the nth Catalan number, which would then equal dim(r ɛ n). By results of Macdonald, this coefficient has an expression as a rational function in q, t.
26 Definition. (q, t-catalan ) Let C n (q, t) =(1 q)(1 t) µ n t 2η(µ) q 2η(µ ) (1 q a t l ) q a t l (qa t l+1 )(t l q a+1 ), where the products are over the squares of µ, and the arm a, coarm a,legl, and coleg l ofasquare are as below.
27 l a a l
28 Conjecture. (Garsia, Haiman; 1992) C n (q, t) is a polynomial in q and t with nonnegative coefficients. For n = 2 the terms in C 2 (q, t) are: µ =2; µ =1 2 ; So q 2 (1 t)(1 q)(1 q)(1 + q) (1 q 2 )(q t)(1 q)(1 t) t 2 (1 t)(1 q)(1 t)(1 + t) (1 t 2 )(t q)(1 t)(1 q) C 2 (q, t) = t2 t q + q2 q t = t2 q 2 t q = t+q.
29 After simplification the terms in C 3 (q, t) are µ =3; q 6 q 2 t) µ = 21; µ =1 3 ; t 2 q 2 (1 + q + t) (q t 2 )(t q 2 ) t 6 (t 2 q)(t q) So C 3 (q, t) = q 6 (t 2 q)+t 2 q 2 (1 + q + t)(q t)+t 6 (t q 2 ) (q 2 t)(t 2 q)(q t) = q 3 + q 2 t + qt 2 + qt + t 3.
30 Theorem. (Garsia, Haiman) q (n 2) Cn (q, 1/q) = 1 (n +1) q ( 2n n ) q. Theorem. (Garsia, Haiman) C n (q, 1) = q area(σ). σ Dn Problem: Is there a pair of statistics (qstat, tstat) on Catalan paths such that C n (q, t) = q qstat(σ) t tstat(σ)? σ Dn
31 Theorem. (Haiman; JAMS 2001) If µ n, the Frobenius Series of V (µ) is the modified Macdonald polynomial Hµ (X; q, t). Pf: Algebraic Geometry and Commutative Algebra. Corollaries. For all λ, µ n, K λ,µ (q, t) N [q, t] and dim(v (µ)) = n!. So far no pair of statistics for the K λ,µ (q, t) have been proposed. Theorem. (Garsia, H.; PNAS 2001) C n (q, t) N [q, t]. Pf: Intricate application of plethystic identities involving after an empirical discovery of a recurrence.
32 7 4 2 The circles form the bounce path. The bounce statistic is 2+4+7=13.
33 Definition. F n (q, t) = q area(σ) t bounce(σ). σ Dn Conjecture. (H.; To appear in Adv. in Math.) For all n N, F n (q, t) =C n (q, t). (Verified in Maple for n 14).
34 Definition. Say σ ends in end(σ) E steps. For n, s N,set F n,s (q, t) = q area(σ) t bounce(σ). σ Dn end(σ)=s Theorem. F n,s (q, t) = F n s,r (q, t) n s r=0 q (s 2) t n s ( r + s 1 r ) q. Corollary. q (n 2) Fn (q, q 1 )= 1 (n +1) q ( 2n n ) q.
35 Theorem. (Garsia, H.; PNAS 2001) For all n, s N, t n s q (s 2) en s [X 1 qs 1 q ] s 1 n s (X) Corollary. Corollary. = F n,s (q, t). C n (q, t) =F n (q, t). F n,s =(1 q s ) µ n t η(µ) q η(µ ) (1 q a t l )h s [(1 t) q a t l ] (qa t l+1 )(t l q a+1 ) Corollary. F n (q, t) =F n (t, q)..
36 Haiman discovered another pair of statistics for the q, t-catalan. Conjecture. (Haiman) C n (q, t) = q area(σ) t dinv(σ). σ Dn Proposition. q area(σ) t dinv(σ) = σ Dn σ Dn q bounce(σ) t area(σ). Corollary. Haiman s conjecture above is true.
37 t 14 q 13 The statistic dinv is the # of pairs (i, j),i<j with the lengths r i and r j of rows i, j satisfying r j r i {0, 1}.
38 Corollary. F n (q, 1) = F n (1,q). Open Question. Find a bijective proof that F n (q, t) =F n (t, q). Theorem. (Haiman; Invent. Math. 2002) e n (X) is the Frobenius Series of R n. Corollary. The (q, t)-catalan C n (q, t) is the Hilbert Series of the space of alternates R ɛ n. Corollary. dim(r n )=(n+1) n 1. The number (n+1) n 1 is the number of rooted, labeled trees on n+ 1 vertices, with root node labeled 0, and also the number of parking functions on n cars.
39 t 6 q 13 dinv = #(i, j),i < j : r i = r j and car i >car j or r i = r j 1 and car i <car j.
40 Conjecture. (H., Loehr) The Hilbert Series of R n is given by W n (q, t) = q area(σ) t dinv(σ), σ where the sum is over all parking functions on n cars. Using Maple, we have verified our conjecture for n 7. We can t prove, by any method, that W n (q, t) = W n (t, q), nor can we prove that q (n 2) Wn (q, 1/q) =(1+q+...+q n ) n 1, which is the value for the Hilbert Series at t =1/q conjectured by Stanley and now proven by Haiman. Loehr has a proof that W n (q, 1) = W n (1,q).
41 Garsia and Haiman define C m n (q, t) = m e n (X) s1 n (X), m N. Note Cn(q, 1 t) =C n (q, t). These are connected to lattice paths from (0, 0) to (nm, n) which never go below the diagonal, and also have an algebraic description. Conjecture. (Haiman, Loehr) q area(σ) t m-dinv(σ) = Cn m (q, t) σ D m n = q area(σ) t m-bounce(σ). σ D m n Loehr obtains recurrences involving the parameter m which extend the recurrence for F n,s (q, t).
42 Lapointe, Lascoux and Morse have introduced a generalization of Schur functions they call Atoms, which depend on X, t, a positive integer k, and a partition λ satisfying λ 1 k. The coefficients in the expansion of the Atoms in terms of Schur functions are in N [t], and they conjecture that if µ 1 k, the coefficients in the expansion of the H µ (X; q, t) in terms of the Atoms are in N [q, t]. This conjecture thus implies K λ,µ (q, t) N [q, t]. Hear more about this in the special session on Algebraic and Enumerative Combinatorics.
43 The bounce path for the case m = 2. Go up distance a 1 to the path, then over a 1, then up distance a 2,thenovera 1 + a 2,then up a 3,thenovera 2 + a 3, etc.
44 Start with the path above. Form the bounce path (circles, next page) whose top step is the # of rows length zero, etc. Then start at corner of top step, and look at subword of 0 s and 1 s on previ-
45 (area, dinv) (bounce, area) ous page, starting at bottom. For each 0 go down, for each 1 go left. Then iterate with subword of 1 s and 2 s.
An injection from standard fillings to parking functions
FPSAC 202, Nagoya, Japan DMTCS proc. AR, 202, 703 74 An injection from standard fillings to parking functions Elizabeth Niese Department of Mathematics, Marshall University, Huntington, WV 25755 Abstract.
More informationA Schröder Generalization of Haglund s Statistic on Catalan Paths
A Schröder Generalization of Haglund s Statistic on Catalan Paths Eric S Egge Department of Mathematics Gettysburg College, Gettysburg, PA 17325 eggee@memberamsorg James Haglund Department of Mathematics
More informationA combinatorial approach to the q, t-symmetry relation in Macdonald polynomials
A combinatorial approach to the q, t-symmetry relation in Macdonald polynomials Maria Monks Gillespie Department of Mathematics University of California, Berkeley Berkeley, CA, U.S.A. monks@math.berkeley.edu
More informationA proof of the Square Paths Conjecture
A proof of the Square Paths Conjecture Emily Sergel Leven arxiv:60.069v [math.co] Mar 06 March, 06 Abstract The modified Macdonald polynomials, introduced by Garsia and Haiman (996), have many astounding
More informationA proof of the Square Paths Conjecture
A proof of the Square Paths Conjecture Emily Sergel Leven October 7, 08 arxiv:60.069v [math.co] Jan 06 Abstract The modified Macdonald polynomials, introduced by Garsia and Haiman (996), have many astounding
More informationA New Recursion in the Theory of Macdonald Polynomials
A. Garsia and J. Haglund A new recursion in the Theory of Macdonald Polynomials September 3, 2009 1 A New Recursion in the Theory of Macdonald Polynomials by A. M. Garsia and J. Haglund Abstract. The bigraded
More informationA Proof of the q, t-square Conjecture
Formal Power Series and Algebraic Combinatorics Séries Formelles et Combinatoire Algébrique San Diego, California 2006 A Proof of the q, t-square Conjecture Mahir Can and Nicholas Loehr Abstract. We prove
More informationarxiv:math/ v1 [math.co] 27 Nov 2006
arxiv:math/0611822v1 [math.co] 27 Nov 2006 AN EXTENSION OF THE FOATA MAP TO STANDARD YOUNG TABLEAUX J. HAGLUND,1 AND L. STEVENS Department of Mathematics, University of Pennsylvania, Philadelphia, PA 19104-6395,
More informationOutline 1. Background on Symmetric Polynomials 2. Algebraic definition of (modified) Macdonald polynomials 3. New combinatorial definition of Macdonal
Algebraic and Combinatorial Macdonald Polynomials Nick Loehr AIM Workshop on Generalized Kostka Polynomials July 2005 Reference: A Combinatorial Formula for Macdonald Polynomials" by Haglund, Haiman, and
More informationA combinatorial approach to the q, t-symmetry in Macdonald polynomials. Maria Monks Gillespie. A dissertation submitted in partial satisfaction of the
A combinatorial approach to the q, t-symmetry in Macdonald polynomials by Maria Monks Gillespie A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy
More informationJOSEPH ALFANO* Department of Mathematics, Assumption s y i P (x; y) = 0 for all r; s 0 (with r + s > 0). Computer explorations by
A BASIS FOR THE Y SUBSPACE OF DIAGONAL HARMONIC POLYNOMIALS JOSEPH ALFANO* Department of Mathematics, Assumption College 500 Salisbury Street, Worcester, Massachusetts 065-0005 ABSTRACT. The space DH n
More informationCOMBINATORIAL FORMULAS CONNECTED TO DIAGONAL HARMONICS AND MACDONALD POLYNOMIALS. Meesue Yoo. A Dissertation. Mathematics
COMBINATORIAL FORMULAS CONNECTED TO DIAGONAL HARMONICS AND MACDONALD POLYNOMIALS Meesue Yoo A Dissertation in Mathematics Presented to the Faculties of the University of Pennsylvania in Partial Fulfillment
More informationMATHEMAGICAL FORMULAS FOR SYMMETRIC FUNCTIONS. Contents
MATHEMAGICAL FORMULAS FOR SYMMETRIC FUNCTIONS Contents The Bibliography. Basic Notations. Classical Basis of Λ. Generating Functions and Identities 4 4. Frobenius transform and Hilbert series 4 5. Plethysm
More informationRational Catalan Combinatorics
Rational Catalan Combinatorics Eugene Gorsky UC Davis Bay Area Discrete Math Day October 17, 2015 Counting Dyck paths Catalan numbers The Catalan number is the number of Dyck paths, that is, lattice paths
More informationTorus Knots and q, t-catalan Numbers
Torus Knots and q, t-catalan Numbers Eugene Gorsky Stony Brook University Simons Center For Geometry and Physics April 11, 2012 Outline q, t-catalan numbers Compactified Jacobians Arc spaces on singular
More informationPlethystic Formulas 2 and h (q; t) (? q a(s) t l(s)+ ) ; h (q; t)? q s2 s2( a(s)+ t l(s) ) : I: Macdonald sets J (x; q; t) h (q; t) P (x; q; t) h (q;
Plethystic Formulas Plethystic Formulas for Macdonald q; t-kostka Coecients A. M. Garsia y and G. Tesler yy ABSTRACT. This work is concerned with the Macdonald q; t-analogue of the Kostka matrix. This
More informationA minimaj-preserving crystal structure on ordered multiset partitions
Séminaire Lotharingien de Combinatoire 80B (018) Article #1, 1 pp. Proceedings of the 30 th Conference on Formal Power Series and Algebraic Combinatorics (Hanover) A minimaj-preserving crystal structure
More informationOperators on k-tableaux and the k-littlewood Richardson rule for a special case. Sarah Elizabeth Iveson
Operators on k-tableaux and the k-littlewood Richardson rule for a special case by Sarah Elizabeth Iveson A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of
More informationMacdonald polynomials and Hilbert schemes. Mark Haiman U.C. Berkeley LECTURE
Macdonald polynomials and Hilbert schemes Mark Haiman U.C. Berkeley LECTURE I Introduction to Hall-Littlewood and Macdonald polynomials, and the n! and (n + 1) (n 1) theorems 1 Hall-Littlewood polynomials
More informationarxiv: v1 [math.rt] 5 Aug 2016
AN ALGEBRAIC FORMULA FOR THE KOSTKA-FOULKES POLYNOMIALS arxiv:1608.01775v1 [math.rt] 5 Aug 2016 TIMOTHEE W. BRYAN, NAIHUAN JING Abstract. An algebraic formula for the Kostka-Foukles polynomials is given
More informationFROM PARKING FUNCTIONS TO GELFAND PAIRS
FROM PARKING FUNCTIONS TO GELFAND PAIRS KÜRŞAT AKER, MAHİR BİLEN CAN Abstract. A pair (G, K) of a group and its subgroup is called a Gelfand pair if the induced trivial representation of K on G is multiplicity
More informationRational Catalan Combinatorics: Intro
Rational Catalan Combinatorics: Intro Vic Reiner Univ. of Minnesota reiner@math.umn.edu AIM workshop Dec. 17-21, 2012 Goals of the workshop 1 Reinforce existing connections and forge new connections between
More informationA DECOMPOSITION OF SCHUR FUNCTIONS AND AN ANALOGUE OF THE ROBINSON-SCHENSTED-KNUTH ALGORITHM
A DECOMPOSITION OF SCHUR FUNCTIONS AND AN ANALOGUE OF THE ROBINSON-SCHENSTED-KNUTH ALGORITHM S. MASON Abstract. We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline
More informationAdjoint Representations of the Symmetric Group
Adjoint Representations of the Symmetric Group Mahir Bilen Can 1 and Miles Jones 2 1 mahirbilencan@gmail.com 2 mej016@ucsd.edu Abstract We study the restriction to the symmetric group, S n of the adjoint
More informationCatalan functions and k-schur positivity
Catalan functions and k-schur positivity Jonah Blasiak Drexel University joint work with Jennifer Morse, Anna Pun, and Dan Summers November 2018 Theorem (Haiman) Macdonald positivity conjecture The modified
More informationBoolean Product Polynomials and the Resonance Arrangement
Boolean Product Polynomials and the Resonance Arrangement Sara Billey University of Washington Based on joint work with: Lou Billera and Vasu Tewari FPSAC July 17, 2018 Outline Symmetric Polynomials Schur
More informationResults and conjectures on the number of standard strong marked tableaux
FPSAC 013, Paris, France DMTCS proc. (subm.), by the authors, 1 1 Results and conjectures on the number of standard strong marked tableaux Susanna Fishel 1 and Matjaž Konvalinka 1 School of Mathematical
More informationA Schröder Generalization of Haglund s Statistic on Catalan Paths
A Schröder Generalization of Haglund s Statistic on Catalan Paths E. S. Egge Department of Mathematics Gettysburg College, Gettysburg, PA 7325 eggee@member.ams.org J. Haglund Department of Mathematics
More informationON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS
ON SOME FACTORIZATION FORMULAS OF K-k-SCHUR FUNCTIONS MOTOKI TAKIGIKU Abstract. We give some new formulas about factorizations of K-k-Schur functions, analogous to the k-rectangle factorization formula
More informationSCIENCE FICTION. Text Text Text Text Text Text Text Text Text Text Text
SCIENCE FICTION 208 PRELIMINARIES Let X n = {x,...,x n } and Y n = {y,...,y n }. we define the scalar product For hp,qi = P (@ x ; @ y )Q(x; y) For P (x; y),q(x; y) 2 Q[X n ; Y n ] x,y=0 2 S n, and P (x;
More informationHyperplane Arrangements & Diagonal Harmonics
Hyperplane Arrangements & Diagonal Harmonics Drew Armstrong arxiv:1005.1949 Coinvariants Coinvariants Theorems (Newton-Chevalley-etc): Let S n act on S = C[x 1,..., x n ] by permuting variables. Coinvariants
More informationCopyright Nicholas Anthony Loehr, 2003 All rights reserved.
UNIVERSITY OF CALIFORNIA, SAN DIEGO Multivariate Analogues of Catalan Numbers, Parking Functions, and their Extensions A dissertation submitted in partial satisfaction of the reuirements for the degree
More informationPARKING FUNCTIONS. Richard P. Stanley Department of Mathematics M.I.T Cambridge, MA
PARKING FUNCTIONS Richard P. Stanley Department of Mathematics M.I.T. -75 Cambridge, MA 09 rstan@math.mit.edu http://www-math.mit.edu/~rstan Transparencies available at: http://www-math.mit.edu/~rstan/trans.html
More informationENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP. Igor Pak Harvard University
ENUMERATION OF TREES AND ONE AMAZING REPRESENTATION OF THE SYMMETRIC GROUP Igor Pak Harvard University E-mail: pak@math.harvard.edu Alexander Postnikov Massachusetts Institute of Technology E-mail: apost@math.mit.edu
More informationNotes on Creation Operators
Notes on Creation Operators Mike Zabrocki August 4, 2005 This set of notes will cover sort of a how to about creation operators. Because there were several references in later talks, the appendix will
More informationLARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS
Bull. Korean Math. Soc. 51 (2014), No. 4, pp. 1229 1240 http://dx.doi.org/10.4134/bkms.2014.51.4.1229 LARGE SCHRÖDER PATHS BY TYPES AND SYMMETRIC FUNCTIONS Su Hyung An, Sen-Peng Eu, and Sangwook Kim Abstract.
More informationA Survey of Parking Functions
A Survey of Parking Functions Richard P. Stanley M.I.T. Parking functions... n 2 1... a a a 1 2 n Car C i prefers space a i. If a i is occupied, then C i takes the next available space. We call (a 1,...,a
More informationA new proof of a theorem of Littlewood
A new proof of a theorem of Littlewood Jason Bandlow Department of Mathematics University of California, Davis Davis, California, USA jbandlow@math.ucdavis.edu Michele D Adderio Department of Mathematics
More informationA Plethysm Formula for p µ (x) h λ (x) William F. Doran IV
A Plethysm Formula for p µ (x) h λ (x) William F. Doran IV Department of Mathematics California Institute of Technology Pasadena, CA 925 doran@cco.caltech.edu Submitted: September 0, 996; Accepted: May
More informationYOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP
YOUNG TABLEAUX AND THE REPRESENTATIONS OF THE SYMMETRIC GROUP YUFEI ZHAO ABSTRACT We explore an intimate connection between Young tableaux and representations of the symmetric group We describe the construction
More informationTesler Matrices. Drew Armstrong. Bruce Saganfest Gainesville, March University of Miami armstrong
Tesler Matrices Drew Armstrong University of Miami www.math.miami.edu/ armstrong Bruce Saganfest Gainesville, March 2014 Plan 1. Tesler Matrices (with A. Garsia, J. Haglund, B. Rhoades and B. Sagan) 2.
More informationA Murnaghan-Nakayama Rule for k-schur Functions
A Murnaghan-Nakayama Rule for k-schur Functions Anne Schilling (joint work with Jason Bandlow, Mike Zabrocki) University of California, Davis October 31, 2012 Outline History The Murnaghan-Nakayama rule
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationThe Catalan matroid.
The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,
More informationREPRESENTATION THEORY OF THE SYMMETRIC GROUP (FOLLOWING [Ful97])
REPRESENTATION THEORY OF THE SYMMETRIC GROUP (FOLLOWING [Ful97]) MICHAEL WALTER. Diagrams and Tableaux Diagrams and Tableaux. A (Young) diagram λ is a partition of a natural number n 0, which we often
More informationPOLYNOMIAL BEHAVIOUR OF KOSTKA NUMBERS
POLYNOMIAL BEHAVIOUR OF KOSTKA NUMBERS DINUSHI MUNASINGHE Abstract. Given two standard partitions λ + = (λ + 1 λ+ s ) and λ = (λ 1 λ r ) we write λ = (λ +, λ ) and set s λ (x 1,..., x t ) := s λt (x 1,...,
More informationStatistical Mechanics & Enumerative Geometry:
Statistical Mechanics & Enumerative Geometry: Christian Korff (ckorff@mathsglaacuk) University Research Fellow of the Royal Society Department of Mathematics, University of Glasgow joint work with C Stroppel
More informationLittlewood Richardson polynomials
Littlewood Richardson polynomials Alexander Molev University of Sydney A diagram (or partition) is a sequence λ = (λ 1,..., λ n ) of integers λ i such that λ 1 λ n 0, depicted as an array of unit boxes.
More informationStandard Young Tableaux Old and New
Standard Young Tableaux Old and New Ron Adin and Yuval Roichman Department of Mathematics Bar-Ilan University Workshop on Group Theory in Memory of David Chillag Technion, Haifa, Oct. 14 1 2 4 3 5 7 6
More informationThe (m, n)-rational q, t-catalan polynomials for m = 3 and their q, t-symmetry
The (m, n)-rational q, t-catalan polynomials for m = 3 and their q, t-symmetry Ryan Kaliszewski, Huilan Li To cite this version: Ryan Kaliszewski, Huilan Li. The (m, n)-rational q, t-catalan polynomials
More informationA Proof of the q,t-catalan Positivity Conjecture
The q,t-catalan September 26, 2000 1 A Proof of the q,t-catalan Positivity Conjecture by A. M. Garsia and J. Haglund Abstract. We present here a proof that a certain rational function C n q, t) which has
More informationTopological Matter, Strings, K-theory and related areas September 2016
Topological Matter, Strings, K-theory and related areas 26 30 September 2016 This talk is based on joint work with from Caltech. Outline 1. A string theorist s view of 2. Mixed Hodge polynomials associated
More informationOn some combinatorial aspects of Representation Theory
On some combinatorial aspects of Representation Theory Doctoral Defense Waldeck Schützer schutzer@math.rutgers.edu Rutgers University March 24, 2004 Representation Theory and Combinatorics p.1/46 Overview
More informationChromatic bases for symmetric functions
Chromatic bases for symmetric functions Soojin Cho Department of Mathematics Ajou University Suwon 443-749, Korea chosj@ajou.ac.kr Stephanie van Willigenburg Department of Mathematics University of British
More informationClassical Lie algebras and Yangians
Classical Lie algebras and Yangians Alexander Molev University of Sydney Advanced Summer School Integrable Systems and Quantum Symmetries Prague 2007 Lecture 1. Casimir elements for classical Lie algebras
More informationWeek 9-10: Recurrence Relations and Generating Functions
Week 9-10: Recurrence Relations and Generating Functions April 3, 2017 1 Some number sequences An infinite sequence (or just a sequence for short is an ordered array a 0, a 1, a 2,..., a n,... of countably
More informationarxiv: v2 [math.co] 21 Apr 2015
RANK COMPLEMENT OF RATIONAL DYCK PATHS AND CONJUGATION OF (m, n)-core PARTITIONS GUOCE XIN arxiv:1504.02075v2 [math.co] 21 Apr 2015 Abstract. ( Given a coprime pair (m, n) of positive integers, rational
More informationAppendix to: Generalized Stability of Kronecker Coefficients. John R. Stembridge. 14 August 2014
Appendix to: Generalized Stability of Kronecker Coefficients John R. Stembridge 14 August 2014 Contents A. Line reduction B. Complementation C. On rectangles D. Kronecker coefficients and Gaussian coefficients
More informationDescents in Parking Functions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 21 (2018), Article 18.2.3 Descents in Parking Functions Paul R. F. Schumacher 1512 Oakview Street Bryan, TX 77802 USA Paul.R.F.Schumacher@gmail.com Abstract
More informationA representation on the labeled rooted forests
A representation on the labeled rooted forests Mahir Bilen Can August 14, 2017 Abstract We consider the conjugation action of symmetric group on the semigroup of all partial functions and develop a machinery
More informationarxiv: v1 [math.co] 26 Oct 2016
FLOW POLYTOPES AND THE SPACE OF DIAGONAL HARMONICS RICKY INI LIU, KAROLA MÉSZÁROS, AND ALEJANDRO H. MORALES arxiv:60.08370v [math.co] 26 Oct 206 Abstract. A result of Haglund implies that the (q, t)-bigraded
More informationA Recursion and a Combinatorial Formula for Jack Polynomials
A Recursion and a Combinatorial Formula for Jack Polynomials Friedrich Knop & Siddhartha Sahi* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA 1. Introduction The Jack polynomials
More informationREPRESENTATION THEORY OF S n
REPRESENTATION THEORY OF S n EVAN JENKINS Abstract. These are notes from three lectures given in MATH 26700, Introduction to Representation Theory of Finite Groups, at the University of Chicago in November
More informationCombinatorics for algebraic geometers
Combinatorics for algebraic geometers Calculations in enumerative geometry Maria Monks March 17, 214 Motivation Enumerative geometry In the late 18 s, Hermann Schubert investigated problems in what is
More informationIn honor of Manfred Schocker ( ). The authors would also like to acknowledge the contributions that he made to this paper.
ON THE S n -MODULE STRUCTURE OF THE NONCOMMUTATIVE HARMONICS. EMMANUEL BRIAND, MERCEDES ROSAS, MIKE ZABROCKI Abstract. Using the a noncommutative version of Chevalley s theorem due to Bergeron, Reutenauer,
More informationOn Tensor Products of Polynomial Representations
Canad. Math. Bull. Vol. 5 (4), 2008 pp. 584 592 On Tensor Products of Polynomial Representations Kevin Purbhoo and Stephanie van Willigenburg Abstract. We determine the necessary and sufficient combinatorial
More informationSome Catalan Musings p. 1. Some Catalan Musings. Richard P. Stanley
Some Catalan Musings p. 1 Some Catalan Musings Richard P. Stanley Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,... Some Catalan Musings p. 2 An OEIS entry A000108: 1,1,2,5,14,42,132,429,...
More informationKRONECKER COEFFICIENTS AND NONCOMMUTATIVE SUPER SCHUR FUNCTIONS. 1. Introduction
KRONECKER COEFFICIENTS AND NONCOMMUTATIVE SUPER SCHUR FUNCTIONS JONAH BLASIAK AND RICKY INI LIU Abstract. The theory of noncommutative Schur functions can be used to obtain positive combinatorial formulae
More informationD-FINITE SYMMETRIC FUNCTIONS.
D-FINITE SYMMETRIC FUNCTIONS. by Mariolys Rivas B.Sc.H., Central University of Venezuela, 2006 a Thesis submitted in partial fulfillment of the requirements for the degree of Master of Science in the School
More informationLecture 6 : Kronecker Product of Schur Functions Part I
CS38600-1 Complexity Theory A Spring 2003 Lecture 6 : Kronecker Product of Schur Functions Part I Lecturer & Scribe: Murali Krishnan Ganapathy Abstract The irreducible representations of S n, i.e. the
More informationA RELATION BETWEEN SCHUR P AND S. S. Leidwanger. Universite de Caen, CAEN. cedex FRANCE. March 24, 1997
A RELATION BETWEEN SCHUR P AND S FUNCTIONS S. Leidwanger Departement de Mathematiques, Universite de Caen, 0 CAEN cedex FRANCE March, 997 Abstract We dene a dierential operator of innite order which sends
More informationRCC. Drew Armstrong. FPSAC 2017, Queen Mary, London. University of Miami armstrong
RCC Drew Armstrong University of Miami www.math.miami.edu/ armstrong FPSAC 2017, Queen Mary, London Outline of the Talk 1. The Frobenius Coin Problem 2. Rational Dyck Paths 3. Core Partitions 4. The Double
More informationCOMBINATORICS, SYMMETRIC FUNCTIONS, AND HILBERT SCHEMES
COMBINATORICS, SYMMETRIC FUNCTIONS, AND HILBERT SCHEMES MARK HAIMAN Abstract. We survey the proof of a series of conjectures in combinatorics using new results on the geometry of Hilbert schemes. The combinatorial
More informationCombinatorial bases for representations. of the Lie superalgebra gl m n
Combinatorial bases for representations of the Lie superalgebra gl m n Alexander Molev University of Sydney Gelfand Tsetlin bases for gln Gelfand Tsetlin bases for gl n Finite-dimensional irreducible representations
More informationGENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX. Jaejin Lee
Korean J. Math. 8 (00), No., pp. 89 98 GENERALIZATION OF THE SIGN REVERSING INVOLUTION ON THE SPECIAL RIM HOOK TABLEAUX Jaejin Lee Abstract. Eğecioğlu and Remmel [] gave a combinatorial interpretation
More informationCoxeter-Knuth Classes and a Signed Little Bijection
Coxeter-Knuth Classes and a Signed Little Bijection Sara Billey University of Washington Based on joint work with: Zachary Hamaker, Austin Roberts, and Benjamin Young. UC Berkeley, February, 04 Outline
More informationCharacter Polynomials
Character Polynomials Problem From Stanley s Positivity Problems in Algebraic Combinatorics Problem : Give a combinatorial interpretation of the row sums of the character table for S n (combinatorial proof
More informationh r t r 1 (1 x i=1 (1 + x i t). e r t r = i=1 ( 1) i e i h r i = 0 r 1.
. Four definitions of Schur functions.. Lecture : Jacobi s definition (ca 850). Fix λ = (λ λ n and X = {x,...,x n }. () a α = det ( ) x α i j for α = (α,...,α n ) N n (2) Jacobi s def: s λ = a λ+δ /a δ
More informationWreath Product Symmetric Functions
International Journal of Algebra, Vol. 3, 2009, no. 1, 1-19 Wreath Product Symmetric Functions Frank Ingram Mathematics Department, Winston-Salem State University Winston-Salem, NC 27110, USA ingramfr@wssu.edu
More information(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions
(Permutations Arising from) Hook Coefficients of Chromatic Symmetric Functions Ryan Kaliszewski Drexel University rlk72@drexel.edu July 17, 2014 Ryan Kaliszewski (Drexel University) Hook Coefficients July
More informationCombinatorics of the Cell Decomposition of Affine Springer Fibers
Combinatorics of the Cell Decomposition of Affine Springer Fibers Michael Lugo Virginia Tech Under the Advising of Mark Shimozono 28 April 2015 Contents 1 Affine Springer Fiber 2 Affine Symmetric Group
More informationarxiv: v2 [math.co] 21 Mar 2017
ON THE POSET AND ASYMPTOTICS OF TESLER MATRICES JASON O NEILL arxiv:70.00866v [math.co] Mar 07 Abstract. Tesler matrices are certain integral matrices counted by the Kostant partition function and have
More informationq-alg/ Mar 96
Integrality of Two Variable Kostka Functions Friedrich Knop* Department of Mathematics, Rutgers University, New Brunswick NJ 08903, USA knop@math.rutgers.edu 1. Introduction q-alg/9603027 29 Mar 96 Macdonald
More informationPermutation Statistics and q-fibonacci Numbers
Permutation Statistics and q-fibonacci Numbers Adam M Goyt and David Mathisen Mathematics Department Minnesota State University Moorhead Moorhead, MN 56562 Submitted: April 2, 2009; Accepted: August 2,
More informationMultiplicity Free Expansions of Schur P-Functions
Annals of Combinatorics 11 (2007) 69-77 0218-0006/07/010069-9 DOI 10.1007/s00026-007-0306-1 c Birkhäuser Verlag, Basel, 2007 Annals of Combinatorics Multiplicity Free Expansions of Schur P-Functions Kristin
More informationKRONECKER POWERS CHARACTER POLYNOMIALS. A. Goupil, with C. Chauve and A. Garsia,
KRONECKER POWERS AND CHARACTER POLYNOMIALS A. Goupil, with C. Chauve and A. Garsia, Menu Introduction : Kronecker products Tensor powers Character Polynomials Perspective : Duality with product of conjugacy
More informationGeneralized Tesler matrices, virtual Hilbert series, and Macdonald polynomial operators
Generalized Tesler matrices, virtual Hilbert series, and Macdonald polynomial operators Andrew Timothy Wilson To cite this version: Andrew Timothy Wilson. Generalized Tesler matrices, virtual Hilbert series,
More informationCharacter values and decomposition matrices of symmetric groups
Character values and decomposition matrices of symmetric groups Mark Wildon Abstract The relationships between the values taken by ordinary characters of symmetric groups are exploited to prove two theorems
More informationAn Investigation on an Extension of Mullineux Involution
An Investigation on an Extension of Mullineux Involution SPUR Final Paper, Summer 06 Arkadiy Frasinich Mentored by Augustus Lonergan Project Suggested By Roman Bezrukavnikov August 3, 06 Abstract In this
More informationCharacters, Derangements and Descents for the Hyperoctahedral Group
Characters, Derangements and Descents for the Hyperoctahedral Group Christos Athanasiadis joint with Ron Adin, Sergi Elizalde and Yuval Roichman University of Athens July 9, 2015 1 / 42 Outline 1 Motivation
More informationRadon Transforms and the Finite General Linear Groups
Claremont Colleges Scholarship @ Claremont All HMC Faculty Publications and Research HMC Faculty Scholarship 1-1-2004 Radon Transforms and the Finite General Linear Groups Michael E. Orrison Harvey Mudd
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationA Combinatorial Model for the Macdonald Polynomials
A Combinatorial Model for the Macdonald Polynomials J. Haglund Department of Mathematics University of Pennsylvania Philadelphia, PA 19104-6395 jhaglund@math.upenn.edu July 8, 2004 Abstract We introduce
More informationA Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group
A Conjectured Combinatorial Interpretation of the Normalized Irreducible Character Values of the Symmetric Group Richard P. Stanley Department of Mathematics, Massachusetts Institute of Technology Cambridge,
More informationRational Parking Functions
Rational Parking Functions Drew Armstrong et al. University of Miami www.math.miami.edu/ armstrong December 9, 2012 Rational Catalan Numbers CONVENTION Given x Q \ [ 1, 0], there exist unique coprime (a,
More informationHook lengths and shifted parts of partitions
Hook lengths and shifted parts of partitions Guo-Niu Han To cite this version: Guo-Niu Han Hook lengths and shifted parts of partitions The Ramanujan Journal, 009, 9 p HAL Id: hal-00395690
More informationAffine permutations and rational slope parking functions
Affine permutations and rational slope parking functions Eugene Gorsky, Mikhail Mazin, Monica Vazirani To cite this version: Eugene Gorsky, Mikhail Mazin, Monica Vazirani. Affine permutations and rational
More informationNILPOTENT ORBIT VARIETIES AND THE ATOMIC DECOMPOSITION OF THE q-kostka POLYNOMIALS
NILPOTENT ORBIT VARIETIES AND THE ATOMIC DECOMPOSITION OF THE q-kostka POLYNOMIALS WILLIAM BROCKMAN AND MARK HAIMAN Abstract. We study the coordinate rings k[c µ t] of scheme-theoretic intersections of
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics p. 1 Smith Normal Form and Combinatorics Richard P. Stanley Smith Normal Form and Combinatorics p. 2 Smith normal form A: n n matrix over commutative ring R (with 1)
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More information