Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 74 for “"Permutation groups"”.
-
Finite permutation groups
<p>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: …
-
Finite Permutation Groups
… with the size and structure of Sylow p-subgroups of a primitive permutation group. The results of Theorems 2.2 and 2.3 were suggested by similar results of Jordan, Manning, Waiss, and othera, about elements of order p in a primitive group. The following are the three main results:</p> …
-
Almost elusive permutation groups
Let <i>G</i> be a transitive permutation group on a finite set Ω with |Ω| ⩾ 2. An element of <i>G</i> is said to be a derangement if it has no fixed points on Ω. As an easy consequence of the orbit counting lemma, <i>G</i> always contains such an element. In fact, by a theorem of Fein, Kantor and …
-
Infinite Jordan Permutation Groups
Abstract If G is a transitive permutation group on a set X, then G is a Jordan group if there is a partition of X into non-empty subsets Y and Z with |Z| > 1, such that the pointwise stabilizer in G of Y acts transitively on Z (plus other non-degeneracy conditions). There is a classification …
-
Loops and Their Permutation Groups
… connections between loops and their associated permutation groups to study certain varieties of loops. We first define a variety of loops generalizing commutative automorphic loops and show this new variety is power associative. We show a correspondence to Bruck loops of odd order and use this …
-
Controlled search over finite permutation groups
… a heuristically controlled search over finite permutation group graphs. The learning system is based on probabilistic analysis. A sample solution is evaluated in detail. Seasonably good results were obtained.
-
Minimal generating pairs for permutation groups
… we consider two-element generation of certain permutation groups. Interest is focussed mainly on the finite alternating and symmetric groups. Specifically, we prove that if k is any integer greater than six, then all but finitely many of the alternating groups A<sub>n</sub> can be generated by …
-
Infinite permutation groups containing all finitary permutations
Groups naturally occu as the symmetries of an object. This is why they appear in so many different areas of mathematics. For example we find class grops in number theory, fundamental groups in topology, and amenable groups in analysis. In this thesis we will use techniques and approaches from …
-
A study of some finite permutation groups
… Conjecture A: Every finite non-regular primitive permutation group of degree n contains permutations fixing one point but fixing at most $n^{1/2}$ points. Conjecture C: Every finite irreducible linear group of degree m > 1 contains an element whose fixed-point space has dimension at most m/2. …
-
Bases for permutation groups and related problems
Let G ⩽ Sym(Ω) be a permutation group on a finite set Ω. A base for G is a subset of Ω with<br/>trivial pointwise stabiliser, and the minimal size of a base is called the base size of G, denoted<br/>b(G). This classical invariant has found a wide range of applications and connections, …
-
On Transitive Extensions of Finite Permutation Groups
Made available in DSpace on 2014-12-09T22:17:42Z (GMT). No. of bitstreams: 1 6808174.pdf: 1871183 bytes, checksum: 5f59675435855a68e4ea06fada74470d (MD5) Previous issue date: 1967
-
Algorithms for Permutation Groups and Cayley Networks
… a key role in the development of algorithms for permutation groups. We analyze the computational complexity of several problems involving bases and SGSs, and we use subgroup towers and SGSs to construct dense networks with practical routing schemes. Given generators for G ≤ Sym(n), we prove that …
-
Subdegree growth rates of infinite primitive permutation groups
… of <em>G</em>. These graphs have many uses in permutation group theory. A graph Γ is said to be <em>primitive</em> if its automorphism group acts primitively on its vertex set, and is said to have <em>connectivity one</em> if there is a vertex <em>α</em> such that the graph Γ\{<em>α</em>} is …
-
The Erdős-Ko-Rado Theorem for Transitive Permutation Groups
Given a transitive permutation group \(G \le Sym(\Omega)\), a subset \(F\) of \(G\) is \(\textit {intersecting}\) if any two elements of \(F\) agree on some elements of \(\Omega\). We are interested in the problem of finding the structure of the largest intersecting families of \(G\). This problem …
-
On Doubly Transitive Permutation Groups of Degree Pq + 1
Made available in DSpace on 2014-12-14T13:09:36Z (GMT). No. of bitstreams: 1 7804122.pdf: 1490839 bytes, checksum: bf0fe5510e2c50d5cb972427eb5c8697 (MD5) Previous issue date: 1977
-
On Doubly Transitive Permutation Groups of Degree 5q + 1
Made available in DSpace on 2014-12-14T13:09:24Z (GMT). No. of bitstreams: 1 7524280.pdf: 1954955 bytes, checksum: 424d08d81f193980776106ccec7374d1 (MD5) Previous issue date: 1975
Page 1 of 4