Presentation is loading. Please wait.

Presentation is loading. Please wait.

Bijections between 321- and 132-avoiding permutations Sergey Kitaev Reykjavík University This is joint work with.

Similar presentations


Presentation on theme: "Bijections between 321- and 132-avoiding permutations Sergey Kitaev Reykjavík University This is joint work with."— Presentation transcript:

1 Bijections between 321- and 132-avoiding permutations Sergey Kitaev Reykjavík University This is joint work with

2 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Outline of the talk Basic definitions Overview of 9 bijections between 321- and 132-avoiding permutations A recursive description of Knuth-Richards’ bijection Classification of the bijections Statistics preserved by the bijections

3 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Dyck paths Number of Dyck paths of length 2n is the n-th Catalan number

4 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Pattern avoidance contains four occurrences of the pattern avoids the pattern 132 Similarly, one defines 321-, 231-,..., 123-avoiding permutations r(23154)=45132 – reverse operation c(23154)=43512 – complement operation i(23154)=31254 – inverse operation Trivial bijections 1 75

5 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Pattern avoidance n Schematic structure of 132-avoiding n-permutations 231-avoiding permutations are those that can be sorted with one stack Schematic structure of 321-avoiding permutations This is Catalan structure

6 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Pattern avoidance ? Patterns inside the same group are equivalent in the sense of avoidance due to the trivial bijections, but why patterns from different groups need to be avoidance-equivalent? Finding a bijection between the groups of patterns above attracted a lot of attention in the literature.

7 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year The first handheld cell phone call made by Martin Cooper in New York City The Sears Tower in Chicago is finished, becoming the world's tallest building A patent for the ATM is granted to Donald Wetzel, Tom Barnes and George Chastain

8 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Donald Knuth The standard bijection between 132-avoiding permutations and Dyck paths

9 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Robinson-Schensted-Knuth correspondence Bijection between a symmetric group and pairs of standard Young tableaux (P,Q). P- the insertion tableau, Q – the recording tableau

10 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Corresponding Dyck path (U = UP-step; D = DOWN-step): U DUUDUUDUDDUUDDD D-steps U-steps D-steps A permutation avoids 321 implies P,Q have at most two rows standard bijection Output: 132-avoiding pemutation Imput: 321-avoiding permutation Knuth’s bijection reflection UUUDDUUDUDDUDDUD

11 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Bobby Fischer refuses to play in a chess match against Anatoly Karpov, giving Karpov the title The speaker is born in the town of Ulan-Ude The name "Micro-soft" is used by Bill Gates in a letter to Paul Allen for the first time (Microsoft becomes a registered trademark on November 26, 1976)

12 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Donald KnuthDoron Rotem

13 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year : {2,6,7,8} is a sequence of left-to-right maxima

14 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year standard bijection Knuth-Rotem’s bijection 132-avoiding permutation 321-avoiding permutation

15 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year The first British cell phone call is made (by Ernie Wise to Vodafone) Coca-Cola changes its formula and releases New Coke (The response is negative, and the original formula is back on the market in less than 3 months) Microsoft Corporation releases the first version of Windows, Windows 1.0

16 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Rodica SimionFrank W. Schmidt Simion-Schmidt’s bijection

17 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year avoiding perm. 123-avoiding perm.

18 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year The Soviet Union begins its program of economic restructuring (perestroika) initiated by Mikhail Gorbachev Luca Aceto turned 17 years old The Summer Olympic Games are held in Seoul, South Korea

19 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Donald KnuthDana Richards Knuth-Richards’ bijection

20 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Knuth-Richards’ bijection: 132-avoiders 321-avoiders = reverse (algorithm below) (standard bijection)

21 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Austria, Finland and Sweden enter the European Union Microsoft releases Windows 95 Mark Dukes continues his study at the University of Oxford, England

22 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Julian West Avoid 123Avoid 132Signature active site (safe to insert the largest element) Thus corresponds to by West’s bijection

23 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year United States v. Microsoft: The United States Justice Department announces that it no longer seeks to break- up software maker Microsoft, and will instead seek a lesser antitrust penalty Magnús Halldórsson is awarded the Young Scientist Award of RANNIS Microsoft releases Windows XP

24 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Christian Krattenthaler 123-avoiding perm standard bijection avoiding perm. differences between consecutive right-to-left maxima give the runs of down-steps, while their positions give runs of up-steps.

25 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year In the second round of the French presidential election, Jacques Chirac is reelected Anders Claesson visits the University of Waterloo The Mars Odyssey finds signs of huge water ice deposits on the planet Mars

26 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Astrid Reifegerste X X X X X X X X

27 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Saddam Hussein, former President of Iraq, is captured in Tikrit by the U.S. 4th Infantry Division The speaker defends his Ph.D. Einar Steingrímsson becomes an academic father

28 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Sergi ElizaldeEmeric Deutsch

29 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year UDUUUDDUDD UUDUUDDDUD 1(10) X X X X X UUUDDDUDUD 321-avoiding 132-avoiding reflecting the path standard bijection

30 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Anders Claesson defends his Ph.D ICE-TCS is (-1) years old

31 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Sergi Elizalde Igor Pak Essentially use Knuth’s bijection, but apply deepper analysis to prove that the bijection preserves 3 statistics, in particular, fixed points go to fixed points, and excedances go to excedances.

32 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Microsoft publicly releases Windows Internet Explorer 7 Luca Aceto and Anna Ingolfsdottir present ICE-TCS to the staff at Reykjavík University The conference Permutation Patterns 2006 is held at Reykjavík University

33 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Toufik MansourYu-Ping DengRosena Ruon Xia Du

34 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year (8+2)/2 (11+1)/2 (8-2+2)/2 (11-1+2)/2

35 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year (s s s )(s s )(s s s )(s )= (10)9(11) (s s )(s s s )(s s s s s s )(s )= (10)9(11) avoiding 231-avoiding canonical reduced decomposition

36 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year The Valley of Geysers in Russia was destroyed by a mudflow Susanne Albers becomes one of the 2008 Leibniz Prize winners

37 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year Anders ClaessonSK A recursive bijection Φ between 231-avoiding and 321-avoiding permutations is found, but it turns out to be trivially equivalent to Knuth-Richards’ bijection

38 Sergey Kitaev Bijections between 321- and 132-avoiding permutations The year The idea of the recursive bijection Φ: 231-avoiding permutations 321-avoiding permutations reducible case: irreducible case: “Jumping” left-to-right maxima

39 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Classification of the bijections

40 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Classification of the bijections

41 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Classification of the bijections inversereverse = = = Simion-Schmidt inversereverseinverse Krattenthaler inversereverse Mansour-Deng-Du

42 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Classification of the bijections = Knuth-Richards = reverse Φ=Claesson-SK

43 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Classification of the bijections = inverse Also, Knuth-Rotem Reifegerste

44 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest p = asc p = 5 ldr p = 2 lmax p = 4 rmax p = 2 lmin p = 3 comp p = 2

45 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest p = asc p = 5 ldr p = 2 lmax p = 4 rmax p = 2 lmin p = 3 comp p = 2

46 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest p = asc p = 5 ldr p = 2 lmax p = 4 rmax p = 2 lmin p = 3 comp p = 2

47 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest p = asc p = 5 ldr p = 2 lmax p = 4 rmax p = 2 lmin p = 3 comp p = 2

48 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest p = asc p = 5 ldr p = 2 lmax p = 4 rmax p = 2 lmin p = 3 comp p = 2

49 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest p = asc p = 5 ldr p = 2 lmax p = 4 rmax p = 2 lmin p = 3 comp p = 2

50 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest 23 basic statistics each giving rise to 24 statistics

51 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics of interest

52 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics preserved by the bijections

53 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Statistics preserved by the bijections

54 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Concluding remarks

55 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Quiz (related to the talk) Which permutations are involved in the talk? When did Microsoft release Windows 95? When did Coca-Cola change its formula and releases New Coke?

56 Sergey Kitaev Bijections between 321- and 132-avoiding permutations Thank you for your attention and Merry Christmas!


Download ppt "Bijections between 321- and 132-avoiding permutations Sergey Kitaev Reykjavík University This is joint work with."

Similar presentations


Ads by Google