combinatorial specifications of permutation classes via
play

Combinatorial specifications of permutation classes, via their - PowerPoint PPT Presentation

Combinatorial specifications of permutation classes, via their decomposition trees Mathilde Bouvel (Institut f ur Mathematik, Universit at Z urich) talk based on joint works with F. Bassino, A. Pierrot, C. Pivoteau, D. Rossin Journ


  1. Combinatorial specifications of permutation classes, via their decomposition trees Mathilde Bouvel (Institut f¨ ur Mathematik, Universit¨ at Z¨ urich) talk based on joint works with F. Bassino, A. Pierrot, C. Pivoteau, D. Rossin Journ´ ees Al´ ea 2014

  2. Combinatorial specifications and trees

  3. Combinatorial specifications and their byproducts [Flajolet & Sedgewick 09] A combinatorial specification describes (most of the time, recursively) a combinatorial class C (= a family of discrete objects) by ways of atoms and admissible constructions, like disjoint union, product, sequence, . . .  Examples:   A 1 = Φ 1 ( A 1 , A 2 , . . . , A p )   T = U + B       = • + • A 2 = Φ 2 ( A 1 , A 2 , . . . , A p ) U D = ε + u D d D ; ; B   . . .  ◦     B = ◦ +   A p = Φ p ( A 1 , A 2 , . . . , A p ) U U Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 3 / 33

  4. Combinatorial specifications and their byproducts [Flajolet & Sedgewick 09] A combinatorial specification describes (most of the time, recursively) a combinatorial class C (= a family of discrete objects) by ways of atoms and admissible constructions, like disjoint union, product, sequence, . . .  Examples:   A 1 = Φ 1 ( A 1 , A 2 , . . . , A p )   T = U + B       = • + • A 2 = Φ 2 ( A 1 , A 2 , . . . , A p ) U D = ε + u D d D ; ; B   . . .  ◦     B = ◦ +   A p = Φ p ( A 1 , A 2 , . . . , A p ) U U Systematic transcription of a specification into: System of equations for the generating function C ( z ) = � c n z n [Flajolet & Sedgewick 09] Recursive [Flajolet, Zimmerman & Van Cutsem 94] and Boltzmann random samplers [Duchon, Flajolet, Louchard & Schaeffer 04] Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 3 / 33

  5. Combinatorial specifications of trees   T = U + B  Consider classes of (unlabeled ordered) trees,   = • + • with nodes from a (finite) set, possibly with U B  some restrictions on the children of a node. ◦    B = ◦ + U U These may be described by a specification using disjoint union, product (and sequence). Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 4 / 33

  6. Combinatorial specifications of trees   T = U + B  Consider classes of (unlabeled ordered) trees,   = • + • with nodes from a (finite) set, possibly with U B  some restrictions on the children of a node. ◦    B = ◦ + U U These may be described by a specification using disjoint union, product (and sequence). A specification is like an unambiguous context-free grammar of trees. Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 4 / 33

  7. Combinatorial specifications of trees   T = U + B  Consider classes of (unlabeled ordered) trees,   = • + • with nodes from a (finite) set, possibly with U B  some restrictions on the children of a node. ◦    B = ◦ + U U These may be described by a specification using disjoint union, product (and sequence). A specification is like an unambiguous context-free grammar of trees. “ Trees are the prototypical recursive structure ” [Flajolet & Sedgewick 09] They are (one of) the most studied combinatorial objects, and a lot is known about them, both for specific classes of trees, but also for families of classes of trees. Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 4 / 33

  8. Substitution decomposition and decomposition trees

  9. Substitution decomposition of combinatorial objects Combinatorial analogue of the decomposition of integers as products of primes. Applies to relations, graphs, posets, boolean functions, set systems, . . . and permutations [M¨ ohring & Radermacher 84] Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 6 / 33

  10. Substitution decomposition of combinatorial objects Combinatorial analogue of the decomposition of integers as products of primes. Applies to relations, graphs, posets, boolean functions, set systems, . . . and permutations [M¨ ohring & Radermacher 84] Relies on: a principle for building objects (permutations, graphs) from smaller objects: the substitution some “basic objects” for this construction: simple permutations, prime graphs Required properties: every object can be (recursively) decomposed using only “basic objects” this decomposition is unique Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 6 / 33

  11. Permutations Permutation of size n = Bijection from [1 .. n ] to itself. Set S n , and S = ∪ n S n . Graphical description, or diagram: Two lines notation: � 1 2 3 4 5 6 7 8 � σ = 1 8 3 6 4 2 5 7 Linear notation: σ = 1 8 3 6 4 2 5 7 σ i Description as a product of cycles: σ = (1) (2 8 7 5 4 6) (3) i Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 7 / 33

  12. Substitution for permutations Substitution or inflation : σ = π [ α (1) , α (2) , . . . , α ( k ) ].   α (1) = 2 1 =     Example: Here, π = 1 3 2, and . α (2) = 1 3 2 =      α (3) = 1 = Hence σ = 1 3 2[2 1 , 1 3 2 , 1] = 2 1 4 6 5 3. Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 8 / 33

  13. Simple permutations Not simple: Interval (or block) = set of elements of σ whose positions and values form intervals of integers Example: 5 7 4 6 is an interval of 2 5 7 4 6 1 3 Simple permutation = permutation with no interval, except the trivial ones: 1 , 2 , . . . , n and σ Example: 3 1 7 4 6 2 5 is simple Simple: Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 9 / 33

  14. Simple permutations Not simple: Interval (or block) = set of elements of σ whose positions and values form intervals of integers Example: 5 7 4 6 is an interval of 2 5 7 4 6 1 3 Simple permutation = permutation with no interval, except the trivial ones: 1 , 2 , . . . , n and σ Example: 3 1 7 4 6 2 5 is simple Simple: The smallest simple permutations: 12 , 21, 2413 , 3142, 6 of size 5, . . . Remark: It is convenient to consider 12 and 21 not simple. Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 9 / 33

  15. Substitution decomposition theorem(s) for permutations Theorem : [Albert, Atkinson & Klazar 03] Every σ ( � = 1) is uniquely decomposed as 12[ α (1) , α (2) ] = ⊕ [ α (1) , α (2) ], where α (1) is ⊕ -indecomposable 21[ α (1) , α (2) ] = ⊖ [ α (1) , α (2) ], where α (1) is ⊖ -indecomposable π [ α (1) , . . . , α ( k ) ], where π is simple of size k ≥ 4 Notations: ⊕ -indecomposable: that cannot be written as ⊕ [ β (1) , β (2) ] ⊖ -indecomposable: that cannot be written as ⊖ [ β (1) , β (2) ] Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 10 / 33

  16. Substitution decomposition theorem(s) for permutations Theorem : [Albert, Atkinson & Klazar 03] Every σ ( � = 1) is uniquely decomposed as 12[ α (1) , α (2) ] = ⊕ [ α (1) , α (2) ], where α (1) is ⊕ -indecomposable 21[ α (1) , α (2) ] = ⊖ [ α (1) , α (2) ], where α (1) is ⊖ -indecomposable π [ α (1) , . . . , α ( k ) ], where π is simple of size k ≥ 4 Notations: ⊕ -indecomposable: that cannot be written as ⊕ [ β (1) , β (2) ] ⊖ -indecomposable: that cannot be written as ⊖ [ β (1) , β (2) ] Observation: Equivalently, we may replace the first two items by 12 . . . k [ α (1) , . . . , α ( k ) ] = ⊕ [ α (1) , . . . , α ( k ) ], where the α ( i ) are ⊕ -indecomposable k . . . 21[ α (1) , . . . , α ( k ) ] = ⊖ [ α (1) , . . . , α ( k ) ], where the α ( i ) are ⊖ -indecomposable Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 10 / 33

  17. Substitution decomposition theorem(s) for permutations Theorem : [Albert, Atkinson & Klazar 03] Every σ ( � = 1) is uniquely decomposed as 12[ α (1) , α (2) ] = ⊕ [ α (1) , α (2) ], where α (1) is ⊕ -indecomposable 21[ α (1) , α (2) ] = ⊖ [ α (1) , α (2) ], where α (1) is ⊖ -indecomposable π [ α (1) , . . . , α ( k ) ], where π is simple of size k ≥ 4 Notations: ⊕ -indecomposable: that cannot be written as ⊕ [ β (1) , β (2) ] ⊖ -indecomposable: that cannot be written as ⊖ [ β (1) , β (2) ] Observation: Equivalently, we may replace the first two items by 12 . . . k [ α (1) , . . . , α ( k ) ] = ⊕ [ α (1) , . . . , α ( k ) ], where the α ( i ) are ⊕ -indecomposable k . . . 21[ α (1) , . . . , α ( k ) ] = ⊖ [ α (1) , . . . , α ( k ) ], where the α ( i ) are ⊖ -indecomposable Decomposing recursively inside the α ( i ) ⇒ decomposition tree Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 10 / 33

  18. Decomposition tree: witness of this decomposition Notations and properties: Example: Decomposition tree of • ⊕ = 12 . . . k , ⊖ = k . . . 21 σ = 10 13 12 11 14 1 18 19 20 21 17 16 15 4 8 3 2 9 5 6 7 = linear nodes. • π simple of size ≥ 4 3 1 4 2 = prime node. ⊕ ⊖ 2 4 1 5 3 • No edge ⊕ − ⊕ nor ⊖ − ⊖ . • Rooted ordered trees. ⊖ ⊕ ⊖ ⊕ • These conditions characterize decomposition trees. σ = 3 1 4 2[ ⊕ [1 , ⊖ [1 , 1 , 1] , 1] , 1 , ⊖ [ ⊕ [1 , 1 , 1 , 1] , 1 , 1 , 1] , 2 4 1 5 3[1 , 1 , ⊖ [1 , 1] , 1 , ⊕ [1 , 1 , 1]]] Mathilde Bouvel (I-Math, UZH) () Specifications of permutation classes 11 / 33

Recommend


More recommend