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 1531 for “"Enumeration"”.
-
Group enumeration
<p>The thesis centres around two problems in the enumeration of <em>p</em>-groups. Define <em>f</em><sub>φ</sub>(<em>p<sup>m</sup></em>) to be the number of (isomorphism classes of) groups of order <em>p<sup>m</sup></em> in an isoclinism class φ. We give bounds for this function as φ is fixed and …
-
Interval order enumeration
… classify such pairs results pertaining to the enumeration of permutations having a given set of ascent bottoms are given. This allows for a new formula for the number of labeled interval orders.
-
Finite model enumeration
… The current best practice of finite model enumeration is to divide the job into two steps: first generate models according to the laws laid down by the first-order formula defining the class of algebra, then in the post-processing step, find only one representative model of each equivalence …
-
Distributed Subgraph Enumeration
Subgraph enumeration is a fundamental graph problem with many applications. However, existing algorithms for subgraph enumeration fall short in handling large graphs due to the computational hardness. In this work, we propose a general approach that solves subgraph enumeration in the distributed …
-
Enumeration of polyhedral graphs
… is concerned with the design of a polyhedron enumeration algorithm. The approach taken focuses on specic classes of polyhedra and their graph theoretic properties. This is then compared more broadly to other graph enumeration algorithms that are concerned with the same or a superset which …
-
Enumeration of Illusory Contours
Visual search and enumeration tasks were used to assess the attentional demands of processing illusory contour figures (figures composed of contours that are perceived despite there being no physical changes in the scene). In all tasks, participants were required to find or enumerate a vertical …
-
Enumeration of inequivalent cycle decompositions
A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.
-
Antibiotic Effects on Coliform Enumeration
… buffer provided less protection. Two methods of enumeration were also studied as to their ability to quantify coliforms inhibited by B. polymyxa. Comparable inhibition was shown using both methods. No significant differences exist between the Standard Plate Count and Membrane Filter techniques. …
-
Algorithmic enumeration of quaternionic lattices
In this thesis, we develop and implement an algorithm in Magma for enumerating isometry classes of quaternionic lattices. This algorithm can be viewed as a higher rank generalization of that used for enumerating equivalence classes of left-ideals of quaternionic orders. Our key technical innovation …
-
Asymptotic enumeration of matrix groups
We prove that the general linear group GLd(pe) has between pd4e/64-O(d2) and pd4e2·log2p distinct isomorphism types of subgroups. The upper bound is obtained by elementary counting methods, where as the lower bound is found by counting the number of isomorphism types of subgroups of the generalized …
-
Genericity in the enumeration degrees
In this thesis we study the notion of enumeration 1-genericity, various basic properties of it and its relationship with 1-genericity. We also study the problem of avoiding uniformity in the �02 enumeration degrees. In Chapter 2 we give a brief background survey of the notion of genericity in the …
-
Enumeration Reducibility and Partial Degrees
Made available in DSpace on 2014-12-09T22:17:52Z (GMT). No. of bitstreams: 1 7000811.pdf: 1491090 bytes, checksum: c324981fa561e937da3037fdc326bb1b (MD5) Previous issue date: 1969
-
Enumeration of general cubic graphs
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 2000
-
Enumeration problems in directed walk models
Self-avoiding walks appear ubiquitously in the study of linear polymers as it naturally captures their volume exclusion property. However, self-avoiding walks are very difficult to analyse with few rigourous results available. In 2008, Alvarez et al. determined numerical results for the forces …
-
Enumeration problems in Baumslag-Solitar groups
… structure. This thesis will look at various enumeration problems that arises in Baumslag-Solitar groups. Initially, this thesis aims to reproduce and validate some of the work that has been done on the questions of growth, cogrowth and geodesic elements via an enumeration approach. This …
-
Enumeration of Dense Modules in Networks
To analyze large networks in various research fields including biology, sociology, and web mining, detection of dense modules (a.k.a. clusters) is a crucial step. Though numerous methods have been proposed to this aim, they often lack mathematical rigor. Namely, there is no guarantee that all dense …
-
Enumeration of the generalized Catalan numbers
… using multiple methods that will build on known enumerations of the Catalan numbers.
-
Enumeration Results On Leaf Labeled Trees
ENUMERATION RESULTS ON LEAF LABELED TREES,Virginia P. Johnson In evolutionary biology, it is common practice to represent the evolution of species, populations, and organisms with graphs, called phylogenetic or species trees. These are rooted leaf-labeled trees where non-root internal vertices have …
Page 1 of 77