En esta tesis se estudia la extensión del concepto de Super-carácter, introducido originariamente para grupos de matrices unitriangulares, a grupos de la forma G=1+J, con J el radical de Jacobson de un álgebra asociativa de dimensión finita. Este concepto se extiende también al caso en el que el álgebra se sustituye por un R-módulo libre con R un anillo de Galois.Por último, se definen un nuevo tipo de códigos cuánticos correctores de errores: los códigos de Clifford producto y se estudian sus propiedadescorrectoras.

With the classification of finite simple groups having been completed in 1981, recent work in group theory has involved the study of the structures of simple groups. The character tables of maximal subgroups of simple groups give substantive information about these groups. Most of the maximal subgroups of simple groups are of extension type. Some of the maximal subgroups of simple groups contain constituents of the generalized symmetric groups. Here we shall be interested in discussing such groups which we may call groups associated with the generalized symmetric groups. There are several well developed methods for calculating the character tables of group extensions. However Fischer [17] has given an effective method for calculating the character tables of some group extensions including the generalized symmetric group B (m, n). Actually work on the characters of wreath products with permutation groups dates back to Specht's work [61], through the works of Osima [49] and Kerber [33]. And more recently other people have worked on characters of wreath products with symmetric groups, these amongst others include Darafshesh and Iranmanesh [14], List and Mahmoud [36], Puttaswamiah [52], Read [55, 56], Saeed-Ul-Islam [59] and Stembridge [64]. It is well known that the character table of the generalized symmetric group B(m, n), where m and n are positive integers, can be constructed in GAP [22] with B(m, n) considered as the wreath product of the cyclic group Zm of order m with the symmetric group Sn' For example Pfeiffer [50] has given programmes which compute the character tables of wreath products with symmetric groups in GAP. However it may be necessary to obtain the partial character table of a group in hand rather than its complete character table. Further due to limited workspace in GAP, the wreath product method can only be used to compute character tables of B(m, n) for small values of m and n. It is for these reasons amongst others that Fischer's method is sometimes used to construct the character tables of such groups. groups B(2, 6) and B(3, 5) of orders 46080 and 29160 is done here. We have also used Programme 5.2.4 to construct the Fischer-Clifford matrices of the groups B(2, 12) and B(4, 5) of orders 222 x 35 X 52 X 7 x 11 and 213 x 3 x 5 respectively. Due to lack of space here we have given the Fischer-Clifford matrices of B(2, 12) and B(4,5) on the compact disk submitted with this thesis. However note that these matrices are the equivalent form of the Fischer-Clifford matrices of B(2, 12) and B(4,5). In [35] R.J. List has presented a method for constructing the Fischer-Clifford matrices of group extensions of an irreducible constituent of the elementary abelian group 2n by a symmetric group. The other aim of our work is to adapt the combinatorial method in [5] to the construction of the Fischer-Clifford matrices of some group extensions associated with B(m, n), using a similar method as the one used in [35]. Examples are given on the application of this adaptation to some groups associated with the groups B(2, 6), B(3,3) and B(3, 5). In this thesis we have constructed the character tables of the groups B(2, 6) and B(3,5) and some group extensions associated with these two groups and B(3, 3). We have also constructed the character tables of the groups B(2, 12) and B(4, 5) in our work, these character tables are given on the compact disk submitted with this thesis. The correctness of all the character tables constructed in this thesis has been tested in GAP. The main working programmes (Programme 2.2.3, Programme 3.1.9, Programme 3.1.10, Programme 5.2.1, Programme 5.2.4 and Programme 5.2.2) are given on the compact disk submitted with this thesis. It is anticipated that with further improvements, a number of the programmes given here will be incorporated into GAP. Indeed with further research work the programmes given here should lead to an alternative programme for computing the character table of B(m, n). / Thesis (Ph.D.)- University of KwaZulu-Natal, Pietermaritzburg, 2005.

Thesis (Ph. D.)--University of Canterbury, 2009. / Typescript (photocopy). "January 2009." Includes bibliographical references (leaves 125-131). Also available via the World Wide Web.

Thesis (M. Sc.)--University of Alberta, 2009. / In the title, the character [k] is in subscript and the character [n] is in superscript. Title from PDF file main screen (viewed on Oct. 19, 2009). "A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Master of Science in Pure Mathematics, Department of Mathematical and Statistical Sciences, University of Alberta." Includes bibliographical references.

Made available in DSpace on 2014-08-27T14:36:44Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-08-23Bitstream added on 2014-08-27T15:57:06Z : No. of bitstreams: 1 000774561.pdf: 509048 bytes, checksum: 311f20166de76fb390b9c2db0bfeb807 (MD5) / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / Em supersimetria padrão, construimos um superespaço com parâmetros 'x POT. 'mu'', 'teta', 'teta BARRA' (anti)comutantes e supercampos que dependem destes, então impomos vínculos e após de?nirmos supercampos quirais e vetorias, que são exemplos interessantes, e en?m construímos uma lagrangeana supersimétrica. Vamos aqui colocar condições mais fracas sobre os parâmetros do superespaço: agora tais parâmetros que antes eram anticomutantes vão formar uma álgebra de Cli?ord {'teta' POT. 'alfa'', 'teta' POT. 'beta'} = 'C POT. 'alfa' 'beta'' (1) e seguindo um procedimento análogo, com algumas de?nições adicionais, extenderemos nossa lagrangeana para o caso de um superespaço não-anticomutativo / In standard supersymmetry, we build a superspace with parameters 'x POT. 'mu'', 'teta', 'teta BARRA' that (anti)commute and super?elds that depend on them, then we impose constraints and de?ne chiral and vector super?elds, which are interesting examples, from which we build a supersymmetric Lagrangian. We will now impose a weaker condition on the superspace of the parameters: the ones that were anticommuting will now form a Cli?ord algebra {'teta' POT. 'alfa'', 'teta' POT. 'beta'}= 'C POT. 'alfa' 'beta'' (2) and, following an analogous procedure, with additional de?nitions, we will generalize our Lagrangian for the case of the non-anticommutative superspace

Orientador: Marcio Antonio de Faria Rosa / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Cientifica / Made available in DSpace on 2018-07-23T09:34:22Z (GMT). No. of bitstreams: 1 Motter_AdilsonEnio_M.pdf: 1951510 bytes, checksum: a577fce684e8889e9bd14309b99f844c (MD5) Previous issue date: 1998 / Resumo: A dissertação consiste essencialmente do estudo de casos particulares de Análise de Clifford. Inicialmente revisamos a Análise Quaterniônica de Fueter comparando com abordagens alternativas e, neste contexto, pesquisamos uma aplicação das correspondentes relações de dispersão em fenomenologia de partículas elementares. Empregando a mesma sistemática investigamos a teoria de funções resultante no caso da álgebra não divisora dos biquatérnios, onde os principais resultados dizem respeito à formulação rigorosa da Fórmula Integral e a relações com o eletromagnetismo. Situamos estes e outros casos no escopo das Análises de Clifford, chamando a atenção para aspectos de caráter geral. Tendo em vista os vínculos algébricos entre quatérnios e Instantons da Teoria de YangMills SU(2), chamamos a atenção, também, para relações analíticas entre os Instantons e a teoria de Fueter. / Abstract: This thesis reíers essentially to the study oí particular cases oí Clifford analysis. First we review Fueter's quaternionic analysis and compare it with alternative theories. In this context we have inquired a possible application oí the corresponding dispersion relations in íenomenology oí elementary particles. Making use oí the the same approach, we have investigated the íunction theory resulting in the case oí the non-division biquaternion algebra. Concerning that. the most important results are the rigorous íormulation oí the Integral Formula and the relations with eletromagnetism. We have situated these and others cases in the picture oí the Clifford analysis, paying attention to general íeatures. Mindíul oí the algebraic links between quaternions and Instantons oí the SU(2) YangMills Theory, we call attention again to analytical relations between Instantons and the Fueter's theory. / Mestrado / Mestre em Matemática Aplicada

Orientador: Waldyr A. Rodrigues Jr / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Fisica "Gleb Wataghin" / Made available in DSpace on 2018-07-27T01:54:06Z (GMT). No. of bitstreams: 1 Fernandez_VirginiaVelma_D.pdf: 3436448 bytes, checksum: 2504067e30ecfe9c3ced588985b081cb (MD5) Previous issue date: 2000 / Doutorado / Física / Doutor em Ciências

Orientador : Antonio Paques / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matematica, Estatistica e Computação Científica / Made available in DSpace on 2018-07-17T20:45:47Z (GMT). No. of bitstreams: 1 NobregaNeto_TrajanoPiresda_M.pdf: 3111528 bytes, checksum: c0bcaaf2ac80fde07b3b31de5d1e395b (MD5) Previous issue date: 1984 / Resumo: Não informado / Abstract: Not informed / Mestrado / Mestre em Matemática

This is an overview of geometric algebras in dimensions 0-4 from the perspective of the concept of number itself. It is developed from a historic viewpoint and investigates and develops a pedagogic approach emphasizing the geometric aspects of the subject. There is a focus broadly on three main but interconnected areas: the relation between the discrete and the continuous, the centrality of complex numbers, and the hypothesis that the octonions may be expressed in the even subalgebra of four dimensions. This will not be proved, and the focus is on the overall perspective and presentation. One central result is a proposal for the identification of the Cayley-Dickson process with the gluing together of spheres, extending it to start from ℕ. This leads to a projective representation of a unified elliptic/parabolic/hyperbolic geometry of 4-dimensional space. Coupled with this is a discrete representation of it that can be classified with Geometric Algebra.

Orientador: Carlile Campos Lavor / Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Matemática Estatística e Computação Científica / Made available in DSpace on 2018-09-24T19:32:19Z (GMT). No. of bitstreams: 1 Alves_RafaelSantosdeOliveira_D.pdf: 2213205 bytes, checksum: 67a1681eb02b103974e57e3047edc755 (MD5) Previous issue date: 2013 / Resumo: O Problema de Geometria de Distâncias Moleculares (PGDM) consiste em encontrar uma imersão tridimensional de um grafo simples, não orientado, de forma que o peso nas arestas corresponda às distâncias inter-atômicas de uma molécula. Este é um problema de busca em um espaço contínuo, mas que pode ser discretizado sob algumas exigências, dando origem ao PGDM discretizado (PGDMD), que é solucionado usando informações sobre distâncias entre alguns átomos da molécula através de um algoritmo Branch and Prune (BP). Caso as distâncias sejam dadas por um conjunto de limites inferiores e superiores, temos um novo problema: o PGDMD intervalar (iPGDMD). A partir da interpretação geométrica deste último, propomos uma nova abordagem utilizando a Álgebra de Clifford a fim de tornar o algoritmo BP mais eficiente e de poder tratar algebricamente os problemas relacionados ao tratamento das distâncias intervalares / Abstract: The Molecular Distance Geometry Problem (MDGP) consists in finding a three dimensional embedding of simple, weighted, undirected graph such that the weight in the edges correspond to the inter-atomic distances of a molecule. This is a continuous search problem which can be discretized under some assumptions, yielding the Discretized MDGP (DMDGP), which is solved by a Branch and Prune (BP) algorithm using information about the distances among some atoms of the molecule. If the distances are given by a set of lower and upper bounds, a new problem arises: the interval DMDGP (iDMDGP). From a geometric interpretation of this problem, we propose a new approach, using Clifford Algebras, in order to improve the BP efficiency and treat algebraically the issues related to interval distances / Doutorado / Matematica Aplicada / Doutor em Matemática Aplicada