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 67 for “"Non isomorphic"”.
-
Graph Distinguishability and the Generation of Non-Isomorphic Labellings
… of the vertices of G with colours such that no non-trivial automorphism of G preserves all colours. The distinguishing number of G is the minimum number of colours in a distinguishing colouring. This thesis presents a survey of the history of distinguishing colouring problems and proves new …
-
An algorithm for computing non-isomorphic semigroups of finite order.
In this paper an algorithm for computing semigroups of finite order is discussed. A computation procedure is developed to generate, for any specified finite order, all semigroups which are distinct up to isomorphism. Additional restrictions are also placed in the generating procedure to produce all …
-
Development of upper limb customized non- isomorphic VR interact ions for reaching, grabbing, and placing objects
… (VE). Alleviating reach has been studied for isomorphic 3DUIs (equal translation of controller movement) whereas non-isomorphic interactions (adjusted controller visuals in VR) are an immerging topic for its benefits by considering user variability and physical limitation in VR. This thesis …
-
Higher-order linking forms
Trotter [T] found examples of knots that have isomorphic classical Alexander modules, but non-isomorphic classical Blanchfield linking forms. T. Cochran [C] defined higher-order Alexander modules, An , (K), of a knot, K, and higher-order linking forms, Bℓn (K), which are linking forms defined …
-
STRUCTURAL SYNTHESIS AND ANALYSIS OF PLANAR AND SPATIAL MECHANISMS SATISFYING GRUEBLER'S DEGREES OF FREEDOM EQUATION
… and the focus of this work are: synthesis of all non-isomorphic kinematic mechanisms; detection of all non-isomorphic pairs of mechanisms; and, classification of kinematic mechanisms based on type of mobility. Also, one of the important steps in the synthesis of kinematic mechanisms is the …
-
Computer generation of regular graphs
… a study of the problem of computer generation of non-isomorphic regular graphs of degree d on n points. The uork consists of a study of various properties and representations of regular graphs and a discussion of hov these might be useful in solving the isomorphism problem in the computer …
-
Συμβολή στη θεωρία σχεδιασμών, κωδίκων και κρυπτογραφίας
… The other two stands on the idea of extending non-isomorphic orthogonal arrays. Also, an efficient way of distinguishing the non-isomorphic orthogonal arrays was developed with the use of the hamming distance and the max-int algorithm. The non isomorphic orthogonal arrays with parameters …
-
Conceptual Design of Dual Cam Mechanisms Using Graph Theory
… bit mapping were used to developed all possible non-isomorphic graphs for various classes of mechanisms. A classification method was developed using common occurring substructures found in the graphs. This classification scheme was used for conversion of graphs into schematics. Once the results …
-
A study of some rings of finite power
… into the determination of the numbers of non-isomorphic rings that exist for some finite orders. Evidently very few writers have pursued this topic. D. M. Bloom, in answer to an earlier posed problem, gave the results for order four in the American Mathematical Monthly , volume 71, …
-
Isomorphisms amongst certain classes of cyclically presented groups
… of Lucas numbers). The values of the number of non-isomorphic G_n(m, k) groups was conjectured by Cavicchioli, O’Brien and Spaggiari for n = p^l, where p is prime and l is a positive integer, we show that these values provide an upper bound for the number of non-isomorphic G_n(m, k) groups. We …
-
Algebraic Approach to Quantum Isomorphisms
… We have started with two pairs of quantum isomorphic graphs and looked for generalizations of those. We have learned that those two pairs of graphs are related by Godsil-McKay switching and one of the graphs is an orthogonality graph of lines in a root system. These two observations lead to …
-
Cyclic Designs
… block (PBIS) designs. In this dissertation all non-isomorphic designs for combinations of n, k, and r are enumerated, and their efficiencies computed. Non-isomorphic designs are those which are not derivable from any other by a relabeling or permutation of the object labels. A method of analysis …
-
TOPICS IN ALGEBRAIC DYNAMICS
… classification of projective varieties admitting non-isomorphic endomorphisms; (2) interaction between arithmetic geometry and algebraic dynamics; (3) automorphism groups of algebraic/analytic varieties.
-
Distributive Proper Forcing Axiom
… first uncountable cardinal and the existence of non isomorphic aleph_1- dense subsets of the real line. An application of these results is that DPFA can be separated from other fragments of PFA.
-
Profinite rigidity of group extensions
… which finite quotients can distinguish between non-isomorphic groups G sharing a fixed normal subgroup N and a fixed quotient Q ∼= G/N. We generally assume that Q and N are finitely generated and that Q is good in the sense of Serre. Two broad themes in this study are profinite conjugacy of …
-
Automorphisms and endomorphisms of first-order structures
… permutation monoid with group of units isomorphic to G. The main result of the thesis is an analogue of Fra¨ıss´e’s theorem covering twelve of the eighteen notions of homomorphism-homogeneity; this contains both Fra¨ıss´e’s theorem, and a version of this for MM-homogeneous structures by …
-
Methods for Investigating Finitely-Presented Groups
… that the groups in another family are pairwise non-isomorphic. Also we describe the method of “pictures” over group presentations, discussing what they represent and how they can be used to obtain information about the group
-
COMBINATORIAL PROBLEMS RELATED TO CODES, DESIGNS AND FINITE GEOMETRIES
… $m$, and equality holds if and only if $D'$ is isomorphic to $D$. We discuss some properties of the three known nonisomorphic 2-(64,16,5) designs of 2-rank 16, one being the design of the planes in the 3-dimensional affine geometry over the field of order 4. We also try to find an algebraic way …
-
Almost completely decomposable groups with two critical types and their endomorphism rings
… is used to give an example of two nearly isomorphic groups with non-isomorphic endomorphism rings.
-
Constraint prioritization for efficient test generation using Korat
… using state space exploration to generate non-isomorphic structures. Korat uses a predicate method written by user which defines constraints for the desired data structure. We describe a technique for re-writing the predicate method to enable Korat to generate tests more efficiently.
Page 1 of 4