1 / 30

Multidimensional morphic words, embedding types and some decidability problems

Multidimensional morphic words, embedding types and some decidability problems . Ivan Mitrofanov . Moscow State University. January 17, 2013, CIRM. Preliminaries on multidimensional words. 1/10. Let A be a finite alphabet. An array in (or a d-dimensional infinite word ) is a map .

bruno
Télécharger la présentation

Multidimensional morphic words, embedding types and some decidability problems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Multidimensional morphic words, embedding types and some decidability problems Ivan Mitrofanov Moscow State University January 17, 2013, CIRM

  2. Preliminaries on multidimensional words 1/10 Let A be a finite alphabet. An arrayin (or a d-dimensional infinite word) is a map can be viewed as a tiling of . d = 2 d = 1 ... ... c a a a a a c … b … b c b a b a c b b b c c b a a a b b b b b ... ...

  3. Preliminaries on multidimensional words 1/10 Let A be a finite alphabet. An arrayin (or a d-dimensional infinite word) is a map can be viewed as a tiling of . A d-dimensional picture (or a rectangular word) is a map d-tuple ) is called size of x. We denote the set of all d-dimensional pictures . d = 2 d = 1 ... ... c a a a a a c … b … b c b a b a c b b b c c b a a a b b = ; size() = (3; 2) b b b ... size() = 3 size() = 2 ...

  4. Rectangular words and morphisms 2/10 A d-dimensional morphismis a map . If it is called a substitution

  5. Rectangular words and morphisms 2/10 A d-dimensional morphismis a map . If it is called a substitution Suppose x to be a rectangular word. Image is said to be well-definedif images of adjacent letters can be arranged in the same order side-to-side without overlaps and holes. More precisely, if two letters and have the same i-th position in , and should have the same i-th component of size. Example (from Charlier, Karki, and Rigo article) Consider the map given by ; ; ; . . If , then is well-defined and given by

  6. Rectangular words and morphisms 2/10 A d-dimensional morphismis a map . If it is called a substitution Suppose x to be a rectangular word. Image is said to be well-definedif images of adjacent letters can be arranged in the same order side-to-side without overlaps and holes. More precisely, if two letters and have the same i-th position in , and should have the same i-th component of size. Example (from Charlier, Karki, and Rigo article) Consider the map given by ; ; ; . . If , then is well-defined and given by But is not well-defined. If is well-defined for any integer k and letter ,is well-definedfor alphabet. This property of a substitution can be algorithmically checked.

  7. Primitive morphic systems 3/10 In further: is well defined for is such that is well defined for and all integer k. The set of all rectangle subwords of words is called the language of morphic system Morphic system is said to be primitiveif such that iteration contains all letters of . NB If we consider language of a primitive system, we may consider h is non-erasing. There exists an infinite d-dimensional word T) such that the set of finite subwords of is language of . Problem To find the translation group (subgroup in ) for given and .

  8. Primitive morphic systems – some properties 4/10 Lemma Morphic system is primitive there exist d-tuple of reals and such that holds true for all integer k. In further we call the d-tuple the growth type of system and denote ,,…,) as . We suppose for all

  9. Primitive morphic systems – some properties 4/10 Lemma Morphic system is primitive there exist d-tuple of reals and such that holds true for all integer k. In further we call the d-tuple the growth type of system and denote ,,…,) as . We suppose for all

  10. Primitive morphic systems – some properties 4/10 Lemma Morphic system is primitive there exist d-tuple of reals and such that holds true for all integer k. In further we call the d-tuple the growth type of system and denote ,,…,) as . We suppose for all Lemma Suppose and language of primitive morphic system and there exist such that , . Then is a subword of. is a number depending on and and it can be algorithmically estimated)

  11. Embedding types 5/10 Suppose we have d-dimensional picture and set of pictures .., Find all the occurrences of in

  12. Embedding types 5/10 Suppose we have d-dimensional picture and set of pictures .., Find all the occurrences of in . For each occurrence find vertices.

  13. Embedding types 5/10 Suppose we have d-dimensional picture and set of pictures .., Find all the occurrences of in . For each occurrence find vertices. Numerate these vertices (way of numeration is not important).

  14. Embedding types 5/10 Suppose we have d-dimensional picture and set of pictures .., 1 3 2 4 5 7 8 6 10 9 12 11 Find all the occurrences of in . For each occurrence find vertices. Numerate these vertices (way of numeration is not important). For each write down its occurrences encoded by vertices. 14 13

  15. Embedding types 5/10 Suppose we have d-dimensional picture and set of pictures .., 1 3 2 4 5 7 8 6 10 9 12 11 Find all the occurrences of in . For each occurrence find vertices. Numerate these vertices (way of numeration is not important). For each right down its occurrences encoded by vertices. 14 13 :(2,3,10,8), (4,5,12,11) :(1,2,8,6), (7,9,14,13) This is embedding type. Two embedding types are equal iff numbers of vertices are permuted.

  16. Embedding types 5/10 Suppose we have d-dimensional picture and set of pictures .., 1 3 2 4 5 7 8 6 10 9 12 11 Find all the occurrences of in . For each occurrence find vertices. Numerate these vertices (way of numeration is not important). For each right down its occurrences encoded by vertices. 14 13 :(2,3,10,8), (4,5,12,11) :(1,2,8,6), (7,9,14,13) This is embedding type. Two embedding types are equal iff numbers of vertices are permuted. :(1,3,10,8), (4,5,12,11) :(2,1,8,6), (7,9,14,13)

  17. Periodicity of embedding types 6/10 Let and be two (ordered) sets of d-dimensional pictures. The embedding type, ) is the ordered set of embedding types , , ), , , ), .., , , ). We will call pictures big and pictures small. Theorem Suppose is a primitive morphic system. If is trivial, then there exists integer N such that sequence is ultimately periodic.

  18. Periodicity of embedding types 6/10 Let and be two (ordered) sets of d-dimensional pictures. The embedding type, ) is the ordered set of embedding types , , ), , , ), .., , , ). We will call pictures big and pictures small. Theorem Suppose is a primitive morphic system. If is trivial, then there exists integer N such that sequence is ultimately periodic. Algorithm Input: Primitive morphic system . Output: 1. Answer for the question “Does there exist a vector of periodicity for T()” 2. Vector of periodicity (in case of positive answer).

  19. Extra embedding types 7/10 Suppose is a d-dimensional picture. We will denote as . is the set of words in language of , which size is . In two-dimensional case: , , , In order to construct Find

  20. Extra embedding types 7/10 Suppose is a d-dimensional picture. We will denote as . is the set of words in language of , which size is . In two-dimensional case: , , , In order to construct Find Picture has two parts: and

  21. Extra embedding types 7/10 Suppose is a d-dimensional picture. We will denote as . is the set of words in language of , which size is . In two-dimensional case: , , , In order to construct Find Picture has two parts: and 3. Correspondence between points.

  22. Extra embedding types 7/10 Suppose is a d-dimensional picture. We will denote as . is the set of words in language of , which size is . In two-dimensional case: , , , In order to construct Find Picture has two parts: and 3. Correspondence between points. Example: point 5 in is situated in bottom part and corresponds .to point 1 in 5 1

  23. Extra embedding types (2) 8/10 Lemma is defined by Lemma If then is defined by

  24. Extra embedding types (2) 8/10 Lemma is defined by Lemma If then is defined by

  25. Extra embedding types (2) 8/10 Lemma is defined by Lemma If then is defined by Each block is for some

  26. Extra embedding types (2) 8/10 Lemma is defined by Lemma If then is defined by Each block is for some

  27. Extra embedding types (2) 8/10 Lemma is defined by Lemma If then is defined by Each block is for some Find and so on. Lemma We can find (algorithmically) such that if (for some and in this sequence) contains more than points then is not trivial.

  28. Extra embedding types (3) 9/10 … and so on wait until has more than points for some has two close occurrences and their shift vector is a vector of periodicity. Fall into circle (periodicity of types, is trivial)

  29. Translation group 10/10 Induction on dimension. standard basis: Suppose translation group, are linearly independent. WLOG is basis in . Question: does the translation group intersect ? We construct a (d-k)-dimensional primitive morphic system such that .

  30. Translation group 10/10 Induction on dimension. standard basis: Suppose translation group, are linearly independent. WLOG is basis in . Question: does the translation group intersect ? We construct a (d-k)-dimensional primitive morphic system such that . Thank you!

More Related