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 25 for “"Combinatorial enumeration problems"”.

  1. 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 …

    vt Repository record for A reformulation-linearization based implicit enumeration algorithm for the rectilinear distance location-allocation problem (opens in a new tab)

  2. Genus one enumerative invariants in Pn

    Thesis (Ph. D.)--Michigan State University. Department of Mathematics, 1995

    msu Repository record for Genus one enumerative invariants in Pn (opens in a new tab)

  3. 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 …

    uvic Repository record for Combinatorial algorithms on partially ordered sets (opens in a new tab)

  4. 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 …

    binghamton Repository record for An analytic approach to problems connected with plane tree enumeration (opens in a new tab)

  5. 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>, …

    oxford Repository record for Topics in computational complexity (opens in a new tab)

  6. 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 …

    reykjavik Repository record for Finding structure in permutation sets (opens in a new tab)

  7. Proof-number search in automated enumeration of combinatorial classes

    … method in computer science. One of the main problems 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 …

    reykjavik Repository record for Proof-number search in automated enumeration of combinatorial classes (opens in a new tab)

  8. 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 …

    msu Repository record for Bijective proofs for the shuffle compatibility of descent statistics (opens in a new tab)

  9. Construction of homomorphic images

    This thesis constructs several finite homomorphic images of infinite semi-direct products of the form 2*n:N.

    csusb Repository record for Construction of homomorphic images (opens in a new tab)

  10. Construction of homomorphic images

    This thesis constructs several finite homomorphic images of infinite semi-direct products of the form 2*n:N.

    csusb-retro Repository record for Construction of homomorphic images (opens in a new tab)

  11. 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 …

    nps Repository record for A heuristic algorithm for U.S. naval mission resource allocation (opens in a new tab)

  12. 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.

    csusb Repository record for Symmetric generation (opens in a new tab)

  13. 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 …

    csusb Repository record for Monomial and permutation representation of groups (opens in a new tab)

  14. Homomorphic images of semi-direct products

    … give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

    csusb Repository record for Homomorphic images of semi-direct products (opens in a new tab)

  15. 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.

    csusb-retro Repository record for Symmetric generation (opens in a new tab)

  16. 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 …

    csusb-retro Repository record for Monomial and permutation representation of groups (opens in a new tab)

  17. Homomorphic images of semi-direct products

    … give useful techniques to perform double coset enumeration of groups with symmetric presentations over their control groups.

    csusb-retro Repository record for Homomorphic images of semi-direct products (opens in a new tab)

  18. Symmetric presentation of finite groups

    The main goal of this project is to construct finite homomorphic images of monomial infinite semi-direct products which are called progenitors. In this thesis, we provide an alternative convenient and efficient method. This method can be applied to many groups, including all finite non-abelian …

    csusb Repository record for Symmetric presentation of finite groups (opens in a new tab)

  19. Symmetric presentation of finite groups

    The main goal of this project is to construct finite homomorphic images of monomial infinite semi-direct products which are called progenitors. In this thesis, we provide an alternative convenient and efficient method. This method can be applied to many groups, including all finite non-abelian …

    csusb-retro Repository record for Symmetric presentation of finite groups (opens in a new tab)

  20. Enumeration and symmetric presentations of groups, with music theory applications

    The purpose of this project is to construct groups as finite homomorphic images of infinite semi-direct products. In particular, we will construct certain classical groups and subgroups of sporadic groups, as well groups with applications to the field of music theory.

    csusb Repository record for Enumeration and symmetric presentations of groups, with music theory applications (opens in a new tab)

Page 1 of 2