Download presentation

Presentation is loading. Please wait.

Published byAlivia Glade Modified over 3 years ago

1
Finitely presented nil-semigroups and aperiodic tilings SubTile 2013, CIRM, France Alexey Kanel-Belov, Ilya Ivanov-Pogodaev

2
2 Semigroups Semigroup: set with an associative binary operation. Simple definitions Generators or letters: set of semigroup elements such that all other elements can be presented by them. {a,b} {a 2 =0, ba=0}. a, b n, ab n n semigroup of words in the alphabet {a,b} with relations {a 2 =0, ba=0}. Non nil elements are: a, b n, ab n for any positive integer n. L L Word 1 =Word 2 or Word=0. We can define the semigroup as the set of finite words in some alphabet L. This is a free semigroup. But we can assign some relations between the letters of L, such that Word 1 =Word 2 or Word=0. These equalities are called as defining relations. 0x=x0=0x Zero: 0 is a nil element iff 0x=x0=0 for any element x from a semigroup. Finitelely presented semigroup: a semigroup with a finite set of defining relations. xx n =0 n Nil element: an element x such that x n =0 for some non negative integer n. Examples set of finite words in a finite alphabet, positive integers with addition, ideal of a ring, etc Example Nil semigroup: a semigroup is nil iff every element is nil. {a,b,c} {X 2 =0} X semigroup of words in the alphabet {a,b,c} with infinite set of relations {X 2 =0} (for any finite word X ). There are infinite number of non zero words. Example of infinite nil semigroup

3
3 Burnside problem in groups Let G be a finitely generated group of period n. Is it finite? Burnside Problem n=1,2,3,4,6 It is true for n=1,2,3,4,6 ; counter examples are known: for all odd numbers greater than 660 (P.Novikov S. Adyan); even numbers : greater than several thousands (S.Ivanov, A.Lyseonok). Geometrical proof of this based on Van Campen diagram mosaics (can be found in papers of M.Gromov). Connections between group relations and tilings investigated by J.Conway in the set of papers. n=5 Remark. Nothing is known for n=5 ! Is there exist an infinite finitely presented periodic group? Finitely presented Burnside Conjecture xnx n =1n nxG: x n =1. Groups: element x is periodic of period n if x n =1 for some positive integer n. Group is periodic of period n iff for any x in G: x n =1.

4
4 Some interesting groups, rings of semigroups can be constructed using finite number of defining relations. There are some questions here. In example V.N.Latyshev set a following problem: Finitely presented semigroups Questions Is there exist an infinite finitely presented nil-ring? V.N.Latyshev This talk is devoted to the question of L.N. Shevrin. Is there exist an infinite finitely presented nil-semigroup? L.N Shevrin In order to control defining relations in object one have to consider finitely presented objects. By other words, these objects can be presented by the finite information set. Construct a nonperiodic tiling with a finite set of tiles The main point of this problem standard question for tilings to obtain an global property (Nil-semigroup) with local tools (finite number of defining relations). So there are some connections between these topics

5
5 Finitely presented semigroups Monomial case Let {vi} be the finite set of forbidden words. Suppose that there exists an infinite word without forbidden subwords. Then, there exists a periodic infinite word without forbidden subwords. ExampleThere are no infinite finitely presented nil-semigroup, which defining relations are monomial. Equivalent description If we can multiply not just left-right but also upside-downside then we can use aperiodic tiling constructions. Mathematical fantasy Our goal is the realization of this fantasy

6
6 Semigroups and tilings Semigroup ab=0 monomial relation abcab word, element of semigroup We want to «read» tilings as the words. So the paths on tiling would be words in the semigroups. Let us set up some connected points between semigroups and tilings. Tiling prohibiting boundary condition Path on mosaic (tiling) In order to construct nil-semigroup, we want to construct the set of defining relations allowing us to convert any periodic word to zero. In parralel world of tilings we can use the language of boundary conditions to obtain the property such that only non periodic tiling would be possible. possibility to convert any periodic word to zero defining relations using possibility to interdict periodic tilings boundary conditions using possibility to interdict periodic tilings Hierarchic tiles using Then, we can use hierarchic methods for tile constructing to guarantee the absence of periodic tilings. This can be obtain by theorem of Goodman-Strauss type. Three languages

7
7 Language of paths The most useful approach is the language of paths. Semigroup a letter in the semigroup abcaba word, element of the semigroup abdc=0 monomial relation abcd=aebd equal words Type of nodal point in the mosaic Path on mosaic (tiling), the sequence of nodal points Impossible path Equivalent paths Tiling This language can be effectively used to set up the various number of tiling conditions and in the same time can be easily translated to semigroup language.

8
8 Additional ideas Language of paths Only aperiodical tilings are possible So, every periodic path should be banned Every «ring» path on the tiling should be banned Good way to fix this: ban all non- geodesic paths Thus, we construct a hierarchical tiling such that all periodic paths are forbidden or can be converted to forbidden paths. So should provide a tool for considering which path are periodic. This tool is the wide possibilities of geodesic path to local changing: we can change some subpaths several times in every regular path and locally convert it into another geodesic paths with the same edge nodes. So, for any two points A and B on the tiling there exist a wide number of geodesic paths with no «choke points». The number of such geodesic paths is grow with the distance between A and B A B The path can «scan» the near part of tiling by local equivalents (rewriting rules)

9
9 Base graph construction This is second level of hierarhy. It is easy to provide the following levels. Tile of level 1Tile of level 2 This is the main hieratical cutting. One tile can be cut to 6 smaller tiles. We are interesting only in topology of this tiling. every vertice has finite order; Every path crossing some tile of level n can be locally converted such that it cross that tile by its borders; If the path walk around 2 sides of some tile it can be locally converted to the path that walk through another two sides of that tile Properties

10
10 Some additional technicalities We can mark nodes and edges of the tiling to provide the tool of restitution. Restitution of the mosaics part

11
11 Some additional technicalities In order to obtain the absence of choke points we use a special «additional gluing» attached to the base planar tiling Base planar tiling Additional gluing

12
12 Thank you for you attention

Similar presentations

OK

Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.

Mathematical Preliminaries. Sets Functions Relations Graphs Proof Techniques.

© 2017 SlidePlayer.com Inc.

All rights reserved.

Ads by Google