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 32 for “"Combinatorial enumeration"”.
-
Student Approaches to Combinatorial Enumeration: The Role of Set-Oriented Thinking
… particularly related to students' conceptions of combinatorial ideas. In this study, I describe my investigation of students' thinking as it relates to counting problems. I interviewed a number of post-secondary students as they solved a variety of combinatorial tasks, and through the analysis of …
-
Towards Trustworthy Machine Learning in High-Stakes Decision Making
… improvements of sound bounds while avoiding full combinatorial enumeration of activation patterns. In addition, the thesis establishes a perspective on how model properties influence verifiability and introduces verification-friendly network transformations that improve bound tightness without …
-
Asymptotics and Dynamics of Map Enumeration Problems
… relations for generating functions of map enumeration problems. These are combinatorial maps, an embedding of a graph into a surface in a particular way. The generating functions enumerate the maps according to an appropriate notion of a distance or height in the map. These problems were …
-
A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem
This thesis is concerned with the analysis of a Rectilinear Distance Location Allocation Problem, where the costs are directly proportional to rectilinear distances and the amount shipped. The problem is formulated as a Mixed Integer Bilinear Programming Problem and as a Discrete Location …
-
Genus one enumerative invariants in Pn
Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1995
-
Combinatorial algorithms on partially ordered sets
The main results of this dissertation are various algorithms related to partially ordered sets. The dissertation basically consists of two parts. The first part treats algorithms that generate ideals of partially ordered sets. The second part concerns the generation of partially ordered sets …
-
An analytic approach to problems connected with plane tree enumeration
Combinatorics involves a wide range of enumeration problems. Many such problems have some characteristics in common. As an example, various structures can be related to a set of plane trees that has eliminated all trees that contain any element of a defined set of forbidden substructures. In …
-
Distribution System Resilience Enhancement Using Movable Energy Resources
… resources when needed. The graph theory and combinatorial enumeration technique are leveraged in this task to determine optimal total size and number of MERs. The second task is pre-positioning of MERs. This task is a relatively short-term planning problem, generally performed in a few days …
-
Topics in computational complexity
… concerns the computational complexity of several combinatorial problems.</p><p>Chapter 1 is notation and definitions. In Chapter 2 the subgraph homeomorphism problem, for fixed pattern graphs H, is considered. For the cases H and#x2245; C<sub>6</sub>,C<sub>7</sub>,W<sub>4</sub> or W<sub>5</sub>, …
-
Finding structure in permutation sets
… algorithm, a general framework for searching for combinatorial specifications. To use this, one must write strategies that explain how combinatorial classes are related. We introduce strategies for permutation classes that are used by the CombSpecSearcher algorithm. We provide an algorithm for …
-
Proof-number search in automated enumeration of combinatorial classes
… in enumerative combinatorics is the counting of combinatorial classes, and in recent years, efforts have been made to write algorithms to solve such problems. We show that one of these automated methods, combinatorial exploration, may benefit from the application of already mature artificial …
-
Bijective proofs for the shuffle compatibility of descent statistics
"Define a permutation to be any sequence of distinct positive integers. Given two permutations pi and sigma on disjoint underlying sets, we denote by pi shuffle sigma the set of shuffles of pi and sigma, that is, the set of all permutations obtained by interleaving the two permutations. A …
-
Construction of homomorphic images
This thesis constructs several finite homomorphic images of infinite semi-direct products of the form 2*n:N.
-
Construction of homomorphic images
This thesis constructs several finite homomorphic images of infinite semi-direct products of the form 2*n:N.
-
A heuristic algorithm for U.S. naval mission resource allocation
… algorithms. The developed heuristic uses limited enumeration to generate feasible routes and mission schedules for the ship. In the scenarios tested, the solution produced by the heuristic is not only generated in a fraction of the time of the current algorithms, but the total mission value …
-
Symmetric generation
The purpose of this project is to conduct a systematic search for finite homomorphic images of infinite semi-direct products mn : N, where m = 2,3,5,7 and N <̲ Sn and construct by hand some of the important homomorphic images that emerge from the search.
-
Monomial and permutation representation of groups
The purpose of this project is to introduce another method of working with groups, that is more efficient when the groups we wish to work with are of a significantly large finite order. When we wish to work with small finite groups, we use permutations and matrices. Although these two methods are …
-
Homomorphic images of semi-direct products
… give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.
-
Symmetric generation
The purpose of this project is to conduct a systematic search for finite homomorphic images of infinite semi-direct products mn : N, where m = 2,3,5,7 and N <̲ Sn and construct by hand some of the important homomorphic images that emerge from the search.
-
Monomial and permutation representation of groups
The purpose of this project is to introduce another method of working with groups, that is more efficient when the groups we wish to work with are of a significantly large finite order. When we wish to work with small finite groups, we use permutations and matrices. Although these two methods are …
Page 1 of 2