Spelling suggestions: "subject:"permutation groups."" "subject:"ermutation groups.""
1 |
On closures of finite permutation groups /Xu, Jing. January 2005 (has links)
Thesis (Ph.D.)--University of Western Australia, 2006.
|
2 |
Bases of primitive permutation groupsFawcett, Joanna Bethia January 2013 (has links)
No description available.
|
3 |
Equally distributed permutation groups /Scrandis, Ann Bertha January 1975 (has links)
No description available.
|
4 |
Equidistributed semilinear groups /Woltermann, Michael Leopold January 1979 (has links)
No description available.
|
5 |
Finite permutation groupsLiebeck, Martin W. January 1979 (has links)
Two problems in the theory of finite permutation groups are considered in this thesis:<ul><li> A. transitive groups of degree p, where p = 4q+1 and p,q are prime,</li><li> B. automorphism groups of 2-graphs and some related algebras.</li></ul> Problem A should be seen in the following context: in 1963. N.Ito began a study of insoluble, transitive groups G of degree p on a set Ω, where p = 2q+1 and p,q are prime, showing among other things, that such a group G is 3-transitive. His methods involve the modular character theory of G for both the primes p and q (developed by R.Brauer). He uses this theory to prove facts about the permutation characters of G associated with Ω<sup>(2)</sup> and Ω<sup>{2}</sup>, the sets of ordered and unordered pairs (respectively) of distinct elements of Ω. The first part of this thesis represents an attempt to extend these methods to the case p = 4q+1. The main result obtained is Theorem. Let G be an insoluble, transitive permutation group of degree p, where p = 4q+1 and p.q are prime with p>13. Then G is 3-transitive. Also some progress is made towards a proof that the groups in Problem A are 4-transitive. In the second part of this thesis (Problem B) certain algebras are defined from 2-graphs as follows: let (Ω,Δ) be a 2-graph, that is, Δ is a set of 3-subsets of a finite set Ω such that every 4-subset of Ω contains an even number of elements of Δ. Write Ω= {e<sub>1</sub>....,e<sub>n</sub>}. Given any field F of characteristic 2, make FΩ into an algebra by defining [see text for continuation of abstract].
|
6 |
Orthomorphisms of Boolean GroupsSchimanski, Nichole Louise 12 August 2016 (has links)
An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x) is also a permutation. In this paper, we consider orthomorphisms of the additive group of binary n-tuples, Zn2. We use known orthomorphism preserving functions to prove a uniformity in the cycle types of orthomorphisms that extend certain partial orthomorphisms, and prove that extensions of particular sizes of partial orthomorphisms exist. Further, in studying the action of conjugating orthomorphisms by automorphisms, we find several symmetries within the orbits and stabilizers of this action, and other orthomorphism-preserving functions. In addition, we prove a lower bound on the number of orthomorphisms of Zn2 using the equivalence of orthomorphisms to transversals in Latin squares. Lastly, we present a Monte Carlo method for generating orthomorphisms and discuss the results of the implementation.
|
7 |
Reducible partitions of permutation groups and the reconstruction of graphs from pendant vertex deleted subgraphs /Anacker, Steven Edward January 1978 (has links)
No description available.
|
8 |
On the composition factors of some permutation modulesRashwan, Osama Agami January 2000 (has links)
No description available.
|
9 |
Infinite product groups /Penrod, Keith, January 2007 (has links) (PDF)
Thesis (M.S.)--Brigham Young University. Dept. of Mathematics, 2007. / Includes bibliographical references (p. 27-28).
|
10 |
On Orbit Equivalent Permutation GroupsYang, Keyan 17 October 2008 (has links)
No description available.
|
Page generated in 0.1088 seconds