Increasing and Decreasing Subsequences
|
|
- Kerry Stephens
- 6 years ago
- Views:
Transcription
1 Increasing and Decreasing Subsequences Richard P. Stanley M.I.T.
2
3
4
5
6 Permutations
7 Permutations First lecture: increasing and decreasing subsequences
8 Permutations First lecture: increasing and decreasing subsequences Second lecture: alternating permutations
9 Permutations First lecture: increasing and decreasing subsequences Second lecture: alternating permutations Third lecture: reduced decompositions
10 Definitions (increasing subsequence) (decreasing subsequence) is(w) = longest i.s. = 4 ds(w) = longest d.s. = 3
11 Application: airplane boarding Naive model: passengers board in order w = a 1 a 2 a n for seats 1, 2,..., n. Each passenger takes one time unit to be seated after arriving at his seat.
12 Boarding process
13 Boarding process
14 Boarding process
15 Boarding process
16 Results Easy: Total waiting time = is(w). Bachmat, et al.: more sophisticated model.
17 Results Easy: Total waiting time = is(w). Bachmat, et al.: more sophisticated model. Two conclusions: Usual system (back-to-front) not much better than random. Better: first board window seats, then center, then aisle.
18 Partitions partition λ n: λ = (λ 1, λ 2,... ) λ 1 λ 2 0 λi = n
19 Young diagrams (Young) diagram of λ = (4, 4, 3, 1):
20 Conjugate partitions λ = (4, 3, 3, 2), the conjugate partition to λ = (4, 4, 3, 2) λ λ
21 Standard Young tableau standard Young tableau (SYT) of shape λ n, e.g., λ = (4, 4, 3, 1): < <
22 f λ f λ = # of SYT of shape λ E.g., f (3,2) = 5:
23 f λ f λ = # of SYT of shape λ E.g., f (3,2) = 5: simple formula for f λ (Frame-Robinson-Thrall hook-length formula)
24 f λ f λ = # of SYT of shape λ E.g., f (3,2) = 5: simple formula for f λ (Frame-Robinson-Thrall hook-length formula) Note. f λ = dim(irrep. of S n ), where S n is the symmetric group of all permutations of 1, 2..., n.
25 RSK algorithm RSK algorithm: a bijection w rsk (P, Q), where w S n and P, Q are SYT of the same shape λ n. Write λ = sh(w), the shape of w.
26 RSK algorithm RSK algorithm: a bijection w rsk (P, Q), where w S n and P, Q are SYT of the same shape λ n. Write λ = sh(w), the shape of w. R = Gilbert de Beauregard Robinson S = Craige Schensted (= Ea Ea) K = Donald Ervin Knuth
27 Example of RSK w = 4132: φ
28 Example of RSK w = 4132: (P, Q) = ( , ) φ
29 Schensted s theorem Theorem. Let w rsk (P, Q), where sh(p ) = sh(q) = λ. Then is(w) = longest row length = λ 1 ds(w) = longest column length = λ 1.
30 Schensted s theorem Theorem. Let w rsk (P, Q), where sh(p ) = sh(q) = λ. Then is(w) = longest row length = λ 1 ds(w) = longest column length = λ 1. ( ) 1 2 Example rsk 1 3 3, is(w) = 2, ds(w) = 3.
31 Erdős-Szekeres theorem Corollary (Erdős-Szekeres, Seidenberg). Let w S pq+1. Then either is(w) > p or ds(w) > q.
32 Erdős-Szekeres theorem Corollary (Erdős-Szekeres, Seidenberg). Let w S pq+1. Then either is(w) > p or ds(w) > q. Proof. Let λ = sh(w). If is(w) p and ds(w) q then λ 1 p and λ 1 q, so λ i pq.
33 An extremal case Corollary. Say p q. Then #{w S pq : is(w) = p, ds(w) = q} = ( ) 2 f (pq )
34 An extremal case Corollary. Say p q. Then #{w S pq : is(w) = p, ds(w) = q} = ( ) 2 f (pq ) By hook-length formula, this is ( ) 2 (pq)! p p (p + 1) p q p (q + 1) p 1 (p + q 1) 1
35 Romik s theorem Romik: let w S n 2, is(w) = ds(w) = n. Let P w be the permutation matrix of w with corners (±1, ±1). Then (informally) as n almost surely the 1 s in P w will become dense in the region bounded by the curve (x 2 y 2 ) 2 + 2(x 2 + y 2 ) = 3, and will remain isolated outside this region.
36 An example w = 9, 11, 6, 14, 2, 10, 1, 5, 13, 3, 16, 8, 15, 4, 12, 17
37 (x 2 y 2 ) 2 + 2(x 2 + y 2 ) = 3 1 y x 0.5 1
38 Area enclosed by curve α = (1 t2 )(1 (t/3) 2 ) dt (t/3) 2 1 t 2 dt = 4( )
39 Expectation of is(w) E(n) = expectation of is(w), w S n = 1 n! = 1 n! is(w) w S n ( λ ) 1 f λ 2 λ n
40 Expectation of is(w) E(n) = expectation of is(w), w S n = 1 n! = 1 n! w S n is(w) λ n λ 1 ( f λ ) 2 Ulam: what is distribution of is(w)? rate of growth of E(n)?
41 Work of Hammersley Hammersley (1972): c = lim n n 1/2 E(n), and π 2 c e.
42 Work of Hammersley Hammersley (1972): c = lim n n 1/2 E(n), and Conjectured c = 2. π 2 c e.
43 c = 2 Logan-Shepp, Vershik-Kerov (1977): c = 2
44 c = 2 Logan-Shepp, Vershik-Kerov (1977): c = 2 Idea of proof. E(n) = 1 n! ( λ ) 1 f λ 2 λ n 1 n! max λ n λ 1 ( f λ ) 2. Find limiting shape of λ n maximizing λ as n using hook-length formula.
45 A big partition
46 The limiting curve
47 Equation of limiting curve x = y + 2 cos θ y = 2 (sin θ θ cos θ) π 0 θ π
48 is(w) 2 u k (n) := #{w S n : is n (w) k}.
49 is(w) 2 u k (n) := #{w S n : is n (w) k}. J. M. Hammersley (1972): a Catalan number. u 2 (n) = C n = 1 n + 1 ( 2n n ),
50 is(w) 2 u k (n) := #{w S n : is n (w) k}. J. M. Hammersley (1972): a Catalan number. u 2 (n) = C n = 1 n + 1 ( 2n For >170 combinatorial interpretations of C n, see n ), www-math.mit.edu/ rstan/ec
51 Gessel s theorem I. Gessel (1990): n 0 u k (n) x2n n! 2 = det [ I i j (2x) ] k i,j=1, where I m (2x) = j 0 x m+2j j!(m + j)!, a hyperbolic Bessel function of the first kind of order m.
52 The case k = 2 Example. n 0 u 2 (n) x2n n! 2 = I 0 (2x) 2 I 1 (2x) 2 = n 0 C n x 2n n! 2.
53 Painlevé II equation Baik-Deift-Johansson: Define u(x) by d 2 dx 2u(x) = 2u(x)3 + xu(x) ( ), with certain initial conditions.
54 Painlevé II equation Baik-Deift-Johansson: Define u(x) by d 2 dx 2u(x) = 2u(x)3 + xu(x) ( ), with certain initial conditions. ( ) is the Painlevé II equation (roughly, the branch points and essential singularities are independent of the initial conditions).
55 Paul Painlevé 1863: born in Paris.
56 Paul Painlevé 1863: born in Paris. 1890: Grand Prix des Sciences Mathématiques
57 Paul Painlevé 1863: born in Paris. 1890: Grand Prix des Sciences Mathématiques 1908: first passenger of Wilbur Wright; set flight duration record of one hour, 10 minutes.
58 Paul Painlevé 1863: born in Paris. 1890: Grand Prix des Sciences Mathématiques 1908: first passenger of Wilbur Wright; set flight duration record of one hour, 10 minutes. 1917, 1925: Prime Minister of France.
59 Paul Painlevé 1863: born in Paris. 1890: Grand Prix des Sciences Mathématiques 1908: first passenger of Wilbur Wright; set flight duration record of one hour, 10 minutes. 1917, 1925: Prime Minister of France. 1933: died in Paris.
60 The Tracy-Widom distribution F (t) = exp ( t ) (x t)u(x) 2 dx where u(x) is the Painlevé II function.
61 The Baik-Deift-Johansson theorem Let χ be a random variable with distribution F, and let χ n be the random variable on S n : χ n (w) = is n(w) 2 n n 1/6.
62 The Baik-Deift-Johansson theorem Let χ be a random variable with distribution F, and let χ n be the random variable on S n : Theorem. As n, χ n (w) = is n(w) 2 n n 1/6. χ n χ in distribution, i.e., lim Prob(χ n t) = F (t). n
63 Expectation redux Recall E(n) 2 n.
64 Expectation redux Recall E(n) 2 n. Corollary to BDJ theorem. E(n) = 2 ( ) n + t df (t) n 1/6 + o(n 1/6 ) = 2 n ( )n 1/6 + o(n 1/6 )
65 Proof of BDJ theorem Gessel s theorem reduces the problem to just analysis, viz., the Riemann-Hilbert problem in the theory of integrable systems, and the method of steepest descent to analyze the asymptotic behavior of integrable systems.
66 Origin of Tracy-Widom distribution Where did the Tracy-Widom distribution F (t) come from? F (t) = exp ( t ) (x t)u(x) 2 dx d 2 dx 2u(x) = 2u(x)3 + xu(x)
67 Gaussian Unitary Ensemble (GUE) Analogue of normal distribution for n n hermitian matrices M = (M ij ):
68 Gaussian Unitary Ensemble (GUE) Analogue of normal distribution for n n hermitian matrices M = (M ij ): dm = i dm ii Zn 1 e tr(m 2) dm, i<j d(r M ij )d(i M ij ), where Z n is a normalization constant.
69 Tracy-Widom theorem Tracy-Widom (1994): let α 1 denote the largest eigenvalue of M. Then lim n Prob (( α 1 ) 2n) 2n 1/6 t = F (t).
70 Random topologies Is the connection between is(w) and GUE a coincidence?
71 Random topologies Is the connection between is(w) and GUE a coincidence? Okounkov provides a connection, via the theory of random topologies on surfaces. Very briefly, a surface can be described in two ways: Gluing polygons along their edges, connected to random matrices via quantum gravity. Ramified covering of a sphere, which can be formulated in terms of permutations.
72 Two variations 1. Matchings 2. Pattern avoidance
73 Matching collaborators Joint with: Bill Chen Eva Deng Rosena Du Catherine Yan
74 Complete matchings (complete) matching:
75 Complete matchings (complete) matching: total number of matchings on [2n] := {1, 2,..., 2n} is (2n 1)!! := (2n 1).
76 Crossings and nestings 3 crossing 3 nesting
77 Crossing and nesting number M = matching cr(m) = max{k : k-crossing} ne(m) = max{k : k-nesting}
78 Crossing and nesting number M = matching cr(m) = max{k : k-crossing} ne(m) = max{k : k-nesting} Theorem. The number of matchings on [2n] with no crossings (or with no nestings) is C n := 1 ( ) 2n. n + 1 n
79 Main result on matchings Theorem. Let f n (i, j) = # matchings M on [2n] with cr(m) = i and ne(m) = j. Then f n (i, j) = f n (j, i).
80 Main result on matchings Theorem. Let f n (i, j) = # matchings M on [2n] with cr(m) = i and ne(m) = j. Then f n (i, j) = f n (j, i). Corollary. # matchings M on [2n] with cr(m) = k equals # matchings M on [2n] with ne(m) = k.
81 Oscillating tableaux φ shape (3, 1), length 8
82 Oscillating tableaux φ shape (3, 1), length 8 M Φ (M) φ φ φ φ
83 Proof sketch Φ is a bijection from matchings on 1, 2,..., 2n to oscillating tableaux of length 2n, shape. Corollary. Number of oscillating tableaux of length 2n, shape, is (2n 1)!!.
84 Proof sketch Φ is a bijection from matchings on 1, 2,..., 2n to oscillating tableaux of length 2n, shape. Corollary. Number of oscillating tableaux of length 2n, shape, is (2n 1)!!. (related to Brauer algebra of dimension (2n 1)!!).
85 Schensted for matchings Schensted s theorem for matchings. Let Φ(M) = ( = λ 0, λ 1,..., λ 2n = ). Then cr(m) = max{(λ i ) 1 : 0 i n} ne(m) = max{λ i 1 : 0 i n}.
86 Schensted for matchings Schensted s theorem for matchings. Let Φ(M) = ( = λ 0, λ 1,..., λ 2n = ). Then cr(m) = max{(λ i ) 1 : 0 i n} ne(m) = max{λ i 1 : 0 i n}. Proof. Reduce to ordinary RSK.
87 An example M Φ (M) φ φ φ φ
88 An example M Φ (M) φ φ φ φ cr(m) = 2, ne(m) = 2
89 M Now let cr(m) = i, ne(m) = j, and Φ(M) = ( = λ 0, λ 1,..., λ 2n = ). Define M by Φ(M ) = ( = (λ 0 ), (λ 1 ),..., (λ 2n ) = ). By Schensted s theorem for matchings, cr(m ) = j, ne(m ) = i.
90 Conclusion of proof Thus M M is an involution on matchings of [2n] interchanging cr and ne. Theorem. Let f n (i, j) = # matchings M on [2n] with cr(m) = i and ne(m) = j. Then f n (i, j) = f n (j, i).
91 Simple description? Open: simple description of M M, the analogue of a 1 a 2 a n a n a 2 a 1, which interchanges is and ds.
92 g k (n) g k (n) = number of matching M on [2n] with cro(m) k (matching analogue of u k (n))
93 Grabiner-Magyar theorem Theorem. Define H k (x) = n g k (n) x2n (2n)!. Then Hk (x) = det [ I i j (2x) I i+j (2x) ] k i,j=1 where as before. I m (2x) = j 0 x m+2j j!(m + j)!
94 Gessel s theorem redux Compare: I. Gessel (1990): n 0 u k (n) x2n n! 2 = det [ I i j (2x) ] k i,j=1.
95 Noncrossing example Example. k = 1 (noncrossing matchings): H 1 (x) = I 0 (2x) I 2 (2x) = j 0 C j x 2j (2j)!.
96 Baik-Rains theorem Baik-Rains (implicitly): lim Prob n ( cr n (M) 2n (2n) 1/6 t 2 ) = F 1 (t), where F 1 (t) = F (t) exp ( 1 2 t ) u(s)ds, where F (t) is the Tracy-Widom distribution and u(t) the Painlevé II function.
97 Bounding cr(m) and ne(n) g j,k (n) := #{matchings M on [2n], cr(m) j, ne(m) k}
98 Bounding cr(m) and ne(n) g j,k (n) := #{matchings M on [2n], cr(m) j, ne(m) k} g j,k (n) = #{( = λ 0, λ 1,..., λ 2n = ) : λ i+1 = λ i ±, λ i j k rectangle}, a walk on a graph L(j, k).
99 L(2, 3) φ L(2,3)
100 Transfer matrix generating function A = adjacency matrix of H(j, k) = adjacency matrix of H(j, k) { }. A 0
101 Transfer matrix generating function A = adjacency matrix of H(j, k) = adjacency matrix of H(j, k) { }. A 0 Transfer-matrix method g j,k (n)x 2n = det(i xa 0) det(i xa). n 0
102 Zeros of det(i xa) Theorem (Grabiner, implicitly) Every zero of det(i xa) has the form 2(cos(πr 1 /m) + + cos(πr j /m)), where each r i Z and m = j + k + 1.
103 Zeros of det(i xa) Theorem (Grabiner, implicitly) Every zero of det(i xa) has the form 2(cos(πr 1 /m) + + cos(πr j /m)), where each r i Z and m = j + k + 1. Corollary. Every irreducible factor of det(i xa) over Q has degree dividing 1 φ(2(j + k + 1)), 2 where φ is the Euler phi-function.
104 An example Example. j = 2, k = 5, 1 2φ(16) = 4: det(i xa) = (1 2x 2 )(1 4x 2 + 2x 4 ) (1 8x 2 + 8x 4 )(1 8x 2 + 8x 3 2x 4 ) (1 8x 2 8x 3 2x 4 )
105 Another example j = k = 3, 1 2φ(14) = 3: det(i xa) = (1 x)(1 + x)(1 + x 9x 2 x 3 ) (1 x 9x 2 + x 3 )(1 x 2x 2 + x 3 ) 2 (1 + x 2x 2 x 3 ) 2
106 An open problem rank(a) =? Or even: when is A invertible?
107 An open problem rank(a) =? Or even: when is A invertible? Eigenvalues are known (and A is symmetric)
108 An open problem rank(a) =? Or even: when is A invertible? Eigenvalues are known (and A is symmetric) Cannot tell from the trigonometric expression for the eigenvalues when they are 0.
109 Pattern avoidance v = b 1 b k S k w = a 1 a n S n w avoids v if no subsequence a i1 a ik of w is in the same relative order as v.
110 Pattern avoidance v = b 1 b k S k w = a 1 a n S n w avoids v if no subsequence a i1 a ik of w is in the same relative order as v does not avoid 3142.
111 Pattern avoidance v = b 1 b k S k w = a 1 a n S n w avoids v if no subsequence a i1 a ik of w is in the same relative order as v does not avoid w has no increasing (decreasing) subsequence of length k w avoids 12 k (k 21).
112 The case k = 3 Let v S k. Define S n (v) = {w S n : w avoids v} s n (v) = #S n (v).
113 The case k = 3 Let v S k. Define S n (v) = {w S n : w avoids v} s n (v) = #S n (v). Hammersley-Knuth-Rotem: s n (123) = s n (321) = C n.
114 The case k = 3 Let v S k. Define S n (v) = {w S n : w avoids v} s n (v) = #S n (v). Hammersley-Knuth-Rotem: Knuth: s n (123) = s n (321) = C n. s n (132) = s n (213) = s n (231) = s n (312) = C n.
115 Generating trees Chung-Graham-Hoggatt-Kleiman, West: define u v if u is a subsequence of v
116 123 and 132-avoiding trees black: 123 avoiding magenta: 132 avoiding
117 Structure of the tree k children 2, 3,..., k+1 children
118 Wilf equivalence Define u v if s n (u) = s n (v) for all n.
119 Wilf equivalence Define u v if s n (u) = s n (v) for all n. One equivalence class for k = 3.
120 Wilf equivalence Define u v if s n (u) = s n (v) for all n. One equivalence class for k = 3. Three equivalence classes for k = 4.
121 The three classes for k = 4 Gessel: s n (1234) = 1 (n + 1) 2 (n + 2) n j=0 ( 2j j )( )( ) n + 1 n + 2 j + 1 j + 2
122 The three classes for k = 4 Gessel: s n (1234) = 1 (n + 1) 2 (n + 2) n j=0 ( 2j j )( )( ) n + 1 n + 2 j + 1 j + 2 Bóna: s n (1342)x n = n 0 32x x 8x 2 (1 8x) 3/2,
123 The three classes for k = 4 Gessel: s n (1234) = 1 (n + 1) 2 (n + 2) n j=0 ( 2j j )( )( ) n + 1 n + 2 j + 1 j + 2 Bóna: s n (1342)x n = n 0 32x x 8x 2 (1 8x) 3/2, Open: s n (1324)
124 Typical application Ryan, Lakshmibai-Sandhya, Haiman: Let w S n. The Schubert variety Ω w in the complete flag variety GL(n, C) is smooth if and only if w avoids 4231 and 3412.
125 Typical application Ryan, Lakshmibai-Sandhya, Haiman: Let w S n. The Schubert variety Ω w in the complete flag variety GL(n, C) is smooth if and only if w avoids 4231 and n 0 where f(n)x n = 1 x x2 1 x C(x) = n 0 ( 1 ), 2x 1+x (1 x)c(x) 1 C n x n = 1 1 4x 2x.
126
arxiv:math/ v1 [math.co] 1 Dec 2005
Increasing and Decreasing Subsequences of Permutations and Their Variants arxiv:math/0512035v1 [math.co] 1 Dec 2005 Richard P. Stanley Department of Mathematics, Massachusetts Institute of Technology Cambridge,
More informationEnumerative Combinatorics with Fillings of Polyominoes
Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M Univesrity GSU, October, 204 2 Outline. Symmetry of the longest chains Subsequences in permutations and words Crossings and
More informationEnumerative Combinatorics with Fillings of Polyominoes
Enumerative Combinatorics with Fillings of Polyominoes Catherine Yan Texas A&M University Tulane, March 205 Tulane, March 205 2 Outline. Symmetry of the longest chains Subsequences in permutations and
More informationFrom longest increasing subsequences to Whittaker functions and random polymers
From longest increasing subsequences to Whittaker functions and random polymers Neil O Connell University of Warwick British Mathematical Colloquium, April 2, 2015 Collaborators: I. Corwin, T. Seppäläinen,
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 informationUniversality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium
Universality of distribution functions in random matrix theory Arno Kuijlaars Katholieke Universiteit Leuven, Belgium SEA 06@MIT, Workshop on Stochastic Eigen-Analysis and its Applications, MIT, Cambridge,
More informationL n = l n (π n ) = length of a longest increasing subsequence of π n.
Longest increasing subsequences π n : permutation of 1,2,...,n. L n = l n (π n ) = length of a longest increasing subsequence of π n. Example: π n = (π n (1),..., π n (n)) = (7, 2, 8, 1, 3, 4, 10, 6, 9,
More informationGeometric RSK, Whittaker functions and random polymers
Geometric RSK, Whittaker functions and random polymers Neil O Connell University of Warwick Advances in Probability: Integrability, Universality and Beyond Oxford, September 29, 2014 Collaborators: I.
More informationBeyond the Gaussian universality class
Beyond the Gaussian universality class MSRI/Evans Talk Ivan Corwin (Courant Institute, NYU) September 13, 2010 Outline Part 1: Random growth models Random deposition, ballistic deposition, corner growth
More informationSum of matrix entries of representations of the symmetric group and its asymptotics
Sum of matrix entries of representations of the symmetric group and its asymptotics Dario De Stavola 7 September 2015 Advisor: Valentin Féray Affiliation: University of Zürich Preliminaries Partitions
More informationOn the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh)
On the Error Bound in the Normal Approximation for Jack Measures (Joint work with Le Van Thanh) Louis H. Y. Chen National University of Singapore International Colloquium on Stein s Method, Concentration
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 informationSymmetrized random permutations
Symmetrized random permutations Jinho Baik and Eric M. Rains September 23, 1999 Abstract Selecting N random points in a unit square corresponds to selecting a random permutation. Placing symmetry restrictions
More informationCROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 CROSSINGS AND NESTINGS OF MATCHINGS AND PARTITIONS WILLIAM Y.C. CHEN, EVA Y.P. DENG, ROSENA R.X.
More informationEnumeration of Set Partitions Refined by. Crossing and Nesting Numbers
Enumeration of Set Partitions Refined by Crossing and Nesting Numbers by Wei Chen B.Sc., Rutgers University, 2010 Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Master of
More informationRANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS
RANDOM MATRIX THEORY AND TOEPLITZ DETERMINANTS David García-García May 13, 2016 Faculdade de Ciências da Universidade de Lisboa OVERVIEW Random Matrix Theory Introduction Matrix ensembles A sample computation:
More informationPainlevé Representations for Distribution Functions for Next-Largest, Next-Next-Largest, etc., Eigenvalues of GOE, GUE and GSE
Painlevé Representations for Distribution Functions for Next-Largest, Next-Next-Largest, etc., Eigenvalues of GOE, GUE and GSE Craig A. Tracy UC Davis RHPIA 2005 SISSA, Trieste 1 Figure 1: Paul Painlevé,
More informationJINHO BAIK Department of Mathematics University of Michigan Ann Arbor, MI USA
LIMITING DISTRIBUTION OF LAST PASSAGE PERCOLATION MODELS JINHO BAIK Department of Mathematics University of Michigan Ann Arbor, MI 48109 USA E-mail: baik@umich.edu We survey some results and applications
More informationAiry and Pearcey Processes
Airy and Pearcey Processes Craig A. Tracy UC Davis Probability, Geometry and Integrable Systems MSRI December 2005 1 Probability Space: (Ω, Pr, F): Random Matrix Models Gaussian Orthogonal Ensemble (GOE,
More informationOn Longest Increasing Subsequences and Random Young Tableaux: Experimental Results and Recent Theorems
On Longest Increasing Subsequences and Random Young Tableaux: Experimental Results and Recent Theorems Jon A. Wellner University of Washington April 9, 2002 Abstract Ulam (1961) apparently first posed
More informationRandom Growth and Random Matrices
Random Growth and Random Matrices Kurt Johansson Abstract. We give a survey of some of the recent results on certain two-dimensional random growth models and their relation to random matrix theory, in
More informationReduced words and a formula of Macdonald
Reduced words and a formula of Macdonald Sara Billey University of Washington Based on joint work with: Alexander Holroyd and Benjamin Young preprint arxiv:70.096 Graduate Student Combinatorics Conference
More informationHigh-dimensional permutations
Nogafest, Tel Aviv, January 16 What are high dimensional permutations? What are high dimensional permutations? A permutation can be encoded by means of a permutation matrix. What are high dimensional permutations?
More informationAsymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shapes, and column strict arrays
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 8:, 06, #6 arxiv:50.0890v4 [math.co] 6 May 06 Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard
More informationTableau sequences, open diagrams, and Baxter families
Tableau sequences, open diagrams, and Baxter families Sophie Burrill a, Julien Courtiel a, Eric Fusy b, Stephen Melczer c, Marni Mishna a, a Department of Mathematics, Simon Fraser University, Burnaby,
More informationTowards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs
Towards the Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs MARCOS KIWI Depto. Ing. Matemática and Ctr. Modelamiento Matemático (UMI 2807, CNRS)
More informationA Survey of Alternating Permutations
A Survey of Alternating Permutations Richard P. Stanley Abstract. A permutation a 1 a 2 a n of 1, 2,..., n is alternating if a 1 > a 2 < a 3 > a 4
More informationMaximal height of non-intersecting Brownian motions
Maximal height of non-intersecting Brownian motions G. Schehr Laboratoire de Physique Théorique et Modèles Statistiques CNRS-Université Paris Sud-XI, Orsay Collaborators: A. Comtet (LPTMS, Orsay) P. J.
More informationFluctuations of random tilings and discrete Beta-ensembles
Fluctuations of random tilings and discrete Beta-ensembles Alice Guionnet CRS (E S Lyon) Advances in Mathematics and Theoretical Physics, Roma, 2017 Joint work with A. Borodin, G. Borot, V. Gorin, J.Huang
More informationRandom Curve and Surface
Random Curve and Surface Xin Sun May 14, 2013 Abstract In this project, we use the determinantal process tools to study random partition, which naturally comes from Ulam problem, and explain why random
More informationRow-strict quasisymmetric Schur functions
Row-strict quasisymmetric Schur functions Sarah Mason and Jeffrey Remmel Mathematics Subject Classification (010). 05E05. Keywords. quasisymmetric functions, Schur functions, omega transform. Abstract.
More informationFluctuations of random tilings and discrete Beta-ensembles
Fluctuations of random tilings and discrete Beta-ensembles Alice Guionnet CRS (E S Lyon) Workshop in geometric functional analysis, MSRI, nov. 13 2017 Joint work with A. Borodin, G. Borot, V. Gorin, J.Huang
More informationRectangular Young tableaux and the Jacobi ensemble
Rectangular Young tableaux and the Jacobi ensemble Philippe Marchal October 20, 2015 Abstract It has been shown by Pittel and Romik that the random surface associated with a large rectangular Young tableau
More informationThe goal of this article is twofold:
Integrable Systems and Combinatorial Theory Percy Deift The goal of this article is twofold: to describe the recent solution [BDJ] of a problem in combinatorics using methods from the theory of integrable
More informationDIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO
DIFFERENTIAL POSETS SIMON RUBINSTEIN-SALZEDO Abstract. In this paper, we give a sampling of the theory of differential posets, including various topics that excited me. Most of the material is taken from
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 informationMore about partitions
Partitions 2.4, 3.4, 4.4 02 More about partitions 3 + +, + 3 +, and + + 3 are all the same partition, so we will write the numbers in non-increasing order. We use greek letters to denote partitions, often
More informationMarkov operators, classical orthogonal polynomial ensembles, and random matrices
Markov operators, classical orthogonal polynomial ensembles, and random matrices M. Ledoux, Institut de Mathématiques de Toulouse, France 5ecm Amsterdam, July 2008 recent study of random matrix and random
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 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 informationFactorization of the Robinson-Schensted-Knuth Correspondence
Factorization of the Robinson-Schensted-Knuth Correspondence David P. Little September, 00 Abstract In [], a bijection between collections of reduced factorizations of elements of the symmetric group was
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 informationConcentration Inequalities for Random Matrices
Concentration Inequalities for Random Matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify the asymptotic
More informationRandom sorting networks
Random sorting networks Eric Marberg Math 4991: Capstone Project in Pure Mathematics 1 / 26 Primary reference for this expository talk: Random sorting networks by Angel, Holroyd, Ramik, and Virág (2006)
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 informationExpected Number of Distinct Subsequences in Randomly Gener
Expected Number of Distinct Subsequences in Randomly Generated Strings Yonah Biers-Ariel Anant Godbole Elizabeth Kelley ETSU Rutgers University University of Minnesota Cumberland Conference, Vanderbilt
More informationON THE LIMITING SHAPE OF RANDOM YOUNG TABLEAUX FOR MARKOVIAN WORDS
ON THE LIMITING SHAPE OF RANDOM YOUNG TABLEAUX FOR MARKOVIAN WORDS A Thesis Presented to The Academic Faculty by Trevis J. Litherland In Partial Fulfillment of the Requirements for the Degree Doctor of
More informationYOUNG-JUCYS-MURPHY ELEMENTS
YOUNG-JUCYS-MURPHY ELEMENTS MICAH GAY Abstract. In this lecture, we will be considering the branching multigraph of irreducible representations of the S n, although the morals of the arguments are applicable
More informationTopics in Combinatorics and Random Matrix Theory
Topics in Combinatorics and Random Matrix Theory by Jonathan I. Novak A thesis submitted to the Mathematics and Statistics in conformity with the requirements for the degree of Doctor of Philosophy Queen
More informationNOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET. 1. Basic Definitions
NOTES ABOUT SATURATED CHAINS IN THE DYCK PATH POSET JENNIFER WOODCOCK 1. Basic Definitions Dyck paths are one of the many combinatorial objects enumerated by the Catalan numbers, sequence A000108 in [2]:
More informationTwo Remarks on Skew Tableaux
Two Remarks on Skew Tableaux Richard P. Stanley Department of Mathematics Massachusetts Institute of Technology Cambridge, MA 02139 rstan@math.mit.edu Submitted: 2011; Accepted: 2011; Published: XX Mathematics
More informationTwo Remarks on Skew Tableaux
Two Remarks on Skew Tableaux The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher Stanley, Richard P. "Two
More informationExponential tail inequalities for eigenvalues of random matrices
Exponential tail inequalities for eigenvalues of random matrices M. Ledoux Institut de Mathématiques de Toulouse, France exponential tail inequalities classical theme in probability and statistics quantify
More informationDiscrete tomography, RSK correspondence and Kronecker products
Discrete tomography, RSK correspondence and Kronecker products Instituto de Matemáticas, Unidad Morelia Universidad Nacional Autónoma de México Joint work with Diana Avella-Alaminos Mathematical Foundations
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 informationFredholm determinant with the confluent hypergeometric kernel
Fredholm determinant with the confluent hypergeometric kernel J. Vasylevska joint work with I. Krasovsky Brunel University Dec 19, 2008 Problem Statement Let K s be the integral operator acting on L 2
More informationRecent developments on log-concavity and q-log-concavity of combinatorial polynomials
Recent developments on log-concavity and q-log-concavity of combinatorial polynomials William Y.C. Chen joint work with Cindy C.Y. Gu, Sabrina X.M. Pang, Ellen X.Y. Qu, Robert L. Tang, Carol J. Wang, Larry
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 informationPrimes, partitions and permutations. Paul-Olivier Dehaye ETH Zürich, October 31 st
Primes, Paul-Olivier Dehaye pdehaye@math.ethz.ch ETH Zürich, October 31 st Outline Review of Bump & Gamburd s method A theorem of Moments of derivatives of characteristic polynomials Hypergeometric functions
More informationCylindric Young Tableaux and their Properties
Cylindric Young Tableaux and their Properties Eric Neyman (Montgomery Blair High School) Mentor: Darij Grinberg (MIT) Fourth Annual MIT PRIMES Conference May 17, 2014 1 / 17 Introduction Young tableaux
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 informationNumerical Methods for Random Matrices
Numerical Methods for Random Matrices MIT 18.95 IAP Lecture Series Per-Olof Persson (persson@mit.edu) January 23, 26 1.9.8.7 Random Matrix Eigenvalue Distribution.7.6.5 β=1 β=2 β=4 Probability.6.5.4.4
More informationAlgebra C Numerical Linear Algebra Sample Exam Problems
Algebra C Numerical Linear Algebra Sample Exam Problems Notation. Denote by V a finite-dimensional Hilbert space with inner product (, ) and corresponding norm. The abbreviation SPD is used for symmetric
More informationSix-vertex model partition functions and symmetric polynomials of type BC
Six-vertex model partition functions and symmetric polynomials of type BC Dan Betea LPMA (UPMC Paris 6), CNRS (Collaboration with Michael Wheeler, Paul Zinn-Justin) Iunius XXVI, MMXIV This message is proudly
More informationNUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS. Sheehan Olver NA Group, Oxford
NUMERICAL CALCULATION OF RANDOM MATRIX DISTRIBUTIONS AND ORTHOGONAL POLYNOMIALS Sheehan Olver NA Group, Oxford We are interested in numerically computing eigenvalue statistics of the GUE ensembles, i.e.,
More informationAsymptotic Combinatorics and Algebraic Analysis
Asymptotic Combinatorics and Algebraic Analysis ANATOLY M. VERSHIK* Steklov Mathematical Institute St. Petersburg Branch Fontanka 27, St. Petersburg 191011, Russia 1 Asymptotic problems in combinatorics
More informationStatistical Mechanics and Combinatorics : Lecture IV
Statistical Mechanics and Combinatorics : Lecture IV Dimer Model Local Statistics We ve already discussed the partition function Z for dimer coverings in a graph G which can be computed by Kasteleyn matrix
More informationA Formula for the Specialization of Skew Schur Functions
A Formula for the Specialization of Skew Schur Functions The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationLocal semicircle law, Wegner estimate and level repulsion for Wigner random matrices
Local semicircle law, Wegner estimate and level repulsion for Wigner random matrices László Erdős University of Munich Oberwolfach, 2008 Dec Joint work with H.T. Yau (Harvard), B. Schlein (Cambrigde) Goal:
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 informationLectures 6 7 : Marchenko-Pastur Law
Fall 2009 MATH 833 Random Matrices B. Valkó Lectures 6 7 : Marchenko-Pastur Law Notes prepared by: A. Ganguly We will now turn our attention to rectangular matrices. Let X = (X 1, X 2,..., X n ) R p n
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 informationarxiv: v1 [math.co] 22 Oct 2007
CROSSINGS AND NESTINGS IN TANGLED-DIAGRAMS arxiv:0710.4053v1 [math.co] 22 Oct 2007 WILLIAM Y. C. CHEN, JING QIN AND CHRISTIAN M. REIDYS Abstract. A tangled-diagram is graph of degree less than two whose
More informationShifted symmetric functions I: the vanishing property, skew Young diagrams and symmetric group characters
I: the vanishing property, skew Young diagrams and symmetric group characters Valentin Féray Institut für Mathematik, Universität Zürich Séminaire Lotharingien de Combinatoire Bertinoro, Italy, Sept. 11th-12th-13th
More informationDeterminantal Processes And The IID Gaussian Power Series
Determinantal Processes And The IID Gaussian Power Series Yuval Peres U.C. Berkeley Talk based on work joint with: J. Ben Hough Manjunath Krishnapur Bálint Virág 1 Samples of translation invariant point
More informationHomomesy of Alignments in Perfect Matchings
Homomesy of Alignments in Perfect Matchings Ingrid Zhang under the direction of Sam Hopkins Department of Mathematics Massachusetts Institute of Technology Research Science Institute July 0, 2014 Abstract
More informationMATRIX INTEGRALS AND MAP ENUMERATION 2
MATRIX ITEGRALS AD MAP EUMERATIO 2 IVA CORWI Abstract. We prove the generating function formula for one face maps and for plane diagrams using techniques from Random Matrix Theory and orthogonal polynomials.
More informationCOUNTING NONINTERSECTING LATTICE PATHS WITH TURNS
COUNTING NONINTERSECTING LATTICE PATHS WITH TURNS C. Krattenthaler Institut für Mathematik der Universität Wien, Strudlhofgasse 4, A-1090 Wien, Austria. e-mail: KRATT@Pap.Univie.Ac.At Abstract. We derive
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 information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
More informationSergey Fomin* and. Minneapolis, MN We consider the partial order on partitions of integers dened by removal of
Rim Hook Lattices Sergey Fomin* Department of Mathematics, Massachusetts Institute of Technology Cambridge, MA 02139 Theory of Algorithms Laboratory St. Petersburg Institute of Informatics Russian Academy
More informationDirac Operator. Göttingen Mathematical Institute. Paul Baum Penn State 6 February, 2017
Dirac Operator Göttingen Mathematical Institute Paul Baum Penn State 6 February, 2017 Five lectures: 1. Dirac operator 2. Atiyah-Singer revisited 3. What is K-homology? 4. The Riemann-Roch theorem 5. K-theory
More informationRandom Matrices and Multivariate Statistical Analysis
Random Matrices and Multivariate Statistical Analysis Iain Johnstone, Statistics, Stanford imj@stanford.edu SEA 06@MIT p.1 Agenda Classical multivariate techniques Principal Component Analysis Canonical
More informationBulk scaling limits, open questions
Bulk scaling limits, open questions Based on: Continuum limits of random matrices and the Brownian carousel B. Valkó, B. Virág. Inventiones (2009). Eigenvalue statistics for CMV matrices: from Poisson
More informationExtreme eigenvalue fluctutations for GUE
Extreme eigenvalue fluctutations for GUE C. Donati-Martin 204 Program Women and Mathematics, IAS Introduction andom matrices were introduced in multivariate statistics, in the thirties by Wishart [Wis]
More informationWigner s semicircle law
CHAPTER 2 Wigner s semicircle law 1. Wigner matrices Definition 12. A Wigner matrix is a random matrix X =(X i, j ) i, j n where (1) X i, j, i < j are i.i.d (real or complex valued). (2) X i,i, i n are
More informationCombinatorial Structures
Combinatorial Structures Contents 1 Permutations 1 Partitions.1 Ferrers diagrams....................................... Skew diagrams........................................ Dominance order......................................
More informationEquality: Two matrices A and B are equal, i.e., A = B if A and B have the same order and the entries of A and B are the same.
Introduction Matrix Operations Matrix: An m n matrix A is an m-by-n array of scalars from a field (for example real numbers) of the form a a a n a a a n A a m a m a mn The order (or size) of A is m n (read
More informationInvolutions by Descents/Ascents and Symmetric Integral Matrices. Alan Hoffman Fest - my hero Rutgers University September 2014
by Descents/Ascents and Symmetric Integral Matrices Richard A. Brualdi University of Wisconsin-Madison Joint work with Shi-Mei Ma: European J. Combins. (to appear) Alan Hoffman Fest - my hero Rutgers University
More informationDuality, Statistical Mechanics and Random Matrices. Bielefeld Lectures
Duality, Statistical Mechanics and Random Matrices Bielefeld Lectures Tom Spencer Institute for Advanced Study Princeton, NJ August 16, 2016 Overview Statistical mechanics motivated by Random Matrix theory
More informationREPRESENTATION THEORY WEEK 7
REPRESENTATION THEORY WEEK 7 1. Characters of L k and S n A character of an irreducible representation of L k is a polynomial function constant on every conjugacy class. Since the set of diagonalizable
More informationSL(2) and z-measures. arxiv:math/ v1 [math.rt] 16 Feb Introduction. Andrei Okounkov 1.1
arxiv:math/0002135v1 [math.rt] 16 Feb 2000 1 Introduction SL(2 and z-measures Andrei Okounkov This paper is about the z-measures which are a remarkable two-parametric family of measures on partitions introduced
More informationYoung s Natural Representations of S 4
Young s Natural Representations of S Quinton Westrich arxiv:111.0687v1 [math.rt] Dec 011 December 008 Abstract We calculate all inequivalent irreducible representations of S by specifying the matrices
More informationforms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms
Christopher Engström November 14, 2014 Hermitian LU QR echelon Contents of todays lecture Some interesting / useful / important of matrices Hermitian LU QR echelon Rewriting a as a product of several matrices.
More informationChains of Length 2 in Fillings of Layer Polyominoes
Chains of Length 2 in Fillings of Layer Polyominoes Mitch Phillipson, Catherine H. Yan and Jean Yeh Department of Mathematics Texas A&M University College Station, Texas, U.S.A. {phillipson,cyan,jeanyeh}@math.tamu.edu
More informationMULTI-ORDERED POSETS. Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 7 (2007), #A06 MULTI-ORDERED POSETS Lisa Bishop Department of Mathematics, Occidental College, Los Angeles, CA 90041, United States lbishop@oxy.edu
More informationTwo-periodic Aztec diamond
Two-periodic Aztec diamond Arno Kuijlaars (KU Leuven) joint work with Maurice Duits (KTH Stockholm) Optimal and Random Point Configurations ICERM, Providence, RI, U.S.A., 27 February 2018 Outline 1. Aztec
More informationOn the Longest Common Pattern Contained in Two or More Random Permutations
On the Longest Common Pattern Contained in Two or More andom Permutations arxiv:1402.0137v1 [math.co] 1 Feb 2014 Michael Earnest, University of Southern California Anant Godbole, East Tennessee State University
More informationSymmetric functions and random partitions arxiv:math.co/ v1 4 Sep 2003
Symmetric functions and random partitions arxiv:math.co/0309074 v 4 Sep 003 Andrei Okounkov Abstract These are notes from the lectures I gave at the NATO ASI Symmetric Functions 00 at the Isaac Newton
More informationPattern Avoidance of Generalized Permutations
Pattern Avoidance of Generalized Permutations arxiv:1804.06265v1 [math.co] 17 Apr 2018 Zhousheng Mei, Suijie Wang College of Mathematics and Econometrics Hunan University, Changsha, China. zhousheng@hnu.edu.cn,
More information