enumerating permutations sortable by k passes through a
play

Enumerating permutations sortable by k passes through a pop-stack - PowerPoint PPT Presentation

Oct 21, 2022 •346 likes •1.23k views

Enumerating permutations sortable by k passes through a pop-stack Anders Claesson Bjarki gst Gumundsson University of Iceland 1 / 20 Theorem (Knuth, 1968) 3124 A permutation is sortable by a stack if and only if avoids 231 .

  1. Enumerating permutations sortable by k passes through a pop-stack Anders Claesson Bjarki Ágúst Guðmundsson University of Iceland 1 / 20

  2. Theorem (Knuth, 1968) 3124 A permutation π is sortable by a stack if and only if π avoids 231 . Theorem (Avis & Newborn, 1981) 3124 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 2 / 20

  3. Theorem (Knuth, 1968) 124 A permutation π is sortable by a stack if and only if π avoids 231 . 3 Theorem (Avis & Newborn, 1981) 124 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 3 2 / 20

  4. Theorem (Knuth, 1968) 24 A permutation π is sortable by a stack 1 if and only if π avoids 231 . 3 Theorem (Avis & Newborn, 1981) 24 A permutation π is sortable by a pop-stack 1 if and only if π avoids 231 and 321 . 3 2 / 20

  5. Theorem (Knuth, 1968) 1 24 A permutation π is sortable by a stack if and only if π avoids 231 . 3 Theorem (Avis & Newborn, 1981) 13 24 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 2 / 20

  6. Theorem (Knuth, 1968) 1 4 A permutation π is sortable by a stack 2 if and only if π avoids 231 . 3 Theorem (Avis & Newborn, 1981) 13 4 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 2 2 / 20

  7. Theorem (Knuth, 1968) 12 4 A permutation π is sortable by a stack if and only if π avoids 231 . 3 Theorem (Avis & Newborn, 1981) 132 4 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 2 / 20

  8. Theorem (Knuth, 1968) 123 4 A permutation π is sortable by a stack if and only if π avoids 231 . Theorem (Avis & Newborn, 1981) 132 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 4 2 / 20

  9. Theorem (Knuth, 1968) 123 A permutation π is sortable by a stack if and only if π avoids 231 . 4 Theorem (Avis & Newborn, 1981) 1324 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 2 / 20

  10. Theorem (Knuth, 1968) 1234 A permutation π is sortable by a stack if and only if π avoids 231 . Theorem (Avis & Newborn, 1981) 1324 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . 2 / 20

  11. Theorem (Knuth, 1968) 1234 A permutation π is sortable by a stack if and only if π avoids 231 . Theorem (Avis & Newborn, 1981) 1324 A permutation π is sortable by a pop-stack if and only if π avoids 231 and 321 . Theorem (Pudwell & Smith, 2017) A permutation π is sortable by two passes through a pop-stack if and only if π avoids 2341 , 3412 , 3421 , 4123 , 4231 , 4312 , 4¯ 1352 and 413¯ 52 . 2 / 20

  12. Theorem (Knuth, 1968) √ 1 − 1 − 4 x A permutation π is sortable by a stack if and only if π avoids 231 . 2 x Theorem (Avis & Newborn, 1981) A permutation π is sortable by a pop-stack x − 1 if and only if π avoids 231 and 321 . 2 x − 1 Theorem (Pudwell & Smith, 2017) A permutation π is sortable by two passes x 3 + x 2 + x − 1 through a pop-stack if and only if π avoids 2 x 3 + x 2 + 2 x − 1 2341 , 3412 , 3421 , 4123 , 4231 , 4312 , 4¯ 1352 and 413¯ 52 . 2 / 20

  13. Stacks vs pop-stacks A stack is a LIFO data structure with two operations: ◮ Push: Add an element to the top of the stack. ◮ Pop: Remove the top-most element from the stack. A pop-stack is a LIFO data structure with two operations: ◮ Push: Add an element to the top of the stack. ◮ Pop: Remove all elements from the stack. We’ll insist that elements on the stack are increasing when read from top to bottom and sort greedily w.r.t. the push operation. 3 / 20

  14. How many permutations are sortable by k passes through a pop-stack? x − 1 k = 1 2 x − 1 x 3 + x 2 + x − 1 k = 2 2 x 3 + x 2 + 2 x − 1 k ≥ 3 Rational? 4 / 20

  15. 5 1 2 4 7 8 6 3 9 5 / 20

  16. 5 1 2 4 7 8 6 3 9 5 / 20

  17. 5 1 2 4 7 8 6 3 9 5 / 20

  18. 5 1 2 4 7 8 6 3 9 1 5 5 / 20

  19. 5 1 2 4 7 8 6 3 9 1 5 5 / 20

  20. 5 1 2 4 7 8 6 3 9 1 5 2 5 / 20

  21. 5 1 2 4 7 8 6 3 9 1 5 2 5 / 20

  22. 5 1 2 4 7 8 6 3 9 1 5 2 4 5 / 20

  23. 5 1 2 4 7 8 6 3 9 1 5 2 4 5 / 20

  24. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 5 / 20

  25. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 5 / 20

  26. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 5 / 20

  27. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 5 / 20

  28. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 5 / 20

  29. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 5 / 20

  30. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 5 / 20

  31. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 5 / 20

  32. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 5 / 20

  33. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 5 / 20

  34. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 5 / 20

  35. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 5 / 20

  36. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 5 / 20

  37. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 5 / 20

  38. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 5 / 20

  39. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 5 / 20

  40. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 5 / 20

  41. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 5 / 20

  42. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 5 / 20

  43. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 5 / 20

  44. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 5 / 20

  45. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 5 / 20

  46. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 5 / 20

  47. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 5 / 20

  48. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 5 / 20

  49. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 5 / 20

  50. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 5 / 20

  51. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 5 / 20

  52. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 5 / 20

  53. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 5 / 20

  54. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 5 / 20

  55. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 5 / 20

  56. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 5 / 20

  57. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 6 7 5 / 20

  58. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 6 7 5 / 20

  59. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 6 7 8 5 / 20

  60. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 6 7 8 5 / 20

  61. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 6 7 8 9 5 / 20

  62. 5 1 2 4 7 8 6 3 9 1 5 2 4 7 3 6 8 9 1 2 5 4 3 7 6 8 9 1 2 3 4 5 6 7 8 9 ◮ A sorting trace of length 9 and order 3. ◮ Numbers within a block are in decreasing order. ◮ Adjacent numbers in different blocks form an ascent. ◮ Each perm is the “blockwise reversal” of the one above. ◮ The last permutation is the identity. 5 / 20

  63. 7 5 2 4 9 1 8 6 3 2 5 7 4 1 9 3 6 8 2 5 1 4 7 3 9 6 8 2 1 5 4 3 7 6 9 8 1 2 3 4 5 6 7 8 9 A sorting trace Its sorting plan a d d a a d a d d a a a a d d a d a a a 0 , 9 , 10 , 5 , 5 , 10 , 5 , 10 , 9 , 0 a a d a a d a d a a a d a d d a d a d a The same sorting plan . . . and its encoding 6 / 20

  64. 7 5 2 4 9 1 8 6 3 2 5 7 4 1 9 3 6 8 2 5 1 4 7 3 9 6 8 2 1 5 4 3 7 6 9 8 1 2 3 4 5 6 7 8 9 A sorting trace Its sorting plan 0 1 1 0 0 1 0 1 1 0 0 0 0 1 1 0 1 0 0 0 0 , 9 , 10 , 5 , 5 , 10 , 5 , 10 , 9 , 0 0 0 1 0 0 1 0 1 0 0 0 1 0 1 1 0 1 0 1 0 The same sorting plan . . . and its encoding 6 / 20

  65. Basic bijections k -pop-stack-sortable permutations sort using pop-stack take topmost permutation sorting traces drop numbers append id, then blockwise rev. sorting plans Bijection between k -pop-stack-sortable permutations of [ n ] and sorting plans of length n and order k 7 / 20

  66. An operation array of length 9 and order 3: 8 / 20

  67. An operation array of length 9 and order 3: ◮ Assume there is a sorting trace with this operation array. 8 / 20

  68. An operation array of length 9 and order 3: 1 2 3 4 5 6 7 8 9 ◮ Assume there is a sorting trace with this operation array. ◮ The last permutation must be the identity. 8 / 20

Recommend

Permutations sortable by deques and by two stacks in parallel. Andrew Elvey Price Joint work

Permutations sortable by deques and by two stacks in parallel. Andrew Elvey Price Joint work

Permutations sortable by deques and by two stacks in parallel. Andrew Elvey Price Joint work with Tony Guttmann The University of Melbourne June 29, 2017 Permutations sortable by deques and by two stacks in parallel. Andrew Elvey Price S TACK

1.2k views • 101 slides
Enumerating Anchored Permutations with Bounded Gaps Maria Monks Gillespie, CSU Ken G. Monks,

Enumerating Anchored Permutations with Bounded Gaps Maria Monks Gillespie, CSU Ken G. Monks,

Enumerating Anchored Permutations with Bounded Gaps Maria Monks Gillespie, CSU Ken G. Monks, University of Scranton Ken M. Monks, Front Range Community College Rocky Mountain Algebraic Combinatorics Seminar Nov 15, 2019 Classical stair

741 views • 49 slides
Fighting fish and two-stack sortable permutations Wenjie Fang, TU Graz 8 May 2018, University of

Fighting fish and two-stack sortable permutations Wenjie Fang, TU Graz 8 May 2018, University of

Fighting fish Permutations Bijection Discussion Fighting fish and two-stack sortable permutations Wenjie Fang, TU Graz 8 May 2018, University of Vienna 1 / 25 Fighting fish Permutations Bijection Discussion Fighting fish A fighting fish

683 views • 42 slides
Local convergence for random permutations The case of uniform pattern-avoiding permutations

Local convergence for random permutations The case of uniform pattern-avoiding permutations

Local convergence for random permutations The case of uniform pattern-avoiding permutations Jacopo Borga, Institut fr Mathematik, Universitt Zrich July 9, 2018 Dartmouth College, Hanover, New Hampshire Our goal 1. Scaling limits: Our

2.18k views • 175 slides
JUST THE MATHS SLIDES NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by

JUST THE MATHS SLIDES NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by

JUST THE MATHS SLIDES NUMBER 19.2 PROBABILITY 2 (Permutations and combinations) by A.J.Hobson 19.2.1 Introduction 19.2.2 Rules of permutations and combinations 19.2.3 Permutations of sets with some objects alike UNIT 19.2 -

400 views • 11 slides
Representing permutations without permutations The expressive power of sequential intersection

Representing permutations without permutations The expressive power of sequential intersection

Representing permutations without permutations The expressive power of sequential intersection Pierre VIAL Equipe Gallinette Inria (LS2N CNRS) June 10, 2018 Non-idempotent typing P. Vial 0 1 /33 Outline Non-idempotent Rigid vs.

1.4k views • 123 slides
Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents.

Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents.

Posets and Permutations in the Duplication-Loss Model: Minimal Permutations with d Descents. Mathilde Bouvel Elisa Pergola GASCom 2008 liafa Definitions Duplication-Loss Characterization Posets Enumeration Conclusion Outline of the talk 1

620 views • 31 slides
A Note on 5-bit Quadratic Permutations Classification Duan Boilov Begl Bilgin Hac

A Note on 5-bit Quadratic Permutations Classification Duan Boilov Begl Bilgin Hac

A Note on 5-bit Quadratic Permutations Classification Duan Boilov Begl Bilgin Hac Ali ahin March 6, 2017 Motivation 2/14 Permutations are main nonlinear part of symmetric primitives Quadratic permutations can be used to

381 views • 22 slides
Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. 1

Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. 1

Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. 1 Definitions A sequence a 1 , a 2 , . . . , a k of distinct integers is alternating if a 1 > a 2 < a 3 > a 4 < , and reverse alternating if

1.14k views • 98 slides
What is a Transit? A transit is when a planet passes directly between the Earth and the Sun

What is a Transit? A transit is when a planet passes directly between the Earth and the Sun

What is a Transit? A transit is when a planet passes directly between the Earth and the Sun The solar eclipse is when the Moon passes between Earth and Sun and partially to totally blocks out Sun Venus and Mercury are the only planets

198 views • 15 slides
Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. 1 Basic

Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. 1 Basic

Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. 1 Basic definitions A sequence a 1 , a 2 , . . . , a k of distinct integers is alternating if a 1 > a 2 < a 3 > a 4 < , and reverse

1.59k views • 119 slides
Enumerating All Solutions for Constraint Satisfaction Problems Henning Schnoor Ilka Schnoor

Enumerating All Solutions for Constraint Satisfaction Problems Henning Schnoor Ilka Schnoor

Enumerating All Solutions for Constraint Satisfaction Problems Henning Schnoor Ilka Schnoor Institut f ur Theoretische Informatik Leibniz Universit at Hannover Aachen, 24.2.2007 Enumerating All Solutions for Constraint Satisfaction

883 views • 43 slides
Random permutations with logarithmic cycle Random permutations weights Classical measures The

Random permutations with logarithmic cycle Random permutations weights Classical measures The

Random permutations with logarithmic cycle weights Setting the scene Random permutations with logarithmic cycle Random permutations weights Classical measures The weighted measure The cycle counts C m Dirk Zeindler The cycle containing

1.6k views • 149 slides
Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic

Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic

Alternating Permutations Richard P. Stanley M.I.T. Alternating Permutations p. Basic definitions A sequence a 1 , a 2 , . . . , a k of distinct integers is alternating if a 1 > a 2 < a 3 > a 4 < , and reverse alternating

1.4k views • 119 slides
A Boolean Model for Enumerating Minimal Siphons and Traps in Petri nets Faten Nabli , Franois

A Boolean Model for Enumerating Minimal Siphons and Traps in Petri nets Faten Nabli , Franois

A Boolean Model for Enumerating Minimal Siphons and Traps in Petri nets Faten Nabli , Franois Fages, Thierry Martinez, and Sylvain Soliman (PhD thesis) Wednesday 10 October, CP2012 A Boolean Model for Enumerating Minimal Siphons and

242 views • 23 slides
On enumerating the kernels in a bipolar valued digraph Raymond Bisdorff University of Luxembourg

On enumerating the kernels in a bipolar valued digraph Raymond Bisdorff University of Luxembourg

Kernels in bipolar-valued digraphs Enumerating kernels in crisp digraphs Solving the bipolar-valued case Conclusion On enumerating the kernels in a bipolar valued digraph Raymond Bisdorff University of Luxembourg Paris, Saturday, October 28,

1.41k views • 128 slides
Algorithms and Pattern Avoiding Permutations Mikl os B ona Department of Mathematics

Algorithms and Pattern Avoiding Permutations Mikl os B ona Department of Mathematics

Algorithms and Pattern Avoiding Permutations Mikl os B ona Department of Mathematics University of Florida Gainesville FL 32611-8105 bona@ufl.edu May 27, 2013 Permutations A permutation is an arrangement of the integers { 1 , 2 ,

573 views • 40 slides
Some 1 n generalized grid classes are context-free Robert Brignall Jakub Slia can

Some 1 n generalized grid classes are context-free Robert Brignall Jakub Slia can

Some 1 n generalized grid classes are context-free Robert Brignall Jakub Slia can Permutation Patterns 2018 1 / 28 View permutations as drawings 9 8 7 6 635814972 5 4 3 2 1 1 2 3 4 5 6 7 8 9 2 / 28 Enumerating

340 views • 32 slides
Enumerating (restricted) -terms Motzkin trees -terms with bounded number of Danile

Enumerating (restricted) -terms Motzkin trees -terms with bounded number of Danile

Enumerating (restricted) -terms Danile GARDY Enriched trees Enumerating (restricted) -terms Motzkin trees -terms with bounded number of Danile GARDY unary nodes -terms of bounded PRiSM, Universit Versailles St-Quentin en

688 views • 39 slides
Enumerating Eulerian Orientations. Andrew Elvey Price Joint work with Tony Guttmann and Mireille

Enumerating Eulerian Orientations. Andrew Elvey Price Joint work with Tony Guttmann and Mireille

Enumerating Eulerian Orientations. Andrew Elvey Price Joint work with Tony Guttmann and Mireille Bousquet-Melou The University of Melbourne 20/11/2017 Enumerating Eulerian Orientations. Andrew Elvey Price R OOTED PLANAR E ULERIAN ORIENTATIONS

1.32k views • 130 slides
MATH 105: Finite Mathematics 6-4: Permutations Prof. Jonathan Duncan Walla Walla College Winter

MATH 105: Finite Mathematics 6-4: Permutations Prof. Jonathan Duncan Walla Walla College Winter

Types of Permutations Factorials Applications of Permutations Conclusion MATH 105: Finite Mathematics 6-4: Permutations Prof. Jonathan Duncan Walla Walla College Winter Quarter, 2006 Types of Permutations Factorials Applications of

959 views • 62 slides
s II, Acta Math. Acad. Sci. Hungar. 18 (1967), s S 151164; III, ibid. 18 (1967),

s II, Acta Math. Acad. Sci. Hungar. 18 (1967), s S 151164; III, ibid. 18 (1967),

Extremal problems Permutations How many permutations in a set (or group) with prescribed distances? Peter J. Cameron

524 views • 3 slides
Packing patterns in restricted permutations Lara Pudwell faculty.valpo.edu/lpudwell Special

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

Introduction Packing with Classical Restrictions Packing in Alternating Permutations Wrapping up Packing patterns in restricted permutations Lara Pudwell faculty.valpo.edu/lpudwell Special Session on Patterns in Permutations AMS Fall

828 views • 50 slides
ZPolyTrans: a library for computing and enumerating integer transformations of Z-Polyhedra

ZPolyTrans: a library for computing and enumerating integer transformations of Z-Polyhedra

Introduction A bit of theory Related work Demonstration ZPolyTrans: a library for computing and enumerating integer transformations of Z-Polyhedra Rachid Seghir (Vincent Loechner because the french embassy did not deliver a visa to him)

351 views • 13 slides

More recommend