on some properties of permutation tableaux
play

On some properties of permutation tableaux Alexander Burstein Iowa - PowerPoint PPT Presentation

Oct 23, 2023 •758 likes •2.4k views

Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems On some properties of permutation tableaux Alexander Burstein Iowa State University burstein@math.iastate.edu 4th

  1. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Boundary Path Extend the 01/2 boundary to a SW lattice path ( n − k , 0) → (0 , k ) on n steps. Label the path steps 1 through n from NE to SW end. Label the rows and columns with the label of the corresponding step. Label each cell p with its row and column labels ( l r ( p ) , l c ( p )). Note that l c ( p ) > l r ( p ) for every cell p in the tableau. Alex Burstein On some properties of permutation tableaux

  2. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Example Alex Burstein On some properties of permutation tableaux

  3. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Example 20 19 18 17 16 14 12 9 8 4 1 2 3 5 6 7 10 11 13 15 Alex Burstein On some properties of permutation tableaux

  4. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Example 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  5. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T Alex Burstein On some properties of permutation tableaux

  6. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths Alex Burstein On some properties of permutation tableaux

  7. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths start at NW boundary Alex Burstein On some properties of permutation tableaux

  8. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths start at NW boundary salient points at 1s Alex Burstein On some properties of permutation tableaux

  9. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths start at NW boundary salient points at 1s 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  10. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths start at NW boundary salient points at 1s 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  11. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths start at NW boundary salient points at 1s 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  12. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations starting with a tableau T use SE paths start at NW boundary salient points at 1s 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  13. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = Alex Burstein On some properties of permutation tableaux

  14. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = � � 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 Alex Burstein On some properties of permutation tableaux

  15. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = � � 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 Φ is a bijection. Alex Burstein On some properties of permutation tableaux

  16. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = � � 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 Φ is a bijection. How to find Φ − 1 ? Alex Burstein On some properties of permutation tableaux

  17. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = � � 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 Φ is a bijection. How to find Φ − 1 ? Steingr´ ımsson, Williams 2005: Reconstruction of T from π by columns from right to left. Alex Burstein On some properties of permutation tableaux

  18. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = � � 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 Φ is a bijection. How to find Φ − 1 ? Steingr´ ımsson, Williams 2005: Reconstruction of T from π by columns from right to left. Reconstruction by rows from bottom to top is similar. Alex Burstein On some properties of permutation tableaux

  19. Outline Permutation Tableaux Row and Column Decomposition Row and Column Labeling Statistics on Tableaux and Permutations Tableaux and Permutations Essential 1s Open Problems Φ : Tableaux → Permutations π = Φ( T ) = � � 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 Φ is a bijection. How to find Φ − 1 ? Steingr´ ımsson, Williams 2005: Reconstruction of T from π by columns from right to left. Reconstruction by rows from bottom to top is similar. We will reconstruct T from π by columns from left to right (and by rows from top to bottom). Alex Burstein On some properties of permutation tableaux

  20. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Alex Burstein On some properties of permutation tableaux

  21. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Notice that any two SE paths in the tableau may intersect at most once – at their first common point. Alex Burstein On some properties of permutation tableaux

  22. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Notice that any two SE paths in the tableau may intersect at most once – at their first common point. Let i 1 , . . . , i k be the row labels of 1s in the leftmost column. Alex Burstein On some properties of permutation tableaux

  23. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Notice that any two SE paths in the tableau may intersect at most once – at their first common point. Let i 1 , . . . , i k be the row labels of 1s in the leftmost column. Then π ( n ) < π ( i 1 ) < π ( i 2 ) < · · · < π ( i k ) = n ... Alex Burstein On some properties of permutation tableaux

  24. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Notice that any two SE paths in the tableau may intersect at most once – at their first common point. Let i 1 , . . . , i k be the row labels of 1s in the leftmost column. Then π ( n ) < π ( i 1 ) < π ( i 2 ) < · · · < π ( i k ) = n ... ...and for j ∈ ( i r , i r +1 ), π ( j ) < π ( i r ). Alex Burstein On some properties of permutation tableaux

  25. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Notice that any two SE paths in the tableau may intersect at most once – at their first common point. Let i 1 , . . . , i k be the row labels of 1s in the leftmost column. Then π ( n ) < π ( i 1 ) < π ( i 2 ) < · · · < π ( i k ) = n ... ...and for j ∈ ( i r , i r +1 ), π ( j ) < π ( i r ). Hence, π ( i 1 ) , π ( i 2 ) , . . . , π ( i k ) = n are the LR-minima of the subsequence of π on letters greater than π ( n ). Alex Burstein On some properties of permutation tableaux

  26. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Leftmost column We want to find the row labels of 1s in the leftmost column. Notice that any two SE paths in the tableau may intersect at most once – at their first common point. Let i 1 , . . . , i k be the row labels of 1s in the leftmost column. Then π ( n ) < π ( i 1 ) < π ( i 2 ) < · · · < π ( i k ) = n ... ...and for j ∈ ( i r , i r +1 ), π ( j ) < π ( i r ). Hence, π ( i 1 ) , π ( i 2 ) , . . . , π ( i k ) = n are the LR-minima of the subsequence of π on letters greater than π ( n ). If T ′ is T without the leftmost column, then Φ( T ) = Φ( T ′ )( i 1 i 2 . . . i k n ) . Alex Burstein On some properties of permutation tableaux

  27. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if Alex Burstein On some properties of permutation tableaux

  28. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , Alex Burstein On some properties of permutation tableaux

  29. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , c i contains b , Alex Burstein On some properties of permutation tableaux

  30. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , c i contains b , c j contains a < c , Alex Burstein On some properties of permutation tableaux

  31. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , c i contains b , c j contains a < c , a < b < c , Alex Burstein On some properties of permutation tableaux

  32. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , c i contains b , c j contains a < c , a < b < c , then c j also contains b . Alex Burstein On some properties of permutation tableaux

  33. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Column Decomposition The column decomposition of a permutation π is the (unique) representation of π as a product c n − k c n − k − 1 . . . c 1 of increasing cycles c i (1 ≤ i ≤ n − k ) such that maximal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , c i contains b , c j contains a < c , a < b < c , then c j also contains b . This condition is equivalent to the 1-hinge rule for tableaux. Alex Burstein On some properties of permutation tableaux

  34. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = Alex Burstein On some properties of permutation tableaux

  35. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = Alex Burstein On some properties of permutation tableaux

  36. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  37. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  38. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  39. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  40. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  41. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  42. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (2 3 5 6 7 10 11 12)(2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  43. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (3 5 6 7 9)(2 3 5 6 7 10 11 12)(2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  44. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (5 6 7 8)(3 5 6 7 9)(2 3 5 6 7 10 11 12)(2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  45. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 17 7 18 3 8 11 15 5 4 12 13 2 20 6 19 10 16 9 1 14 14 7 17 3 8 11 15 5 4 12 13 2 18 6 19 10 16 9 1 20 1 7 14 3 8 11 15 5 4 12 13 2 17 6 18 10 16 9 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 17 10 16 18 19 20 1 7 9 3 8 11 14 5 4 12 13 2 15 6 16 10 17 18 19 20 1 7 9 3 8 10 11 5 4 12 13 2 14 6 15 16 17 18 19 20 1 6 7 3 8 9 10 5 4 11 12 2 13 14 15 16 17 18 19 20 1 2 6 3 7 8 9 5 4 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 6 7 8 5 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 1 2 4 3 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 π = (3 4)(5 6 7 8)(3 5 6 7 9)(2 3 5 6 7 10 11 12)(2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19) (1 3 13 20) Alex Burstein On some properties of permutation tableaux

  46. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition π = (3 4)(5 6 7 8)(3 5 6 7 9)(2 3 5 6 7 10 11 12)(2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19)(1 3 13 20) Alex Burstein On some properties of permutation tableaux

  47. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Column Decomposition π = (3 4)(5 6 7 8)(3 5 6 7 9)(2 3 5 6 7 10 11 12)(2 3 6 7 10 11 13 14)(6 7 13 15 16)(15 17)(3 7 13 15 18)(1 3 13 15 19)(1 3 13 20) 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  48. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Row Decomposition The row decomposition of a permutation π is the (unique) representation of π as a product c k c k − 1 . . . c 1 of decreasing cycles c i (1 ≤ i ≤ k ) such that minimal elements of c i ’s are distinct from one another and from other elements in c i ’s, and if i < j , c i contains b , c j contains c > a , c > b > a , then c j also contains b . This condition is also equivalent to the 1-hinge rule for tableaux. Alex Burstein On some properties of permutation tableaux

  49. Outline Permutation Tableaux Row and Column Decomposition Statistics on Tableaux and Permutations Essential 1s Open Problems Example of Row Decomposition π = (19 18 17 16 14 15)(20 19 18 16 14 13)(14 12 11)(14 12 10)(18 16 14 12 9 8 7)(16 14 12 9 8 6)(12 9 8 5)(20 19 18 14 12 9 4 3) (14 12 2)(20 19 1) 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  50. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Alignments and Crossings 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Alex Burstein On some properties of permutation tableaux

  51. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Alignments and Crossings 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Intersections: ee , nn , en ( e < n ) Alex Burstein On some properties of permutation tableaux

  52. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Alignments and Crossings 20 19 18 17 16 14 12 9 8 4 • • 1 • • 2 • • • • • • • 3 • • • 5 • • • • • 6 • • • • • • 7 • • 10 • • 11 • • • • • 13 • • • • 15 Intersections: ee , nn , en ( e < n ) Non-intersections: ne ( n < e ) Alex Burstein On some properties of permutation tableaux

  53. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Alignments and Crossings 20 19 18 17 16 14 12 9 8 4 • • 1 nn nn nn nn nn nn nn nn • • 2 ee ee en en en nn nn nn • • • • • • • 3 nn nn nn • • • 5 ee ee en en en en ne • • • • • 6 ee ee en en ne • • • • • • 7 ee ee nn ne • • 10 ee ee ee en en ne ne ne • • 11 ee ee ee en en ne ne ne • • • • • 13 en ne ne ne ne • • • • 15 ee ne ne ne ne ne Intersections: ee , nn , en ( e < n ) Non-intersections: ne ( n < e ) Alex Burstein On some properties of permutation tableaux

  54. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Statistics on Permutation Tableaux Let π = Φ( T ). Define A EE ( π ) = |{ ( i , j ) | j < i ≤ π ( i ) < π ( j ) }| = # ee ( T ) A NN ( π ) = |{ ( i , j ) | π ( j ) < π ( i ) < i < j }| = # nn ( T ) A EN ( π ) = |{ ( i , j ) | j ≤ π ( j ) < π ( i ) < i }| = # en ( T ) A NE ( π ) = |{ ( i , j ) | π ( i ) < i < j ≤ π ( j ) }| = # ne ( T ) = #2s( T ) C EE ( π ) = |{ ( i , j ) | j < i ≤ π ( j ) < π ( i ) }| C NN ( π ) = |{ ( i , j ) | π ( i ) < π ( j ) < i < j }| It can be shown that C EE ( π ) + C NN ( π ) = #nontop 1s( T ) Alex Burstein On some properties of permutation tableaux

  55. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Steingr´ ımsson and Williams define a map Ψ : S n → S n that takes descents (des) and ascents (ndes) to weak excedances (wex) and deficiencies (nwex). Alex Burstein On some properties of permutation tableaux

  56. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Steingr´ ımsson and Williams define a map Ψ : S n → S n that takes descents (des) and ascents (ndes) to weak excedances (wex) and deficiencies (nwex). They show that Ψ has the following properties. If π = Ψ( σ ), then des σ = wex π − 1 (31-2) σ = A EE ( π ) + A NN ( π ) � des σ � (21-3) σ + (3-21) σ − = A EN ( π ) 2 (2-31) σ = C EE ( π ) + C NN ( π ) � des σ � (1-32) σ + (32-1) σ − = A NE ( π ) 2 Alex Burstein On some properties of permutation tableaux

  57. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems This implies: A EN + A NN and C EE + C NN are equidistributed, A EN and A NE are equidistributed. Alex Burstein On some properties of permutation tableaux

  58. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems This implies: A EN + A NN and C EE + C NN are equidistributed, A EN and A NE are equidistributed. To see the latter note that the map i ◦ r ◦ c (inverse of reversal of complement, or reflection across the antidiagonal of the permutation diagram) preserves wex , A EE , A NN , C EE , C NN , and exchanges A EN and A NE . Alex Burstein On some properties of permutation tableaux

  59. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems This implies: A EN + A NN and C EE + C NN are equidistributed, A EN and A NE are equidistributed. To see the latter note that the map i ◦ r ◦ c (inverse of reversal of complement, or reflection across the antidiagonal of the permutation diagram) preserves wex , A EE , A NN , C EE , C NN , and exchanges A EN and A NE . Question: Describe the equivalent (under Φ) of irc on tableaux directly. Alex Burstein On some properties of permutation tableaux

  60. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Catalan tableaux Recall that | S n (2-31) | = | S n (2-3-1) | = C n , the n th Catalan number. Alex Burstein On some properties of permutation tableaux

  61. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Catalan tableaux Recall that | S n (2-31) | = | S n (2-3-1) | = C n , the n th Catalan number. Hence, (SW, 2005) C n is the number of tableaux with no nontop 1s (i.e. with a single 1 per column). Alex Burstein On some properties of permutation tableaux

  62. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Catalan tableaux Theorem If a tableau T has a single 1 per column, and π = Φ( T ) , then (the underlying sets of) the cycles of π form a noncrossing partition. Alex Burstein On some properties of permutation tableaux

  63. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Catalan tableaux Theorem If a tableau T has a single 1 per column, and π = Φ( T ) , then (the underlying sets of) the cycles of π form a noncrossing partition. Proof. T has a single 1 per column, so no element of π may occur in more than one cycle of its row decomposition. Suppose π contains two cycles c i and c j and elements a > b > c > d such that a , c are in c i and b , d are in c j . Alex Burstein On some properties of permutation tableaux

  64. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Catalan tableaux Theorem If a tableau T has a single 1 per column, and π = Φ( T ) , then (the underlying sets of) the cycles of π form a noncrossing partition. Proof. T has a single 1 per column, so no element of π may occur in more than one cycle of its row decomposition. Suppose π contains two cycles c i and c j and elements a > b > c > d such that a , c are in c i and b , d are in c j . If i < j , then c j contains c . If i > j , then c i contains b . Neither is possible. Alex Burstein On some properties of permutation tableaux

  65. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Catalan tableaux Theorem If a tableau T has a single 1 per column, and π = Φ( T ) , then (the underlying sets of) the cycles of π form a noncrossing partition. Proof. T has a single 1 per column, so no element of π may occur in more than one cycle of its row decomposition. Suppose π contains two cycles c i and c j and elements a > b > c > d such that a , c are in c i and b , d are in c j . If i < j , then c j contains c . If i > j , then c i contains b . Neither is possible. Thus, the c i ’s form a noncrossing partition. Alex Burstein On some properties of permutation tableaux

  66. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Alex Burstein On some properties of permutation tableaux

  67. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Note that A EE ( T ) = A NN ( T ) = 0 for monotone T . Alex Burstein On some properties of permutation tableaux

  68. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Note that A EE ( T ) = A NN ( T ) = 0 for monotone T . Let π = Φ( T ) and let σ = Ψ − 1 ( π ). Alex Burstein On some properties of permutation tableaux

  69. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Note that A EE ( T ) = A NN ( T ) = 0 for monotone T . Let π = Φ( T ) and let σ = Ψ − 1 ( π ). Then σ avoids 31-2 (i.e. 3-1-2). Alex Burstein On some properties of permutation tableaux

  70. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Note that A EE ( T ) = A NN ( T ) = 0 for monotone T . Let π = Φ( T ) and let σ = Ψ − 1 ( π ). Then σ avoids 31-2 (i.e. 3-1-2). Note that the subsequences of weak excedance values of π and deficiency values of π are increasing. Alex Burstein On some properties of permutation tableaux

  71. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Note that A EE ( T ) = A NN ( T ) = 0 for monotone T . Let π = Φ( T ) and let σ = Ψ − 1 ( π ). Then σ avoids 31-2 (i.e. 3-1-2). Note that the subsequences of weak excedance values of π and deficiency values of π are increasing. Hence, π avoids 3-2-1. Alex Burstein On some properties of permutation tableaux

  72. Outline Permutation Tableaux Alignments and Crossings vs. Pattern Statistics Row and Column Decomposition Catalan tableaux Statistics on Tableaux and Permutations Monotone tableaux Essential 1s Open Problems Monotone tableaux A monotone tableau is one that has no 0 below or to the right of any 1. Note that A EE ( T ) = A NN ( T ) = 0 for monotone T . Let π = Φ( T ) and let σ = Ψ − 1 ( π ). Then σ avoids 31-2 (i.e. 3-1-2). Note that the subsequences of weak excedance values of π and deficiency values of π are increasing. Hence, π avoids 3-2-1. Theorem S n (31 - 2) Ψ → S n (3 - 2 - 1) Φ ← monotone tableaux of semiperimeter n. Alex Burstein On some properties of permutation tableaux

  73. Outline Permutation Tableaux Row and Column Decomposition Distribution Statistics on Tableaux and Permutations Bare Tableaux Essential 1s Open Problems Definition Essential 1s – Alex Burstein On some properties of permutation tableaux

  74. Outline Permutation Tableaux Row and Column Decomposition Distribution Statistics on Tableaux and Permutations Bare Tableaux Essential 1s Open Problems Definition Essential 1s – leftmost 1s in their rows Alex Burstein On some properties of permutation tableaux

  75. Outline Permutation Tableaux Row and Column Decomposition Distribution Statistics on Tableaux and Permutations Bare Tableaux Essential 1s Open Problems Definition Essential 1s – leftmost 1s in their rows or topmost 1s in their columns. Alex Burstein On some properties of permutation tableaux

  76. Outline Permutation Tableaux Row and Column Decomposition Distribution Statistics on Tableaux and Permutations Bare Tableaux Essential 1s Open Problems Definition Essential 1s – leftmost 1s in their rows or topmost 1s in their columns. Doubly essential 1s – Alex Burstein On some properties of permutation tableaux

  77. Outline Permutation Tableaux Row and Column Decomposition Distribution Statistics on Tableaux and Permutations Bare Tableaux Essential 1s Open Problems Definition Essential 1s – leftmost 1s in their rows or topmost 1s in their columns. Doubly essential 1s – leftmost 1s in their rows Alex Burstein On some properties of permutation tableaux

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

A bijection between EW tableaux and permutation tableaux Thomas Selig joint work with Jason

A bijection between EW tableaux and permutation tableaux Thomas Selig joint work with Jason

A bijection between EW tableaux and permutation tableaux Thomas Selig joint work with Jason Smith and Einar Steingr msson SLC 78, Ottrott 28 March, 2017 Thomas Selig EW tableaux and permutation tableaux Ferrers diagram Definition A

660 views • 62 slides
Statistics on permutation tableaux Pawel Hitczenko Drexel University parts based on joint work

Statistics on permutation tableaux Pawel Hitczenko Drexel University parts based on joint work

Statistics on permutation tableaux Pawel Hitczenko Drexel University parts based on joint work with Sylvie Corteel (Paris-Sud) and parts with Svante Janson (Uppsala) LIPN, February 5, 2008 Permutation tableaux Permutation tableau T : a Ferrers

1.11k views • 50 slides
Patterns in Standard Young Tableaux Sara Billey University of Washington Slides:

Patterns in Standard Young Tableaux Sara Billey University of Washington Slides:

Patterns in Standard Young Tableaux Sara Billey University of Washington Slides: math.washington.edu/billey/talks Based on joint work with: Matja z Konvalinka and Joshua Swanson Permutation Patterns Conference July 10, 2018 Outline

892 views • 73 slides
Clausal Tableaux and Linear Strategies In Clausal Tableaux all sentences are clauses.

Clausal Tableaux and Linear Strategies In Clausal Tableaux all sentences are clauses.

10ai Clausal Tableaux and Linear Strategies In Clausal Tableaux all sentences are clauses. Clause Extension rule is derived from free variable -rule and -splitting. eg using Q(y) P(x,y) R(x) AUTOMATED REASONING Closure

70 views • 5 slides
Operator algebraic properties for free wreath products by quantum permutation groups -Conf

Operator algebraic properties for free wreath products by quantum permutation groups -Conf

Fusion rules for free wreath products Operator algebraic properties for free wreath products by quantum permutation groups -Conf erence du GDRE Noncommutative Geometry and Applications- Fran cois Lemeux (part. joint work with Pierre

326 views • 19 slides
Clausal Tableaux and Linear Strategies Clausal Tableaux use only clausal sentences Clause

Clausal Tableaux and Linear Strategies Clausal Tableaux use only clausal sentences Clause

10ai Clausal Tableaux and Linear Strategies Clausal Tableaux use only clausal sentences Clause Extension rule is derived from free variable -rule and -splitting. eg using Q(y) P(x,y) R(x) AUTOMATED REASONING Closure rule

389 views • 7 slides
J , the all- 1 matrix. (The corresponding only G -invariant association scheme is the trivial A

J , the all- 1 matrix. (The corresponding only G -invariant association scheme is the trivial A

Association schemes and Permutation groups permutation groups Let G be a permutation group on . Then the characteristic functions of the orbits of G on Peter J Cameron G

44 views • 3 slides
Distribution of Symbols in Weighted Random Staircase Tableaux Pawe l Hitczenko based on a

Distribution of Symbols in Weighted Random Staircase Tableaux Pawe l Hitczenko based on a

Distribution of Symbols in Weighted Random Staircase Tableaux Pawe l Hitczenko based on a joint work, one with S. Janson (Uppsala U., Sweden), another with A. Parshall (Drexel) May 12, 2014 Staircase tableaux (Corteel-Williams (2009))

719 views • 56 slides
The diameter of permutation groups permutation groups H. A. Helfgott February 2017 The

The diameter of permutation groups permutation groups H. A. Helfgott February 2017 The

The diameter of permutation groups H. A. Helfgott Introduction Diameter bounds New work on The diameter of permutation groups permutation groups H. A. Helfgott February 2017 The diameter of Cayley graphs permutation groups H. A.

751 views • 64 slides
Outline of this lecture An introduction to Automated Reasoning with Analytic Tableaux; Today we

Outline of this lecture An introduction to Automated Reasoning with Analytic Tableaux; Today we

Outline of this lecture An introduction to Automated Reasoning with Analytic Tableaux; Today we will be looking into tableau methods for classical propositional logic (well discuss first-order tableaux later). Mathematical Logic Analytic

392 views • 11 slides
3. Tablo algoritms 16.12 Tablo (tableaux) metodi 1955.gad izgudroja Evert Willem Beth

3. Tablo algoritms 16.12 Tablo (tableaux) metodi 1955.gad izgudroja Evert Willem Beth

3. Tablo algoritms 16.12 Tablo (tableaux) metodi 1955.gad izgudroja Evert Willem Beth (1908-1964), plaka biogrfija un portrets. Sk. ar Method of analytic tableaux (Wikipedia). metode risina to pau uzdevumu, ko rezolciju metode

494 views • 27 slides
Classic-like Analytic Tableaux for Non-Classical Logics Joo Marcos UFRN, BR &amp; RUB, DE

Classic-like Analytic Tableaux for Non-Classical Logics Joo Marcos UFRN, BR &amp; RUB, DE

Classic-like Analytic Tableaux for Non-Classical Logics Joo Marcos UFRN, BR &amp; RUB, DE PhDs in Logic IX Bochum 24 May 2017 Tableaux Classical Logic More on finite-valued logics A Non-classical example Through Suszko Reduction

1.37k views • 112 slides
Completeness of Resolution using Tableaux A2ai Example . Given: B M, M L,

Completeness of Resolution using Tableaux A2ai Example . Given: B M, M L,

Completeness of Resolution using Tableaux A2ai Example . Given: B M, M L, M L B, B R, R A: Form a tableau such that B: Each clause with no literal occurs twice in a branch, and leaf nodes only can

378 views • 5 slides
Young tableaux and snakes Yuliy Baryshnikov joint work with Dan Romik (Hebrew University)

Young tableaux and snakes Yuliy Baryshnikov joint work with Dan Romik (Hebrew University)

Young tableaux and snakes Yuliy Baryshnikov joint work with Dan Romik (Hebrew University) Motivation A Young tableaux is a filling of Young diagram consisting of n boxes with numbers 1 , . . . , n increasing top-to-down and left-to-right. 1

731 views • 72 slides
Mathematical Logic Propositional Logic -Tableaux * Fausto Giunchiglia and Mattia Fumagalli

Mathematical Logic Propositional Logic -Tableaux * Fausto Giunchiglia and Mattia Fumagalli

Mathematical Logic Propositional Logic -Tableaux * Fausto Giunchiglia and Mattia Fumagalli University of Trento *Originally by Luciano Serafini and Chiara Ghidini Modified by Fausto Giunchiglia and Mattia Fumagalli 0 Tableaux Early work by

612 views • 29 slides
An Extension to Basic ME Tableaux (1) 11ai Example Given: 1. Rx Px, 2. Px Q, 3.

An Extension to Basic ME Tableaux (1) 11ai Example Given: 1. Rx Px, 2. Px Q, 3.

An Extension to Basic ME Tableaux (1) 11ai Example Given: 1. Rx Px, 2. Px Q, 3. Ra Rb, 4. Q Standard ME Tableau Resolution Refutation (5 = 2+1): Rx Q AUTOMATED REASONING (6 = 5+3): Rb Q Q Px1 Pa (7 =

566 views • 8 slides
MA/CSSE 473 Day 16 Combinatorial Object Generation Permutations MA/CSSE 473 Day 16 No new

MA/CSSE 473 Day 16 Combinatorial Object Generation Permutations MA/CSSE 473 Day 16 No new

MA/CSSE 473 Day 16 Combinatorial Object Generation Permutations MA/CSSE 473 Day 16 No new announcements Student Questions Combinatorial Object Generation Intro Permutation generation Q1 Permutations Subsets

450 views • 15 slides
Radial velocities amateur measures Exoplanets and double stars CAPAS 2012 Christian Buil Two

Radial velocities amateur measures Exoplanets and double stars CAPAS 2012 Christian Buil Two

Radial velocities amateur measures Exoplanets and double stars CAPAS 2012 Christian Buil Two objects linked by gravity r m Rotation around commun center of gravity R M Rotation velocity of Sun relative to the Solar system gravity center =

559 views • 38 slides
Theory and applications 1 Roadmap 1. Post-processing and analysis of turbulent simulations 2

Theory and applications 1 Roadmap 1. Post-processing and analysis of turbulent simulations 2

Turbulence and CFD models: Theory and applications 1 Roadmap 1. Post-processing and analysis of turbulent simulations 2 Post-processing and analysis of turbulent simulations General remarks Post-processing turbulent simulations can be

415 views • 25 slides
The slowly pulsating B-star 18 Peg: A testbed for upper main sequence stellar evolution A.

The slowly pulsating B-star 18 Peg: A testbed for upper main sequence stellar evolution A.

The slowly pulsating B-star 18 Peg: A testbed for upper main sequence stellar evolution A. Irrgang 1 . De Cat 2 A. Tkachenko 3 C. Aerts 3 P A. Desphande 4 S. Moehler 5 M. Mugrauer 6 D. Janousch 7 1 Dr. Karl Remeis-Observatory Bamberg &amp; ECAP

449 views • 20 slides
Permutation Covers Charles J. Colbourn School of Computing, Informatics, and Decision Systems

Permutation Covers Charles J. Colbourn School of Computing, Informatics, and Decision Systems

Permutation Covers Charles J. Colbourn Permutation Covers Charles J. Colbourn School of Computing, Informatics, and Decision Systems Engineering Arizona State University Workshop on Graphs and Algorithms, Fields Institute, May 2014

411 views • 15 slides
Packing patterns in restricted permutations Lara Pudwell faculty.valpo.edu/lpudwell 17th

Packing patterns in restricted permutations Lara Pudwell faculty.valpo.edu/lpudwell 17th

Introduction Packing with Classical Restrictions Packing in Alternating Permutations Wrapping up Packing patterns in restricted permutations Lara Pudwell faculty.valpo.edu/lpudwell 17th International Conference on Permutation Patterns

683 views • 52 slides
Polyas Theory of Counting Generating Functions Polyas Theory of Counting Example 1 A disc

Polyas Theory of Counting Generating Functions Polyas Theory of Counting Example 1 A disc

Polyas Theory of Counting Generating Functions Polyas Theory of Counting Example 1 A disc lies in a plane. Its centre is fixed but it is free to rotate. It has been divided into n sectors of angle 2 / n . Each sector is to be colored Red

558 views • 32 slides
Quarter Turn Baxter Permutations Kevin Dilks North Dakota State University June 26, 2017 Kevin

Quarter Turn Baxter Permutations Kevin Dilks North Dakota State University June 26, 2017 Kevin

Background Generating Trees Quarter Turn Baxter Permutations Kevin Dilks North Dakota State University June 26, 2017 Kevin Dilks Quarter Turn Baxter Permutations Background Generating Trees Outline Background 1 Generating Trees 2

1.07k views • 58 slides

More recommend