Download presentation

Presentation is loading. Please wait.

Published byJack Stokes Modified over 3 years ago

1
ECO and Object Grammars: two methods for the enumeration of combinatorial objects Simone Rinaldi Dipartimento di Scienze Matematiche e Informatiche Roberto Magari Siena Workshop "Formal Languages and Automata: Theory and Applications", September 2003, Ravello

2
ECO method ECO is a method for Enumeration of Combinatorial Objects introduced by Barcucci, Del Lungo, Pergola and Pinzani O a class of combinatorial objects p a parameter on O (i.e. p: O N + ) O n the objects of O having size n, O n = {o:p(o)=n} ECO operator: O n P(O n+1 ) P(O n+1 ) is the set of parts of O n+1

3
Proposition: Let be an operator on O, such that: 1. for each o' O n+1 there is o O n s.t. o' o 2. for each o,o' O n with o o', ' then { : O n } is a partition of O n+1

4
A very simple example: Parallelogram Polyominoes A parallelogram polyomino

5
A very simple example: Parallelogram Polyominoes A parallelogram polyomino

6
A very simple example: Parallelogram Polyominoes A parallelogram polyomino upper pathlower path

7
Well-known enumerative results The number of parallelogram polyominoes with semi-perimeter n+2: The Catalan numbers: 1,2,5,42,132,429,… The 5 parallelogran polyominoes with sp=4

8
(k) (1) (2) (3) … (k-1) (k) (k+1) (3) (4) (1) (2)(3) The ECO operator for Parallelogram Polyominoes

9
Generating tree of the operator The recursive construction determined by can be suitably described through a generating tree (1) (2) (1) (2)(3) (1) (2)

10
A succession rule (1) (k) (1) (2) … (k) (k+1) (k+1) (1) (2) (1)(2)(3) (1) (2) fnfn 1 2 5

11
ECO method: enumeration (1) Born as a method for the enumeration of combinatorial objects: E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, ECO: a methodology for the Enumeration of Combinatorial Objects. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, A methodology for plane tree enumeration. E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Directed animals, forests and permutations.

12
ECO method: algebraic characterizations (2) Operations on succession rules: L. Ferrari, E. Pergola, R. Pinzani, S. Rinaldi, An algebraic characterization of the set of succession rules. L. Ferrari, E. Pergola, R. Pinzani, S. Rinaldi, Jumping succession rules and their generating functions. S. Brlek, E. Duchi, E. Pergola, S. Rinaldi, On the equivalence problem for succession rules. Production matrices: E. Deutsch, L. Ferrari, S. Rinaldi, Production matrices.

13
ECO method: generating functions (3) To determine the generating function associated with an ECO operator: C. Banderier, M. Bousquet-Melou, A. Denise, P. Flajolet, D. Gardy and D. Gouyou-Beauchamps, Generating functions for generating trees. E. Duchi, A. Frosini, S. Rinaldi, R. Pinzani, A note on rational succession rules.

14
ECO method: random and exhaustive generation (4) Random generation of combinatorial objects: E. Barcucci, A. Del Lungo, E. Pergola, R. Pinzani, Random generation of trees and other combinatorial objects. Exhaustive generation of objects: A. Del Lungo, A. Frosini, S. Rinaldi, ECO method and the exhaustive generation of convex polyominoes. S. Bacchelli, E. Barcucci, E. Grazzini, E. Pergola, Exhaustive generation of combinatorial objects by ECO

15
Object grammars O i is a class of objects; E Oi is a finite subsets of O i (terminal objects); j is an operation on {O i } i I (object operation); A is an element of {O i } i I (axiom).

16
Object grammar for Dyck paths

17
Object grammar for Dyck paths f(x)=1+x 2 f 2 (x) +=

18
A new approach Let L be the language of the words from the root to a node in the generating tree of (1) (2) (1)(2)(3) (1) (2) L = {(1),(1)(1), (1)(2), (1)(1)(1), (1)(1)(2), (1)(2)(1), (1)(2)(2), (1)(2)(3), … }

20
Operations on S

21
Example:

22
The series associated with Let C be the series associated with : C=(1)+(1)C +(1)C +(1)C C Let w C, w (1) : w = (1)(1)(2)(3)(3) (1)C w = (1)(2)(2)(3)(4)(2) (1)C w = (1)(2)(2)(3)(4)(2)(1)(2)(2) (1)C C

23
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C C(x)=x+xC(x) +xC(x) +xC 2

24
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C

25
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C (1)(1)(2)(3)(3) (1)

26
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C (1)(1)(2)(3)(3) (1)(1)

27
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C (1)(1)(2)(3)(3) (1)(1)(2)

28
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C (1)(1)(2)(3)(3) (1)(1)(2)(3)

29
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C (1)(1)(2)(3)(3)

30
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C C

31
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C C

32
Formal power series and Object Grammars C=(1)+(1)C +(1)C +(1)C C C C

33
Object Grammar for parallelogram polyominoes = ++ +

34
Results Object grammars for various classes of polyominoes Directed-convex polyominoes Directed column-convex polyomines Column-convex polyominoes Convex polyominoes

35
Example: column-convex polyomines Class C

36
Example: column-convex polyomines Class B

37
Example: column-convex polyomines Class P

38
Example: column-convex polyomines Class Q

39
Operations for column-convex polyominoes (class C)

40
Operations for the class B

41
Operations for the class P

42
Operations for the class Q

Similar presentations

OK

International Iran conference on Quantum Information September 2007, Kish Island Evaluation of bounds of codes defined over hexagonal and honeycomb lattices.

International Iran conference on Quantum Information September 2007, Kish Island Evaluation of bounds of codes defined over hexagonal and honeycomb lattices.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google