A Survey of Parking Functions
|
|
- Annabelle Gallagher
- 5 years ago
- Views:
Transcription
1 A Survey of Parking Functions Richard P. Stanley M.I.T.
2 Parking functions... n 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 n ) a parking function (of length n) if all cars can park. n = 2 : n = 3 :
3 Permutations of parking functions Easy: Let α = (a 1,...,a n ) P n. Let b 1 b 2 b n be the increasing rearrangement of α. Then α is a parking function if and only b i i. Corollary. Every permutation of the entries of a parking function is also a parking function.
4 Enumeration of parking functions Theorem (Pyke, 1959; Konheim and Weiss, 1966). Let f(n) be the number of parking functions of length n. Then f(n) = (n + 1) n 1. Proof (Pollak, c. 1974). Add an additional space n + 1, and arrange the spaces in a circle. Allow n + 1 also as a preferred space.
5 1 n+1 a a a n 2 n 3
6 Conclusion of Pollak s proof Now all cars can park, and there will be one empty space. α is a parking function if the empty space is n + 1. If α = (a 1,...,a n ) leads to car C i parking at space p i, then (a 1 +j,...,a n +j) (modulo n + 1) will lead to car C i parking at space p i + j. Hence exactly one of the vectors (a 1 + i,a 2 + i,...,a n + i) (modulo n + 1) is a parking function, so f(n) = (n + 1)n n + 1 = (n + 1)n 1.
7 Forest inversions Let F be a rooted forest on the vertex set {1,...,n} Theorem (Sylvester-Borchardt-Cayley). The number of such forests is (n + 1) n
8 The case n =
9 Forest inversions An inversion in F is a pair (i,j) so that i > j and i lies on the path from j to the root. inv(f) = #(inversions of F )
10 Example of forest inversions
11 Example of forest inversions Inversions: (5, 4), (5, 2), (12, 4), (12, 8) (3, 1), (10, 1), (10, 6), (10, 9) inv(f) = 8
12 The inversion enumerator Let I n (q) = F q inv(f), summed over all forests F with vertex set {1,...,n}. E.g., I 1 (q) = 1 I 2 (q) = 2 + q I 3 (q) = 6 + 6q + 3q 2 + q 3
13 Relation to connected graphs Theorem (Mallows-Riordan 1968, Gessel-Wang 1979) We have I n (1 + q) = G q e(g) n, where G ranges over all connected graphs (without loops or multiple edges) on n + 1 labelled vertices, and where e(g) denotes the number of edges of G.
14 A generating function Corollary. n 0 n 1 I n (q)(q 1) nxn n! = n 0 q(n+1 2 ) x n n! 2) x n 0 n q(n n! I n (q)(q 1) n 1xn n! = log n 0 q (n 2) xn n!
15 Relation to parking functions Theorem (Kreweras, 1980). We have q 2) (n In (1/q) = q a 1+ +a n, (a 1,...,a n ) where (a 1,...,a n ) ranges over all parking functions of length n.
16 Noncrossing partitions A noncrossing partition of {1, 2,...,n} is a partition {B 1,...,B k } of {1,...,n} such that a < b < c < d, a,c B i, b,d B j i = j
17 Enumeration of noncrossing partitio Theorem (H. W. Becker, ). The number of noncrossing partitions of {1,...,n} is the Catalan number C n = 1 n + 1 ( 2n n ).
18 Chains of noncrossing partitions A maximal chain m of noncrossing partitions of {1,...,n + 1} is a sequence π 0, π 1, π 2,..., π n of noncrossing partitions of {1,...,n + 1} such that π i is obtained from π i 1 by merging two blocks into one. (Hence π i has exactly n + 1 i blocks.)
19 Chains of noncrossing partitions A maximal chain m of noncrossing partitions of {1,...,n + 1} is a sequence π 0, π 1, π 2,..., π n of noncrossing partitions of {1,...,n + 1} such that π i is obtained from π i 1 by merging two blocks into one. (Hence π i has exactly n + 1 i blocks.)
20 A chain labeling Define: min B = least element of B j < B : j < k k B. Suppose π i is obtained from π i 1 by merging together blocks B and B, with min B < min B. Define Λ i (m) = max{j B : j < B } Λ(m) = (Λ 1 (m),...,λ n (m)).
21 An example we have Λ(m) = (2, 3, 1, 2).
22 Number of chains Theorem. Λ is a bijection between the maximal chains of noncrossing partitions of {1,...,n + 1} and parking functions of length n.
23 Number of chains Theorem. Λ is a bijection between the maximal chains of noncrossing partitions of {1,...,n + 1} and parking functions of length n. Corollary (Kreweras, 1972). The number of maximal chains of noncrossing partitions of {1,...,n + 1} is (n + 1) n 1.
24 Number of chains Theorem. Λ is a bijection between the maximal chains of noncrossing partitions of {1,...,n + 1} and parking functions of length n. Corollary (Kreweras, 1972). The number of maximal chains of noncrossing partitions of {1,...,n + 1} is (n + 1) n 1. Is there a connection with Voiculescu s theory of free probability?
25 The Shi arrangement: background Braid arrangement B n : the set of hyperplanes in R n. x i x j = 0, 1 i < j n,
26 The Shi arrangement: background Braid arrangement B n : the set of hyperplanes in R n. x i x j = 0, 1 i < j n, R = set of regions of B n #R =??
27 The Shi arrangement: background Braid arrangement B n : the set of hyperplanes in R n. x i x j = 0, 1 i < j n, R = set of regions of B n #R = n!
28 The Shi arrangement: background Braid arrangement B n : the set of hyperplanes in R n. x i x j = 0, 1 i < j n, R = set of regions of B n #R = n! Let R 0 be the base region R 0 : x 1 > x 2 > > x n.
29 Labeling the regions Label R 0 with λ(r 0 ) = (1, 1,..., 1) Z n. If R is labelled, R is separated from R only by x i x j = 0 (i < j), and R is unlabelled, then set λ(r ) = λ(r) + e i, where e i = ith unit coordinate vector.
30 The labeling rule R R λ( ) R λ( R )=λ( R)+e i x i = x i < j j
31 Description of labels x =x 1 2 x =x 1 3 B 3 x =x 2 3
32 Description of labels x =x 1 2 x =x 1 3 B 3 x =x 2 3 Theorem (easy). The labels of B n are the sequences (b 1,...,b n ) Z n such that 1 b i n i + 1.
33 Separating hyperplanes Recall R 0 : x 1 > x 2 > > x n. Let d(r) be the number of hyperplanes in B n separating R 0 from R.
34 The case n = x =x x =x x 2 =x3 1 3 B 3
35 Generating function for d(r) NOTE: If λ(r) = (b 1,...,b n ), then d(r) = (b i 1).
36 Generating function for d(r) NOTE: If λ(r) = (b 1,...,b n ), then d(r) = (b i 1). Easy consequence: Corollary. R R q d(r) = (1 + q)(1 + q + q 2 ) (1 + q + + q n 1 ).
37 The Shi arrangement Shi Jianyi ( )
38 The Shi arrangement Shi Jianyi ( ) Shi arrangement S n : the set of hyperplanes x i x j = 0, 1, 1 i < j n, in R n.
39 The case n = 3 x -x =1 x -x = x -x =0 1 2 x -x =1 1 2 x -x =1 x -x =
40 Labeling the regions base region: R 0 : x n + 1 > x 1 > > x n
41 Labeling the regions base region: R 0 : x n + 1 > x 1 > > x n λ(r 0 ) = (1, 1,..., 1) Z n
42 If R is labelled, R is separated from R only by x i x j = 0 (i < j), and R is unlabelled, then set λ(r ) = λ(r) + e i. If R is labelled, R is separated from R only by x i x j = 1 (i < j), and R is unlabelled, then set λ(r ) = λ(r) + e j.
43 The labeling rule R λ( ) R R λ( R )=λ( R)+e i R λ( ) R R λ( )=λ( )+e R R j x i = x i < j j x i = x i < j j +1
44 The labeling for n = x x =1 x x = x 1 x 2 = x x =0 x x =1 x x =0 1 2
45 Description of the labels Theorem (Pak, S.). The labels of S n are the parking functions of length n (each occurring once).
46 Description of the labels Theorem (Pak, S.). The labels of S n are the parking functions of length n (each occurring once). Corollary (Shi, 1986) r(s n ) = (n + 1) n 1
47 The parking function S n -module The symmetric group S n acts on the set P n of all parking functions of length n by permuting coordinates.
48 Sample properties Multiplicity of trivial representation (number of orbits) = C n = n+1( 1 2n ) n n = 3 : Number of elements of P n fixed by w S n (character value at w): (#cycles of w) 1 #Fix(w) = (n + 1)
49 Symmetric functions For symmetric function aficionados: Let PF n = ch(p n ). PF n = λ n (n + 1) l(λ) 1 z 1 λ p λ = λ n = λ n 1 n + 1 s λ(1 n+1 )s λ [ 1 ( ) ] λi + n m λ n + 1 n i
50 More properties PF n ωpf n = λ n = λ n n(n 1) (n l(λ) + 2) h λ. m 1 (λ)! m n (λ)! [ 1 ( ) ] n + 1 m λ. n + 1 i λ i
51 Background: invariants of S n The group S n acts on R = C[x 1,...,x n ] by permuting variables, i.e., w x i = x w(i). Let R S n = {f R : w f = f for all w S n}.
52 Background: invariants of S n The group S n acts on R = C[x 1,...,x n ] by permuting variables, i.e., w x i = x w(i). Let R S n = {f R : w f = f for all w S n}. Well-known: R S n = C[e 1,...,e n ], where e k = 1 i 1 <i 2 < <i k n x i1 x i2 x ik.
53 The coinvariant algebra Let D = R/ ( R S n + ) = R/(e 1,...,e n ). Then dim D = n!, and S n acts on D according to the regular representation.
54 Diagonal action of S n Now let S n act diagonally on i.e, As before, let R = C[x 1,...,x n,y 1,...,y n ], w x i = x w(i), w y i = y w(i). R S n = {f R : w f = f for all w S n} ( ) D = R/. R S n +
55 Hainman s theorem Theorem (Haiman, 1994, 2001). dim D = (n + 1) n 1, and the action of S n on D is isomorphic to the action on P n, tensored with the sign representation. (Connections with Macdonald polynomials, Hilbert scheme of points in the plane, etc.)
56 λ-parking functions Let λ = (λ 1,...,λ n ), λ 1 λ n > 0. A λ-parking function is a sequence (a 1,...,a n ) P n whose increasing rearrangement b 1 b n satisfies b i λ n i+1.
57 λ-parking functions Let λ = (λ 1,...,λ n ), λ 1 λ n > 0. A λ-parking function is a sequence (a 1,...,a n ) P n whose increasing rearrangement b 1 b n satisfies b i λ n i+1. Ordinary parking functions: λ = (n,n 1,...,1)
58 Enumeration of λ-parking fns. Theorem (Steck 1968, Gessel 1996). The number N(λ) of λ-parking functions is given by N(λ) = n! det [ λ j i+1 n i+1 (j i + 1)! ] n i,j=1
59 The parking function polytope Given x 1,...,x n R 0, define P = P(x 1,..., x n ) R n by: (y 1,...,y n ) P n if for 1 i n. 0 y i, y y i x x i
60 The parking function polytope Given x 1,...,x n R 0, define P = P(x 1,..., x n ) R n by: (y 1,...,y n ) P n if 0 y i, y y i x x i for 1 i n. (also called Pitman-Stanley polytope)
61 Volume of P Theorem. (a) Let x 1,...,x n N. Then n!v (P n ) = N(λ), where λ n i+1 = x x i. (b) n!v (P n ) = x i1 x in. parking functions (i 1,...,in)
62 Volume of P Theorem. (a) Let x 1,...,x n N. Then n!v (P n ) = N(λ), where λ n i+1 = x x i. (b) n!v (P n ) = x i1 x in. parking functions (i 1,...,in) NOTE. If each x i > 0, then P n has the combinatorial type of an n-cube.
63 References 1. H. W. Becker, Planar rhyme schemes, Bull. Amer. Math. Soc. 58 (1952), 39. Math. Mag. 22 ( ), P. H. Edelman, Chain enumeration and non-crossing partitions, Discrete Math. 31 (1980), P. H. Edelman and R. Simion, Chains in the lattice of noncrossing partitions, Discrete Math. 126 (1994), D. Foata and J. Riordan, Mappings of acyclic and parking functions, aequationes math. 10 (1974), D. Chebikin and A. Postnikov, Generalized parking functions, descent numbers, and chain polytopes of ribbon posets, Advances in Applied Math., to appear.
64 6. I. Gessel and D.-L. Wang, Depth-first search as a combinatorial correspondence, J. Combinatorial Theory (A) 26 (1979), M. Haiman, Conjectures on the quotient ring by diagonal invariants, J. Algebraic Combinatorics 3 (1994), P. Headley, Reduced expressions in infinite Coxeter groups, Ph.D. thesis, University of Michigan, Ann Arbor, P. Headley, On reduced expressions in affine Weyl groups, in Formal Power Series and Algebraic Combinatorics, FPSAC 94, May 23 27, 1994, DIMACS preprint, pp A. G. Konheim and B. Weiss, An occupancy discipline and applications, SIAM J. Applied Math. 14 (1966),
65 11. G. Kreweras, Sur les partitions non croisées d un cycle, Discrete Math. 1 (1972), G. Kreweras, Une famille de polynômes ayant plusieurs propriétés énumeratives, Periodica Math. Hung. 11 (1980), J. Lewis, Parking functions and regions of the Shi arrangement, preprint dated 1 August C. L. Mallows and J. Riordan, The inversion enumerator for labeled trees, Bull Amer. Math. Soc. 74 (1968), J. Pitman and R. Stanley, A polytope related to empirical distributions, plane trees, parking functions, and the associahedron, Discrete Comput. Geom. 27 (2002),
66 16. A. Postnikov and B. Shapiro Trees, parking functions, syzygies, and deformations of monomial ideals, Trans. Amer. Math. Soc. 356 (2004), Y. Poupard, Étude et denombrement paralleles des partitions non croisées d un cycle et des decoupage d un polygone convexe, Discrete Math. 2 (1972), R. Pyke, The supremum and infimum of the Poisson process, Ann. Math. Statist. 30 (1959), V. Reiner, Non-crossing partitions for classical reflection groups, Discrete Math. 177 (1997), J.-Y. Shi, The Kazhdan-Lusztig cells in certain affine Weyl groups, Lecture Note in Mathematics, no. 1179, Springer, Berlin/Heidelberg/New York, 1986.
67 21. J.-Y. Shi, Sign types corresponding to an affine Weyl group, J. London Math. Soc. 35 (1987), R. Simion, Combinatorial statistics on non-crossing partitions, J. Combinatorial Theory (A) 66 (1994), R. Simion and D. Ullman, On the structure of the lattice of noncrossing partitions, Discrete Math. 98 (1991), R. Speicher, Multiplicative functions on the lattice of noncrossing partitions and free convolution, Math. Ann. 298 (1994), R. Stanley, Hyperplane arrangements, interval orders, and trees, Proc. Nat. Acad. Sci. 93 (1996),
68 26. R. Stanley, Parking functions and noncrossing partitions, Electronic J. Combinatorics 4, R20 (1997), 14 pp. 27. R. Stanley, Hyperplane arrangements, parking functions, and tree inversions, in Mathematical Essays in Honor of Gian-Carlo Rota (B. Sagan and R. Stanley, eds.), Birkhäuser, Boston/Basel/Berlin, 1998, pp G. P. Steck, The Smirnov two-sample tests as rank tests, Ann. Math. Statist. 40 (1969), C. H. Yan, Generalized tree inversions and k-parking functions, J. Combinatorial Theory (A) 79 (1997),
69
PARKING 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 informationarxiv: v1 [math.co] 30 Aug 2017
Parking Cars of Different Sizes arxiv:1708.09077v1 [math.co] 30 Aug 2017 Richard Ehrenborg and Alex Happ Abstract We extend the notion of parking functions to parking sequences, which include cars of different
More informationHyperplane Arrangements, Interval Orders and Trees
Hyperplane Arrangements, Interval Orders and Trees Richard P. Stanley 1 Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 Version of 1 December 1995 1 Hyperplane arrangements
More informationParking cars after a trailer
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 70(3) (2018), Pages 402 406 Parking cars after a trailer Richard Ehrenborg Alex Happ Department of Mathematics University of Kentucky Lexington, KY 40506 U.S.A.
More informationLECTURE 6 Separating Hyperplanes (preliminary version)
88 R. STANLEY, HYPERPLANE ARRANGEMENTS LECTURE 6 Separating Hyperplanes (preliminary version) Note. This is a preliminary version of Lecture 6. Section 6.5 in particular is unfinished. (See the proof of
More informationCounting chains in noncrossing partition lattices
Counting chains in noncrossing partition lattices Nathan Reading NC State University NCSU Algebra Seminar, November 16, 2007 1 Counting chains in noncrossing partition lattices Classical noncrossing partitions
More informationNoncrossing Parking Functions
Noncrossing Parking Functions Drew Armstrong (with B. Rhoades and V. Reiner) University of Miami www.math.miami.edu/ armstrong Non-crossing partitions in representation theory Bielefeld, June 2014 Plan
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 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 informationarxiv:math/ v1 [math.co] 10 Nov 1998
A self-dual poset on objects counted by the Catalan numbers arxiv:math/9811067v1 [math.co] 10 Nov 1998 Miklós Bóna School of Mathematics Institute for Advanced Study Princeton, NJ 08540 April 11, 2017
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 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 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 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 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 informationCAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS
CAYLEY COMPOSITIONS, PARTITIONS, POLYTOPES, AND GEOMETRIC BIJECTIONS MATJAŽ KONVALINKA AND IGOR PAK Abstract. In 1857, Cayley showed that certain sequences, now called Cayley compositions, are equinumerous
More informationTwo-boundary lattice paths and parking functions
Two-boundary lattice paths and parking functions Joseph PS Kung 1, Xinyu Sun 2, and Catherine Yan 3,4 1 Department of Mathematics, University of North Texas, Denton, TX 76203 2,3 Department of Mathematics
More informationCatalan numbers, parking functions, and invariant theory
Catalan numbers, parking functions, and invariant theory Vic Reiner Univ. of Minnesota CanaDAM Memorial University, Newfoundland June 10, 2013 Outline 1 Catalan numbers and objects 2 Parking functions
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 informationPartitions, rooks, and symmetric functions in noncommuting variables
Partitions, rooks, and symmetric functions in noncommuting variables Mahir Bilen Can Department of Mathematics, Tulane University New Orleans, LA 70118, USA, mcan@tulane.edu and Bruce E. Sagan Department
More informationarxiv: v2 [math.co] 10 Sep 2010
THE SHI ARRANGEMENT AND THE ISH ARRANGEMENT arxiv:1009.1655v2 [math.co] 10 Sep 2010 DREW ARMSTRONG AND BRENDON RHOADES Abstract. This paper is about two arrangements of hyperplanes. The first the Shi arrangement
More informationENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE. 1. Introduction
ENUMERATION OF CONNECTED CATALAN OBJECTS BY TYPE BRENDON RHOADES Abstract. Noncrossing set partitions, nonnesting set partitions, Dyck paths, and rooted plane trees are four classes of Catalan objects
More informationRational Catalan combinatorics
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
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 LARGEST INTERSECTION LATTICE OF A CHRISTOS A. ATHANASIADIS. Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin.
THE LARGEST INTERSECTION LATTICE OF A DISCRIMINANTAL ARRANGEMENT CHRISTOS A. ATHANASIADIS Abstract. We prove a conjecture of Bayer and Brandt [J. Alg. Combin. 6 (1997), 229{246] about the \largest" intersection
More informationCHRISTOS A. ATHANASIADIS, THOMAS BRADY, AND COLUM WATT
SHELLABILITY OF NONCROSSING PARTITION LATTICES CHRISTOS A. ATHANASIADIS, THOMAS BRADY, AND COLUM WATT Abstract. We give a case-free proof that the lattice of noncrossing partitions associated to any finite
More informationA basis for the non-crossing partition lattice top homology
J Algebr Comb (2006) 23: 231 242 DOI 10.1007/s10801-006-7395-5 A basis for the non-crossing partition lattice top homology Eliana Zoque Received: July 31, 2003 / Revised: September 14, 2005 / Accepted:
More informationBigraphical arrangements
Bigraphical arrangements FPSAC 14, Chicago Sam Hopkins and David Perkinson MIT and Reed College July 2nd, 2014 Sam Hopkins and David Perkinson (2014) Bigraphical arrangements July 2nd, 2014 1 / 26 History
More informationarxiv: v1 [math.co] 24 Jul 2013
BIJECTIONS FOR THE SHI AND ISH ARRANGEMENTS EMILY LEVEN, BRENDON RHOADES, AND ANDREW TIMOTHY WILSON arxiv:07.65v [math.co] 4 Jul 0 Abstract. The Shi hyperplane arrangement Shi(n) was introduced by Shi
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 informationHidden Symmetries of the Root Systems
Universität Bielefeld, SJTU Shanghai, KAU Jeddah 57th Annual Meeting of the Australian Mathematical Society Sydney, October 2, 2013 Symmetry is one idea by which man through the ages has tried to comprehend
More informationShellability of Interval Orders
Shellability of Interval Orders Louis J. Billera and Amy N. Myers September 15, 2006 Abstract An finite interval order is a partially ordered set whose elements are in correspondence with a finite set
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 informationAn 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 informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting PSfrag replacements 7 8 1 2 6 3 5 {{1, 4, 5}, {2, 3}, {6, 8}, {7}} 4 Jon McCammond U.C. Santa Barbara 1 A common structure The goal of this talk will be to introduce
More informationThe (q, t)-catalan Numbers and the Space of Diagonal Harmonics. James Haglund. University of Pennsylvania
The (q, t)-catalan Numbers and the Space of Diagonal Harmonics James Haglund University of Pennsylvania Outline Intro to q-analogues inv and maj q-catalan Numbers MacMahon s q-analogue The Carlitz-Riordan
More informationOutline. Some Reflection Group Numerology. Root Systems and Reflection Groups. Example: Symmetries of a triangle. Paul Renteln
Outline 1 California State University San Bernardino and Caltech 2 Queen Mary University of London June 13, 2014 3 Root Systems and Reflection Groups Example: Symmetries of a triangle V an n dimensional
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 informationFinding parking when not commuting. Jon McCammond U.C. Santa Barbara
Finding parking when not commuting 7 6 8 1 2 3 5 4 {{1,4,5}, {2,3}, {6,8}, {7}} Jon McCammond U.C. Santa Barbara 1 A common structure The main goal of this talk will be to introduce you to a mathematical
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 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 informationProblem 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.
18.217 Problem Set (due Monday, December 03, 2018) Solve as many problems as you want. Turn in your favorite solutions. You can also solve and turn any other claims that were given in class without proofs,
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 informationThe symmetric group action on rank-selected posets of injective words
The symmetric group action on rank-selected posets of injective words Christos A. Athanasiadis Department of Mathematics University of Athens Athens 15784, Hellas (Greece) caath@math.uoa.gr October 28,
More informationRoot system chip-firing
Root system chip-firing PhD Thesis Defense Sam Hopkins Massachusetts Institute of Technology April 27th, 2018 Includes joint work with Pavel Galashin, Thomas McConville, Alexander Postnikov, and James
More informationON IDEALS OF TRIANGULAR MATRIX RINGS
Periodica Mathematica Hungarica Vol 59 (1), 2009, pp 109 115 DOI: 101007/s10998-009-9109-y ON IDEALS OF TRIANGULAR MATRIX RINGS Johan Meyer 1, Jenő Szigeti 2 and Leon van Wyk 3 [Communicated by Mária B
More information1. Introduction
Séminaire Lotharingien de Combinatoire 49 (2002), Article B49a AVOIDING 2-LETTER SIGNED PATTERNS T. MANSOUR A AND J. WEST B A LaBRI (UMR 5800), Université Bordeaux, 35 cours de la Libération, 33405 Talence
More informationThe Yuri Manin Ring and Its B n -Analogue
Advances in Applied Mathematics 26, 154 167 (2001) doi:10.1006/aama.2000.0713, available online at http://www.idealibrary.com on The Yuri Manin Ring and Its B n -Analogue Margaret A. Readdy Department
More informationNotes on D 4 May 7, 2009
Notes on D 4 May 7, 2009 Consider the simple Lie algebra g of type D 4 over an algebraically closed field K of characteristic p > h = 6 (the Coxeter number). In particular, p is a good prime. We have dim
More informationEuler characteristic of the truncated order complex of generalized noncrossing partitions
Euler characteristic of the truncated order complex of generalized noncrossing partitions D. Armstrong and C. Krattenthaler Department of Mathematics, University of Miami, Coral Gables, Florida 33146,
More informationCOMMUTATIVE ALGEBRA OF n POINTS IN THE PLANE
COMMUTATIVE ALGEBRA OF n POINTS IN THE PLANE MARK HAIMAN Introduction These lectures will address commutative algebra questions arising from the geometry of configurations of n points in the affine plane
More informationMAXIMAL PERIODS OF (EHRHART) QUASI-POLYNOMIALS
MAXIMAL PERIODS OF (EHRHART QUASI-POLYNOMIALS MATTHIAS BECK, STEVEN V. SAM, AND KEVIN M. WOODS Abstract. A quasi-polynomial is a function defined of the form q(k = c d (k k d + c d 1 (k k d 1 + + c 0(k,
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 informationClusters, Coxeter-sortable elements and noncrossing partitions
Formal Power Series and Algebraic Combinatorics Séries Formelles et Combinatoire Algébrique San Diego, California 2006 Clusters, Coxeter-sortable elements and noncrossing partitions Extended abstract.
More informationNONCROSSING PARTITIONS FOR THE GROUP D n
NONCROSSING PARTITIONS FOR THE GROUP D n CHRISTOS A. ATHANASIADIS AND VICTOR REINER Dedicated to the memory of Rodica Simion Abstract. The poset of noncrossing partitions can be naturally defined for any
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationOn the Homogenized Linial Arrangement: Intersection Lattice and Genocchi Numbers
Séminaire Lotharingien de Combinatoire XX (2019) Article #YY, 12 pp. Proceedings of the 31 st Conference on Formal Power Series and Algebraic Combinatorics (Ljubljana) On the Homogenized Linial Arrangement:
More informationTHE THEORY OF HEAPS AND THE CARTIER FOATA MONOID. C. Krattenthaler
THE THEORY OF HEAPS AND THE CARTIER FOATA MONOID C Krattenthaler Fakultät für Mathematik, Universität Wien, Nordbergstraße 15, A-1090 Vienna, Austria WWW: http://wwwmatunivieacat/~kratt Abstract We present
More informationRHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS
RHOMBUS TILINGS OF A HEXAGON WITH TWO TRIANGLES MISSING ON THE SYMMETRY AXIS THERESIA EISENKÖLBL Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. E-mail: Theresia.Eisenkoelbl@univie.ac.at
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 informationLOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi
LOWER BOUNDARY HYPERPLANES OF THE CANONICAL LEFT CELLS IN THE AFFINE WEYL GROUP W a (Ãn 1) Jian-yi Shi Department of Mathematics, East China Normal University, Shanghai, 200062, China and Center for Combinatorics,
More informationCounting Three-Line Latin Rectangles
Counting Three-Line Latin Rectangles Ira M Gessel* Department of Mathematics Brandeis University Waltham, MA 02254 A k n Latin rectangle is a k n array of numbers such that (i) each row is a permutation
More informationAvalanche Polynomials of some Families of Graphs
Avalanche Polynomials of some Families of Graphs Dominique Rossin, Arnaud Dartois, Robert Cori To cite this version: Dominique Rossin, Arnaud Dartois, Robert Cori. Avalanche Polynomials of some Families
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationThe Phagocyte Lattice of Dyck Words
DOI 10.1007/s11083-006-9034-0 The Phagocyte Lattice of Dyck Words J. L. Baril J. M. Pallo Received: 26 September 2005 / Accepted: 25 May 2006 Springer Science + Business Media B.V. 2006 Abstract We introduce
More informationLECTURE 11: SOERGEL BIMODULES
LECTURE 11: SOERGEL BIMODULES IVAN LOSEV Introduction In this lecture we continue to study the category O 0 and explain some ideas towards the proof of the Kazhdan-Lusztig conjecture. We start by introducing
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 informationParking functions, tree depth and factorizations of the full cycle into transpositions
FPSAC 2016 Vancouver, Canada DMTCS proc. BC, 2016, 647 658 Parking functions, tree depth and factorizations of the full cycle into transpositions John Irving 1 and Amarpreet Rattan 2 1 Department of Mathematics
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 informationON γ-vectors SATISFYING THE KRUSKAL-KATONA INEQUALITIES
ON γ-vectors SATISFYING THE KRUSKAL-KATONA INEQUALITIES ERAN NEVO AND T. KYLE PETERSEN Abstract. We present examples of flag homology spheres whose γ- vectors satisfy the Kruskal-Katona inequalities. This
More informationCombinatorial Interpretations of a Generalization of the Genocchi Numbers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.6 Combinatorial Interpretations of a Generalization of the Genocchi Numbers Michael Domaratzki Jodrey School of Computer Science
More informationMinimal transitive factorizations of a permutation of type (p, q)
FPSAC 2012, Nagoya, Japan DMTCS proc. AR, 2012, 679 688 Minimal transitive factorizations of a permutation of type (p, q Jang Soo Kim 1, Seunghyun Seo 2 and Heesung Shin 3 1 School of Mathematics, University
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 informationEQUIDISTRIBUTION AND SIGN-BALANCE ON 321-AVOIDING PERMUTATIONS
Séminaire Lotharingien de Combinatoire 51 (2004), Article B51d EQUIDISTRIBUTION AND SIGN-BALANCE ON 321-AVOIDING PERMUTATIONS RON M. ADIN AND YUVAL ROICHMAN Abstract. Let T n be the set of 321-avoiding
More informationThe Hopf monoid of generalized permutahedra. SIAM Discrete Mathematics Meeting Austin, TX, June 2010
The Hopf monoid of generalized permutahedra Marcelo Aguiar Texas A+M University Federico Ardila San Francisco State University SIAM Discrete Mathematics Meeting Austin, TX, June 2010 The plan. 1. Species.
More informationPatterns in Standard Young Tableaux
Patterns in Standard Young Tableaux Sara Billey University of Washington Slides: math.washington.edu/ billey/talks Based on joint work with: Matjaž Konvalinka and Joshua Swanson 6th Encuentro Colombiano
More informationTHE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 125, Number 11, November 1997, Pages 3155 3161 S 0002-9939(9704049-5 THE Q-SPECTRUM AND SPANNING TREES OF TENSOR PRODUCTS OF BIPARTITE GRAPHS TIMOTHY
More informationSYZYGIES OF ORIENTED MATROIDS
DUKE MATHEMATICAL JOURNAL Vol. 111, No. 2, c 2002 SYZYGIES OF ORIENTED MATROIDS ISABELLA NOVIK, ALEXANDER POSTNIKOV, and BERND STURMFELS Abstract We construct minimal cellular resolutions of squarefree
More informationThe volume of the caracol polytope
Séminaire Lotharingien de Combinatoire XX (218) Article #YY, 12 pp. Proceedings of the 3 th Conference on Formal Power Series and Algebraic Combinatorics (Hanover) The volume of the caracol polytope Carolina
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 informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationBruhat order, rationally smooth Schubert varieties, and hyperplane arrangements
FPSAC 2010, San Francisco, USA DMTCS proc. AN, 2010, 833 840 Bruhat order, rationally smooth Schubert varieties, and hyperplane arrangements Suho Oh 1 and Hwanchul Yoo Department of Mathematics, Massachusetts
More informationA multiplicative deformation of the Möbius function for the poset of partitions of a multiset
Contemporary Mathematics A multiplicative deformation of the Möbius function for the poset of partitions of a multiset Patricia Hersh and Robert Kleinberg Abstract. The Möbius function of a partially ordered
More informationA NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9
A NOTE ON TENSOR CATEGORIES OF LIE TYPE E 9 ERIC C. ROWELL Abstract. We consider the problem of decomposing tensor powers of the fundamental level 1 highest weight representation V of the affine Kac-Moody
More informationThe Sorting Order on a Coxeter Group
FPSAC 2008, Valparaiso-Viña del Mar, Chile DMTCS proc. AJ, 2008, 411 416 The Sorting Order on a Coxeter Group Drew Armstrong School of Mathematics, University of Minnesota, 206 Church St. SE, Minneapolis,
More informationEnumeration of Concave Integer Partitions
3 47 6 3 Journal of Integer Sequences, Vol. 7 (004), Article 04..3 Enumeration of Concave Integer Partitions Jan Snellman and Michael Paulsen Department of Mathematics Stockholm University SE-069 Stockholm,
More informationFREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS
FREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS N. ALTAFI, N. NEMATI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let S = K[x 1,..., x n ] be the polynomial ring over a field K. In this
More informationThe Tutte polynomial of a graph, depth-first search, and simplicial complex partitions
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions Dedicated to Dominique Foata on the occasion of his 60th birthday Appeared in Electronic J. Combin. (Foata Festschrift
More informationTHE BUCHBERGER RESOLUTION ANDA OLTEANU AND VOLKMAR WELKER
THE BUCHBERGER RESOLUTION ANDA OLTEANU AND VOLKMAR WELKER arxiv:1409.2041v2 [math.ac] 11 Sep 2014 Abstract. We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in
More informationPhilip Puente. Statement of Research and Scholarly Interests 1 Areas of Interest
Philip Puente Statement of Research and Scholarly Interests 1 Areas of Interest I work on questions on reflection groups at the intersection of algebra, geometry, and topology. My current research uses
More informationThe Gaussian coefficient revisited
The Gaussian coefficient revisited Richard EHRENBORG and Margaret A. READDY Abstract We give new -(1+)-analogue of the Gaussian coefficient, also now as the -binomial which, lie the original -binomial
More informationGENERALIZED BRAUER TREE ORDERS
C O L L O Q U I U M M A T H E M A T I C U M VOL. 71 1996 NO. 2 GENERALIZED BRAUER TREE ORDERS BY K. W. R O G G E N K A M P (STUTTGART) Introduction. p-adic blocks of integral group rings with cyclic defect
More informationON THE BRUHAT ORDER OF THE SYMMETRIC GROUP AND ITS SHELLABILITY
ON THE BRUHAT ORDER OF THE SYMMETRIC GROUP AND ITS SHELLABILITY YUFEI ZHAO Abstract. In this paper we discuss the Bruhat order of the symmetric group. We give two criteria for comparing elements in this
More informationFULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS. Jian-yi Shi
FULLY COMMUTATIVE ELEMENTS AND KAZHDAN LUSZTIG CELLS IN THE FINITE AND AFFINE COXETER GROUPS Jian-yi Shi Abstract. The main goal of the paper is to show that the fully commutative elements in the affine
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 informationMonomial equivariant embeddings of quasitoric manifolds and the problem of existence of invariant almost complex structures.
Monomial equivariant embeddings of quasitoric manifolds and the problem of existence of invariant almost complex structures. Andrey Kustarev joint work with V. M. Buchstaber, Steklov Mathematical Institute
More informationA Blossoming Algorithm for Tree Volumes of Composite Digraphs
A Blossoming Algorithm for Tree Volumes of Composite Digraphs Victor J. W. Guo Center for Combinatorics, LPMC, Nankai University, Tianjin 30007, People s Republic of China Email: jwguo@eyou.com Abstract.
More informationCrossings and Nestings in Tangled Diagrams
Crossings and Nestings in Tangled Diagrams William Y. C. Chen 1, Jing Qin 2 and Christian M. Reidys 3 Center for Combinatorics, LPMC-TJKLC Nankai University, Tianjin 300071, P. R. China 1 chen@nankai.edu.cn,
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d
More informationHILBERT BASIS OF THE LIPMAN SEMIGROUP
Available at: http://publications.ictp.it IC/2010/061 United Nations Educational, Scientific and Cultural Organization and International Atomic Energy Agency THE ABDUS SALAM INTERNATIONAL CENTRE FOR THEORETICAL
More information