Global ETD Search

1	Measure Theory of Self-Similar Groups and Digit Tiles Kravchenko, Rostyslav 2010 December 1900 (has links) This dissertation is devoted to the measure theoretical aspects of the theory of automata and groups generated by them. It consists of two main parts. In the first part we study the action of automata on Bernoulli measures. We describe how a finite-state automorphism of a regular rooted tree changes the Bernoulli measure on the boundary of the tree. It turns out, that a finite-state automorphism of polynomial growth, as defined by Sidki, preserves a measure class of a Bernoulli measure, and we write down the explicit formula for its Radon-Nikodim derivative. On the other hand the image of the Bernoulli measure under the action of a strongly connected finite-state automorphism is singular to the measure itself. The second part is devoted to introduction of measure into the theory of limit spaces of Nekrashevysh. Let G be a group and φ : H → G be a contracting homomorphism from a subgroup H < G of finite index. Nekrashevych associated with the pair (G, φ) the limit dynamical system (JG, s) and the limit G-space XG together with the covering ∪g∈GT · g by the tile T. We develop the theory of selfsimilar measures m on these limit spaces. It is shown that (JG, s,m) is conjugate to the one-sided Bernoulli shift. Using sofic subshifts we prove that the tile T has integer measure and we give an algorithmic way to compute it. In addition we give an algorithm to find the measure of the intersection of tiles T ∩ (T · g) for g ∈ G. We present applications to the evaluation of the Lebesgue measure of integral self-affine tiles. Previously the main tools in the theory of self-similar fractals were tools from measure theory and analysis. The methods developed in this disseration provide a new way to investigate self-similar and self-affine fractals, using combinatorics and group theory. self-similar groups digit tiles contractive groups
2	Groups generated by bounded automata and their schreier graphs Bondarenko, Ievgen 15 May 2009 (has links) This dissertation is devoted to groups generated by bounded automata and geometric objects related to these groups (limit spaces, Schreier graphs, etc.). It is shown that groups generated by bounded automata are contracting. We introduce the notion of a post-critical set of a finite automaton and prove that the limit space of a contracting self-similar group generated by a finite automaton is post-critically finite (finitely-ramified) if and only if the automaton is bounded. We show that the Schreier graphs on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA∈KAv, where K is a finite set of nonnegative matrices, with every bounded automaton. We give an effective criterium for the existence of a strictly positive eigenvector of fK. The existence of nonnegative generalized eigenvectors of fK is proved and used to give an algorithmic way for finding the exponents λmax and λmin of the maximal and minimal growth of the components of f(n) K (v). We prove that the growth exponent of diameters of the Schreier graphs is equal to λmax and the orbital contracting coefficient of the group is equal to 1/λmin . We prove that the simple random walks on orbital Schreier graphs are recurrent. A number of examples are presented to illustrate the developed methods with special attention to iterated monodromy groups of quadratic polynomials. We present the first example of a group whose coefficients λmin and λmax have different values. finite automata self-similar groups limit spaces of self-similar groups Schreier graphs piecewise linear maps
3	Groups generated by bounded automata and their schreier graphs Bondarenko, Ievgen 10 October 2008 (has links) This dissertation is devoted to groups generated by bounded automata and geometric objects related to these groups (limit spaces, Schreier graphs, etc.). It is shown that groups generated by bounded automata are contracting. We introduce the notion of a post-critical set of a finite automaton and prove that the limit space of a contracting self-similar group generated by a finite automaton is post-critically finite (finitely-ramified) if and only if the automaton is bounded. We show that the Schreier graphs on levels of automaton groups can be constructed by an iterative procedure of inflation of graphs. This was used to associate a piecewise linear map of the form fK(v) = minA[set]KAv, where K is a finite set of nonnegative matrices, with every bounded automaton. We give an effective criterium for the existence of a strictly positive eigenvector of fK. The existence of nonnegative generalized eigenvectors of fK is proved and used to give an algorithmic way for finding the exponents λmax and λmin of the maximal and minimal growth of the components of fK(n)(v). We prove that the growth exponent of diameters of the Schreier graphs is equal to λmax and the orbital contracting coefficient of the group is equal to 1/λmin . We prove that the simple random walks on orbital Schreier graphs are recurrent. A number of examples are presented to illustrate the developed methods with special attention to iterated monodromy groups of quadratic polynomials. We present the first example of a group whose coefficients λmin and λmax have different values. limit spaces of self-similar groups self-similar groups finite automata Schreier graphs piecewise linear maps
4	Presentations and Structural Properties of Self-similar Groups and Groups without Free Sub-semigroups Benli, Mustafa G 16 December 2013 (has links) This dissertation is devoted to the study of self-similar groups and related topics. It consists of three parts. The first part is devoted to the study of examples of finitely generated amenable groups for which every finitely presented cover contains non-abelian free subgroups. The study of these examples was motivated by natural questions about finiteness properties of finitely generated groups. We show that many examples of amenable self-similar groups studied in the literature cannot be covered by finitely presented amenable groups. We investigate the class of contracting self-similar groups from this perspective and formulate a general result which is used to detect this property. As an application we show that almost all known examples of groups of intermediate growth cannot be covered by finitely presented amenable groups. The latter is related to the problem of the existence of finitely presented groups of intermediate growth. The second part focuses on the study of one important example of a self-similar group called the first Grigorchuk group G, from the viewpoint of pro finite groups. We investigate finite quotients of this group related to presentations and group (co)homology. As an outcome of this investigation we prove that the pro finite completion G_hat of this group is not finitely presented as a pro finite group. The last part focuses on a class of recursive group presentations known as L-presentations, which appear in the study of self-similar groups. We investigate the relation of such presentations with the normal subgroup structure of finitely presented groups and show that normal subgroups with finite cyclic quotient of finitely presented groups have such presentations. We apply this result to finitely presented indicable groups without free sub-semigroups. self-similar groups presentations amenability groups of intermediate growth profinite completions recursive presentations
5	Computation with finitely L-presented groups / Algorithmen für endlich L-präsentierte Gruppen Hartung, René 01 June 2012 (has links) No description available. 510 Mathematik ECAF 050 ECAF 100 ECAE 070 ECA 040 Mathematics and Computer Science Unendliche Präsentationen rekursive Präsentationen L-Präsentationen Untergruppen endlichen Index Algorithmen selbstähnliche Gruppen Grigorchuk Gruppe. Infinite presentations recursive presentations L-presentations finite index subgroups algorithms self-similar groups Grigorchuk group 31.21
6	Discrete and Profinite Groups Acting on Regular Rooted Trees / Diskrete und pro-endliche Gruppen, die auf regulären Bäumen mit einem Fixpunkt operieren Siegenthaler, Olivier 28 September 2009 (has links) No description available. 510 Mathematik ECAE 080 Mathematics and Natural Science Gruppen die auf Bäumen operieren selbstähnliche Gruppen Kranzprodukte pro-endliche Gruppen affine Gruppenschemata Zentralreihen Automorphismentürme Hausdorff Dimension Grigorchuk Gruppe Kongruenzprobleme groups acting on trees self-similar groups wreath products profinite groups affine group schemes central series automorphism towers Hausdorff dimension Grigorchuk group congruence problems 31.21

1

Page generated in 0.0358 seconds