Thesis (Ph. D.)--Oregon State University, 2001. / Typescript (photocopy). Includes bibliographical references (leaves 33-35). Also available on the World Wide Web.

Thesis (Ph. D.)--State University of New York at Binghamton, Department of Mathematical Sciences, 2008. / Includes bibliographical references.

Thesis (Ph.D.)--Memorial University of Newfoundland, 1999. / Bibliography: leaves 119-122.

Thesis (Ph. D.)--University of Chicago, Department of Mathematics, June 2002. / Includes bibliographical references. Also available on the Internet.

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 51-52).

Made available in DSpace on 2014-10-09T12:36:47Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T13:57:29Z (GMT). No. of bitstreams: 1 01485.pdf: 2055071 bytes, checksum: d7a431e820f8793828ac54edaacbd1d2 (MD5) / Tese (Doutoramento) / IPEN/T / Univ. North Carolina State

In this thesis we study several properties of finitely presented groups, through the unifying paradigm of encoding sought-after group properties into presentations and detecting group properties from presentations, in the context of Geometric Group Theory. A group law is said to be detectable in power subgroups if, for all coprime m and n, a group G satisfies the law if and only if the power subgroups G(^m) and G(ⁿ) both satisfy the law. We prove that for all positive integers c, nilpotency of class at most c is detectable in power subgroups, as is the k-Engel law for k at most 4. In contrast, detectability in power subgroups fails for solvability of given derived length: we construct a finite group W such that W(²) and W(³) are metabelian but W has derived length 3. We analyse the complexity of the detectability of commutativity in power subgroups, in terms of finite presentations that encode a proof of the result. We construct a census of two-generator one-relator groups of relator length at most 9, with complete determination of isomorphism type, and verify a conjecture regarding conditions under which such groups are automatic. Furthermore, we introduce a family of one-relator groups and classify which of them act properly cocompactly on complete CAT(0) spaces; the non-CAT(0) examples are counterexamples to a variation on the aforementioned conjecture. For a subclass, we establish automaticity, which is needed for the census. The deficiency of a group is the maximum over all presentations for that group of the number of generators minus the number of relators. Every finite group has non-positive deficiency. For every prime p we construct finite p-groups of arbitrary negative deficiency, and thereby complete Kotschick's proposed classification of the integers which are deficiencies of Kähler groups. We explore variations and embellishments of our basic construction, which require subtle Schur multiplier computations, and we investigate the conditions on inputs to the construction that are necessary for success. A well-known question asks whether any two non-isometric finite volume hyperbolic 3-manifolds are distinguished from each other by the finite quotients of their fundamental groups. At present, this has been proved only when one of the manifolds is a once-punctured torus bundle over the circle. We give substantial computational evidence in support of a positive answer, by showing that no two manifolds in the SnapPea census of 72 942 finite volume hyperbolic 3-manifolds have the same finite quotients. We determine examples of sizeable graphs, as required to construct finitely presented non-hyperbolic subgroups of hyperbolic groups, which have the fewest vertices possible modulo mild topological assumptions.

The current thesis is focused on synchronizing permutation groups and on graph endo- morphisms. Applying the implicit classification of rank 3 groups, we provide a bound on synchronizing ranks of rank 3 groups, at first. Then, we determine the singular graph endomorphisms of the Hamming graph and related graphs, count Latin hypercuboids of class r, establish their relation to mixed MDS codes, investigate G-decompositions of (non)-synchronizing semigroups, and analyse the kernel graph construction used in the theorem of Cameron and Kazanidis which identifies non-synchronizing transformations with graph endomorphisms [20]. The contribution lies in the following points: 1. A bound on synchronizing ranks of groups of permutation rank 3 is given, and a complete list of small non-synchronizing groups of permutation rank 3 is provided (see Chapter 3). 2. The singular endomorphisms of the Hamming graph and some related graphs are characterised (see Chapter 5). 3. A theorem on the extension of partial Latin hypercuboids is given, Latin hyper- cuboids for small values are counted, and their correspondence to mixed MDS codes is unveiled (see Chapter 6). 4. The research on normalizing groups from [3] is extended to semigroups of the form < G, T >, and decomposition properties of non-synchronizing semigroups are described which are then applied to semigroups induced by combinatorial tiling problems (see Chapter 7). 5. At last, it is shown that all rank 3 graphs admitting singular endomorphisms are hulls and it is conjectured that a hull on n vertices has minimal generating set of at most n generators (see Chapter 8).

Made available in DSpace on 2014-10-09T12:29:17Z (GMT). No. of bitstreams: 0 / Made available in DSpace on 2014-10-09T14:00:50Z (GMT). No. of bitstreams: 1 01343.pdf: 8187182 bytes, checksum: 1a795b521139f6efcc47c46e35075982 (MD5) / Dissertacao (Mestrado) / IEA/D / Instituto de Pesquisas Energeticas e Nucleares - IPEN/CNEN-SP

O entendimento de quebra espontânea de simetria é um problema importante para o estudo de fenômenos na evolução de sistemas abertos, tanto em física quanto em química, como também na biologia. Aqui estudamos um método a mais para este tipo de análise, usando conceitos de sistemas dinâmicos com simetria. O sistema dinâmico escolhido é discreto, isto é, realizado por iteração de um difeomorfismo equivariante sob a ação de um grupo compacto, neste caso um grupo finito do tipo Dm. Especificamente, investigamos o comportamento de atratores caóticos sob a variação dos parâmetros. / The understanding of spontaneous symmetry breaking is an important problem in the study of phenomena in the evolution of open systems, in physics and chemistry as well as in biology. Here we study another method for this kind of analysis, using concepts from dynamical systems with symmetry. The chosen dynamical system is discrete, that is, realized by iteration of an equivariant diffeomorphism under the action of a compact group, in this case one of the finite groups of type Dm. Specifically, we investigate the behavior of chaotic attractors under variation of the parameters.