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 1365 for “"permutation"”.
-
Permutation
This is a story of two spatial designers: The Mathematician and the Architect. In the four dimensional space of a Mathematician, most physical realities must be ignored in order for the space to remain pure. The visual, one of the most powerful tools of the Architect, can coexist within the …
-
Permutation
… 2020 Ceramics Abstract: Chairperson: Trey Hill Permutation, is an exploitation of utilitarian pottery and domesticity within the gallery setting through the use of handmade tables and cabinetry. The gallery is transformed into a more comfortable environment and exhibits a casual essence. This …
-
Permutation
… 2020 Ceramics Abstract: Chairperson: Trey Hill Permutation, is an exploitation of utilitarian pottery and domesticity within the gallery setting through the use of handmade tables and cabinetry. The gallery is transformed into a more comfortable environment and exhibits a casual essence. This …
-
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
… 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> <p><em>Theorem 2.1</em>. If …
-
Permutation and Monomial Progenitors
We searched monomial and permutation progenitors for symmetric presentations of important images, nonabelian simple groups, their automorphism groups, or groups that have these as their factor groups. In this thesis, we described our search for the homomorphic images through the permutation …
-
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 …
-
Permutation polynomials and systems of permutation polynomials in several variables over finite rings
… the historical development of theorems regarding permutation polynomials in several variables over finite fields. Single variable permutation polynomials will be discussed since they are so important to the discussions which will follow. Theorems involving permutation polynomials and systems of …
-
Permutation Polynomials of Finite Fields
<p>A permutation polynomial of a finite field K is one for which the associated polynomial function is a one-to-one map from K onto itself. The purpose of this paper is to explain and demonstrate how algebraic geometry can be employed in determining permutation polynomials of finite fields of …
-
Power Domination on Permutation Graphs
… We will consider this problem as it relates to permutation graphs on cycles, and suggest upper bounds for the power domination numbers on such graphs.
-
Permutation Steganography in Many Systems
… of steganography and cryptology makes use of permutations. The initial idea of permeation steganography was developed independently by Peter Hendrickson (1). Here we extended on his idea by adding composition of permutations into the reply step. We have also included cycle notation; this …
-
Inverse limits of permutation maps
… on [0; 1] with bonding maps chosen from the permutation family of Markov maps. For such inverse limits, we examine the occurrence of indecomposability, the number of end points in the continuum, and the types of subcontinua present in the continuum. We provide a process for determining the …
-
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 …
Page 1 of 69