• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6
  • Tagged with
  • 8
  • 8
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Algorithms for computing in finite groups

Bamblett, Jane Carswell January 1994 (has links)
No description available.
2

The Representation Theory of the Symmetric Groups

Halverson-Duncan, Brittany 23 March 2015 (has links)
This paper forms an introductory account of the irreducible representations of the permutation group using Young Tableaux as the tool to achieve this. The basics of C*-Algebra theory and Young Tableaux are provided including a brief history of the two subjects. This paper provides a straightforward development of the subject up to the main result which says that restricting the irreducible representations of S_n corresponding to the Young diagrams of shape ? to S_n-1 decomposes as the direct sum of the irreducible representations of S_n-1 corresponding to the Young diagrams formed by removing one box from ?. / Graduate
3

On Sharp Permutation Groups whose Point Stabilizers are Certain Frobenius Groups

Norman, Blake Addison 05 1900 (has links)
We investigate non-geometric sharp permutation groups of type {0,k} whose point stabilizers are certain Frobenius groups. We show that if a point stabilizer has a cyclic Frobenius kernel whose order is a power of a prime and Frobenius complement cyclic of prime order, then the point stabilizer is isomorphic to the symmetric group on 3 letters, and there is up to permutation isomorphism, one such permutation group. Further, we determine a significant structural description of non-geometric sharp permutation groups of type {0,k} whose point stabilizers are Frobenius groups with elementary abelian Frobenius kernel K and Frobenius complement L with |L| = |K|-1. As a result of this structural description, it is shown that the smallest non-solvable Frobenius group cannot be a point stabilizer in a non-geometric sharp permutation group of type {0,k}.
4

The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability

Fawcett, Joanna January 2009 (has links)
The O'Nan-Scott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation groups since four out of the five isomorphism classes are well understood. The proof of this theorem currently relies upon the classification of the finite simple groups, as it requires a consequence of this classification, the Schreier Conjecture. After reviewing some needed group theoretic concepts, I give a detailed proof of the O'Nan-Scott Theorem. I then examine how the techniques of this proof have been applied to an open problem which asks whether every finite lattice can be embedded as an interval into the subgroup lattice of a finite group.
5

The O'Nan-Scott Theorem for Finite Primitive Permutation Groups, and Finite Representability

Fawcett, Joanna January 2009 (has links)
The O'Nan-Scott Theorem classifies finite primitive permutation groups into one of five isomorphism classes. This theorem is very useful for answering questions about finite permutation groups since four out of the five isomorphism classes are well understood. The proof of this theorem currently relies upon the classification of the finite simple groups, as it requires a consequence of this classification, the Schreier Conjecture. After reviewing some needed group theoretic concepts, I give a detailed proof of the O'Nan-Scott Theorem. I then examine how the techniques of this proof have been applied to an open problem which asks whether every finite lattice can be embedded as an interval into the subgroup lattice of a finite group.
6

Schur Rings over Infinite Groups

Dexter, Cache Porter 01 February 2019 (has links)
A Schur ring is a subring of the group algebra with a basis that is formed by a partition of the group. These subrings were initially used to study finite permutation groups, and classifications of Schur rings over various finite groups have been studied. Here we investigate Schur rings over various infinite groups, including free groups. We classify Schur rings over the infinite cyclic group.
7

Origamis et groupes de permutation / Origamis and permutation groups

Zmiaikou, David 08 September 2011 (has links)
Un origami est un revêtement du tore T2, éventuellement ramifié au-dessus de l'origine.Cet objet a été introduit par William P. Thurston et William A. Veech dans les années 1970.Un origami peut être vu comme un ensemble fini de copies du carreau unitaire qui sont collées par translations. Ainsi, un origami est un cas particulier d'une surface de translation,un élément de l'espace des modules de surfaces de Riemann munies d'une 1-forme holomorphe.Un origami O avec n carreaux correspond à une paire de permutations (σ, τ ) Є 2 Sn X Sn définie à conjugaison près. Le groupe Mon(O) engendré par une telle paire s'appelle le groupe de monodromie de O. On dit qu'un origami est primitif si son groupe de monodromie est un groupe de permutation primitif. Il y a une action naturelle du groupeGL2(Z) sur les origamis, le stabilisateur de O pour cette action est le groupe de Veechdésigné par GL(O). Le groupe de monodromie est un invariant des GL2(Z)-orbites.Dans le chapitre 3 de la thèse, nous montrons que le groupe de monodromie de tout origami primitif à n carreaux dans la strate H(2k) est An ou Sn si n ≥ 3k + 2, et noustrouvons la borne exacte quand 2k + 1 est premier. La même proposition est vraie pourla strate H(1; 1) si n =/= 6. Dans le chapitre 4, nous considérons les origamis réguliers,i.e. ceux pour lesquels le nombre de carreaux est égal à l'ordre du groupe de monodromie.Nous construisons de nouvelles familles d'origamis intéressantes et cherchons leurs strates et groupes de Veech. Nous estimons également le nombre de GL2(Z)-orbites et strates distinctes des origamis réguliers ayant un groupe de monodromie donné. Afin de trouver une borne inférieure pour les origamis alternés, nous prouvons que chaque permutation dans An quifixe peu de points est le commutateur d'une paire engendrant An. Dans le chapitre 6, nous étudions une propriété de sous-groupes de PSL2(Z) qui est liée à la propriété d'être le groupe de Veech d'un origami. / An origami is a covering of the torus T2, possibly ramified above the origin. This objectwas introduced by William P. Thurston and William A. Veech in 1970s. Un origami can beviewed as a finite collection of copies of the unitary square that are glued by translations.Thus, un origami is a particular case of a translation surface, that is, an element of the moduli space of Riemann surfaces equipped with a holomorphic 1-form.An n-square origami O corresponds to a pair of permutations (σ, τ ) Є 2 Sn X Sn defined up to conjugation. The group Mon(O) generated by such a pair is called the monodromy group of O. We say that an origami is primitive if its monodromy group is a primitive permutation group. There is a natural action of group GL2(Z) on the origamis, the stabilizer of O for this action is the Veech group denoted by GL(O). The monodromy group is aninvariant of the GL2(Z)-orbits.In the chapter 3 of the thesis, we show that the monodromy group of any primitive n-square origami in the stratum H(2k) is either An or Sn if n ≥ 3k + 2, and we find the exact bound when 2k + 1 is prime. The same proposition is true for the stratum H(1; 1) if n =/= 6.In the chapter 4, we consider the regular origamis, i.e. the origamis for which the number of squares equals the order of the monodromy group. We construct new families of origamis and investigate their strata and Veech groups. Also, we estimate the number of distinct GL2(Z)-orbits and strata of regular origamis with a given monodromy group. In order to find a lower bound for alternating origamis, we prove that each permutation in An which fixes few points is the commutator of a pair generating An. In the chapter 6, we study a subgroup property of PSL2(Z) that is related to the property to be the Veech group of an origami.
8

Structures pseudo-finies et dimensions de comptage / Pseudofinite structures and counting dimensions

Zou, Tingxiang 03 July 2019 (has links)
Cette thèse porte sur la théorie des modèles des structures pseudo-finies en mettant l’accent sur les groupes et les corps. Le but est d'approfondir notre compréhension des interactions entre les dimensions de comptage pseudo-finies et les propriétés algébriques de leurs structures sous-jacentes, ainsi que de la classification de certaines classes de structures en fonction de leurs dimensions. Notre approche se fait par l'étude d'exemples. Nous avons examiné trois classes de structures. La première est la classe des H-structures, qui sont des expansions génériques. Nous avons donné une construction explicite de H-structures pseudo-finies comme ultraproduits de structures finies. Le deuxième exemple est la classe des corps aux différences finis. Nous avons étudié les propriétés de la dimension pseudo-finie grossière de cette classe. Nous avons montré qu'elle est définissable et prend des valeurs entières, et nous avons trouvé un lien partiel entre cette dimension et le degré de transcendance transformelle. Le troisième exemple est la classe des groupes de permutations primitifs pseudo-finis. Nous avons généralisé le théorème classique de classification de Hrushovski pour les groupes stables de permutations d'un ensemble fortement minimal au cas où une dimension abstraite existe, cas qui inclut à la fois les rangs classiques de la théorie des modèles et les dimensions de comptage pseudo-finies. Dans cette thèse, nous avons aussi généralisé le théorème de Schlichting aux sous-groupes approximatifs, en utilisant une notion de commensurabilité / This thesis is about the model theory of pseudofinite structures with the focus on groups and fields. The aim is to deepen our understanding of how pseudofinite counting dimensions can interact with the algebraic properties of underlying structures and how we could classify certain classes of structures according to their counting dimensions. Our approach is by studying examples. We treat three classes of structures: The first one is the class of H-structures, which are generic expansions of existing structures. We give an explicit construction of pseudofinite H-structures as ultraproducts of finite structures. The second one is the class of finite difference fields. We study properties of coarse pseudofinite dimension in this class, show that it is definable and integer-valued and build a partial connection between this dimension and transformal transcendence degree. The third example is the class of pseudofinite primitive permutation groups. We generalise Hrushovski's classical classification theorem for stable permutation groups acting on a strongly minimal set to the case where there exists an abstract notion of dimension, which includes both the classical model theoretic ranks and pseudofinite counting dimensions. In this thesis, we also generalise Schlichting's theorem for groups to the case of approximate subgroups with a notion of commensurability

Page generated in 0.1062 seconds