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 55 for “"permutation group"”.
-
Permutation group invariants of exterior and superpolynomial algebras
… algebras when acted upon by a permutation group. The first focus, contained in Chapter 2 is on the structure, in particular the Hilbert series, of the superpolynomial invariants and antiinvariants of wreath products P [G] = P ⋉ Gn where P ≤ Sn is a permutation group and G is a …
-
A Characterization of the Symplectic Group as A Rank Three Permutation Group
Made available in DSpace on 2014-12-11T18:24:16Z (GMT). No. of bitstreams: 1 7511762.pdf: 3112290 bytes, checksum: eafe4863b7aa11e88422d027bc957fc8 (MD5) Previous issue date: 1974
-
On Steinhaus Sets, Orbit Trees and Universal Properties of Various Subgroups in the Permutation Group of Natural Numbers
… second chapter, we define the orbit tree of a permutation group of natural numbers, and further introduce compressed orbit trees. We show that any rooted finite tree can be realized as a compressed orbit tree of some permutation group. In the third chapter, we investigate certain classes of …
-
On Sharp Permutation Groups whose Point Stabilizers are Certain Frobenius Groups
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 …
-
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. …
-
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.
-
Parameterized Polynomial Systems: Monodromy, Sparse Polynomials, and Solutions
… space of a branched cover to the cover induces a permutation of points in a fibre. The monodromy group of the branched cover is the permutation group generated by all such permutations. When loops are restricted to a particular subset of the base space, the corresponding permutation group induced …
-
Some topics in combinatorial phylogenetics
… question of whether the presence of an abelian permutation group acting regularly on the states is necessary for the application of this technique. New connections between phylogenetics and algebraic combinatorics are suggested, especially with (commutative) association schemes.
-
Rank 3 permuation characters and maximal subgroups
Let G be a transitive permutation group acting on a finite set E. Let P be a stabilizer in G of a point in E. We say G is primitive rank 3 on E if P is maximal in G and P has exactly three orbits on E. For any subgroup H of G, we denote by 1 \(\frac{G}{H}\) the permutation character or permutation …
-
Symmetric Generation
… the form $m^{*n} : N$ where $m^{*n}$ is a free group and $N$ is a permutation group of degree $n$. But, $m^{*n} : N$ is a group of infinite order so we will factor by the necessary relations to get finite homomorphic images. These groups are constructed through the manual double coset …
-
MANUAL SYMMETRIC GENERATION
… the from $m^{*n} : N$ where $m^{*n}$ is a free group and $N$ is a permutation group of degree $n$. Now $m^{*n} : N$ is a group of infinite order so we will factor by the necessary relations to get the finite homomorphic images. We construct these groups through the method of double coset …
-
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> …
-
The Representation Theory of the Symmetric Groups
… 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 …
-
Branched covering spaces of S³ ⁺ corresponding to represented links
… → S<sub>d</sub>, where S<sub>d</sub> is the permutation group on d letters. It is also shown that M is connected if and only if W is transitive. Further research in the same area is discussed in Chapter 5.</p>
-
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 …
-
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 …
-
Relation algebras and vertex conditions in graph theory
… superscheme (Q,[Gamma]'*) if and only if it is a permutation group scheme, i.e. there exists a transitive, multiplicity-free permutation group G acting on Q such that each partition [Gamma superscript n] of the superscheme is the set of orbits of G acting componentwise on Q[superscript n]+2. A …
-
Markov chain mixting time, card shuffling and spin systems dynamics
… models of card shuffling (random walk on the permutation group $S_n$) and the Swendsen-Wang dynamics of the mean-field Ising Model. We show that the Card-Cyclic to Random shuffle has mixing time of order $\Theta(n \log n)$ (joint work of Ben Morris and Yuval Peres). We also determine the order …
-
Galois Theory and its Application to the Problem of Solvability by Radicals of an Equation Over a Field of Prime or Zero Characteristic
… theorem states the relationships of the subgroups of a permutation group of the root field of an equation to the subfields which are left invariant by these subgroups. Extensions of the basic theorem conclude Part I. In part II the solvability of equations by radicals is discussed, for …
Page 1 of 3