Orientador: Luiz Antonio Barrera San Martin / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-21T14:02:28Z (GMT). No. of bitstreams: 1 Silva_JulioCesarConegundesda_M.pdf: 1171316 bytes, checksum: 4e6e6eb2a3f1c066ac73e86495c06428 (MD5) Previous issue date: 2012 / Resumo: ...Observações: Por apresentar basicamente fórmulas, o resumo, na íntegra, poderá ser visualizado no texto completo da tese digital / Abstract: ...Note: The complete abstract is available with the full electronic document / Mestrado / Matematica / Mestre em Matemática

No description available.

We study the Erdős- Sòs conjecture that states that ever graph of average degree greater than k-1 contains every tree of order k+1. While the conjecture was studied for some graphs, it still remains open and of interest after more than 40 years. We study the conjecture for graphs with no K2,s where, s ≥ 2 and k > 12(s-1). We use the fact that as G contains no K2,s, any two distinct vertices in G have at most s-1 neighbors in common in proving the results. We have answered in the affirmative that the Erdős- Sòs conjecture is true for graphs defined above, thus adding to the list of graphs for which the conjecture is true. We also study the Cayley Isomorphism Problem that states that for which finite groups H is it true that any two Cayley graphs of H are isomorphic if and only if they are isomorphic by a group automorphism of H ? (H is a CI-group with respect to graphs.) Determining whether or not a group is a CI-group with respect to graphs has received considerable attention over the last 40 or so years. In particular, we study the problem for (pq,r)-metacirculant color digraphs where p < q < r and pq/| α|. We use the fact that Γ is a CI-color digraph of H if and only if given a permutation γ ∈ SH such that γ-1HLγ ≤ Aut(Γ), HL and γ-1HLγ are conjugate in Aut(Γ). We consider the Cayley isomorphism problem for a nonabelian group of order pqr, where p, q, r are distinct primes such that pq/(r- 1). We show that the results are true, not only for Cayley graphs but for some related classes of non Cayley vertex transitive graphs, thus solving the problem for that case.

In 1896, Frobenius began the study of character theory while factoring the group determinant. Later in 1963, Brauer pointed out that the relationship between characters and their groups was still not fully understood. He published a series of questions that he felt would be important to resolve. In response to these questions, Johnson, Mattarei, and Sehgal developed the idea of a weak Cayley table map between groups. The set of all weak Cayley table maps from one group to itself also has a group structure, which we will call the weak Cayley table group. We will examine the weak Cayley table group of AGL(1; p) and the dicyclic groups, a nd a normal subgroup of the weak Cayley table group for a special case with Camina pairs and Semi-Direct products with a normal Hall-π subgroup, and look at some nontrivial weak Cayley table elements for certain p-groups. We also define a relative weak Cayley table and a relative weak Cayley table map. We will examine the relationship between relative weak Cayley table maps and weak Cayley table maps, automorphisms and anti-automorphisms, characters and spherical functions.

Thèse numérisée par la Direction des bibliothèques de l'Université de Montréal.

Recent results of string theory have shown that while the traditional cycles studied in Calabi-Yau 4-manifolds preserve half the spacetime supersymmetry, the more general class of Cayley cycles are novel in that they preserve only one quarter of it. Moreover, Cayley cycles play a crucial role in understanding mirror symmetry on Calabi-Yau 4-manifolds and Spin manifolds. Nonetheless, only very few nontrivial examples of Cayley cycles are known. In particular, it would be very useful to know interesting examples of Cayley cycles on the complex 4-torus. This thesis will develop key techniques for finding and constructing lattice periodic Cayley manifolds in Euclidean 8-space. These manifolds will project down to the complex 4-torus, yielding nontrivial Cayley cycles.

Thesis (Ph. D.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 172-175). Also available on the World Wide Web.

Thesis (Ph. D.)--University of Oregon, 2006. / Typescript. Includes vita and abstract. Includes bibliographical references (leaves - ). Also available for download via the World Wide Web; free to University of Oregon users.

In this thesis we examine properties and constructions of graph automatic semigroups, a generalisation of both automatic semigroups and finitely generated FA-presentable semigroups. We consider the properties of graph automatic semigroups, showing that they are independent of the choice of generating set, have decidable word problem, and that if we have a graph automatic structure for a semigroup then we can find one with uniqueness. Semigroup constructions and their effect on graph automaticity are considered. We show that finitely generated direct products, free products, finitely generated Rees matrix semigroup constructions, zero unions, and ordinal sums all preserve unary graph automaticity, and examine when the converse also holds. We also demonstrate situations where semidirect products, Bruck-Reilly extensions, and semilattice constructions preserve graph automaticity, and consider the conditions we may impose on such constructions in order to ensure that graph automaticity is preserved. Unary graph automatic semigroups, that is semigroups which have graph automatic structures over a single letter alphabet, are also examined. We consider the form of an automaton recognising multiplication by generators in such a semigroup, and use this to demonstrate various properties of unary graph automatic semigroups. We show that infinite periodic semigroups are not unary graph automatic, and show that we may always find a uniform set of normal forms for a unary graph automatic semigroup. We also determine some necessary conditions for a semigroup to be unary graph automatic, and use this to provide examples of semigroups which are not unary graph automatic. Finally we consider semigroup constructions for unary graph automatic semigroups. We show that the free product of two semigroups is unary graph automatic if and only if both semigroups are trivial; that direct products do not always preserve unary graph automaticity; and that Bruck-Reilly extensions are never unary graph automatic.

Let G be a group. A weak Cayley table isomorphism $\phi$: G $\rightarrow$ G is a bijection satisfying two conditions: (i) $phi$ sends conjugacy classes to conjugacy classes; and (ii) $\phi$(g1)$\phi$(g2) is conjugate to $\phi$(g1g2) for all g1, g2 in G. The set of all such mappings forms a group W(G) under composition. We study W(G) for fifty-six of the two hundred nineteen three-dimensional crystallographic groups G as well as some other groups. These fifty-six groups are related to our previous work on wallpaper groups.