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 393 for “"Enumeration"”.

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

    strathclyde Repository record for Interval order enumeration (opens in a new tab)

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

    aberta Repository record for Finite model enumeration (opens in a new tab)

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

    oxford-brookes Repository record for Enumeration of polyhedral graphs (opens in a new tab)

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

    uiuc Repository record for Enumeration Reducibility and Partial Degrees (opens in a new tab)

  5. Enumeration in algebra and geometry

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1997.

    mit Repository record for Enumeration in algebra and geometry (opens in a new tab)

  6. Pólya's Enumeration Theorem and Its Applications

    This thesis presents and proves Pólya's enumeration theorem (PET) along with the necessary background knowledge. Also, applications are presented in coloring problems, graph theory, number theory and chemistry. The statement and proof of PET is preceded by detailed discussions on Burnside's lemma, …

    helsinki Repository record for Pólya's Enumeration Theorem and Its Applications (opens in a new tab)

  7. Enumeration Results On Leaf Labeled Trees

    <p>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 …

    south-carolina Repository record for Enumeration Results On Leaf Labeled Trees (opens in a new tab)

  8. Isolation, Enumeration and Identification of Enterococci

    In the United States the presence of the coliform group of organisms, especially Escherichia coli, serves as an indicator of fecal contamination. In recent years there has been a steady increase of interest in the enterococci, members of the genus Streptococci, as indicators. |It is still debatable …

    creighton Repository record for Isolation, Enumeration and Identification of Enterococci (opens in a new tab)

  9. Extremal graph theory: supersaturation and enumeration

    In this thesis, we study supersaturation and enumeration problems in extremal combinatorics. In Chapter 2, with Balogh, we disprove a conjecture of Erdos and Tuza concerning the number of different ways one can create a copy of K_4, a complete graph on 4 vertices, in a K_4-free graph. In Chapter 3, …

    uiuc Repository record for Extremal graph theory: supersaturation and enumeration (opens in a new tab)

  10. Visual Enumeration: Subitizing and Its Nature

    … examine the role of subitizing in ongoing visual enumeration processes, three experiments were conducted using saccade-continent display change technique and peripheral preview paradigm. The results shows that numerical information of up to 3 or 4 items can be quickly enumerated from an extrafovea …

    uiuc Repository record for Visual Enumeration: Subitizing and Its Nature (opens in a new tab)

  11. Enumeration and classification of ribbon knots

    … in the 3-sphere. In this work we investigate an enumeration procedure for such disks and study a natural topological grouping of related ribbons which differ by twists along imbedded bands. When the knots under consideration possess a hyperbolic structure, we use a limiting process to show that a …

    uiuc Repository record for Enumeration and classification of ribbon knots (opens in a new tab)

  12. Combinatorial enumeration of weighted Catalan numbers

    This thesis is devoted to the divisibility property of weighted Catalan and Motzkin numbers and its applications. In Chapter 1, the definitions and properties of weighted Catalan and Motzkin numbers are introduced. Chapter 2 studies Wilf conjecture on the complementary Bell number, the alternating …

    mit Repository record for Combinatorial enumeration of weighted Catalan numbers (opens in a new tab)

  13. Generating functions and enumeration of sequences.

    Thesis. 1977. Ph.D.--Massachusetts Institute of Technology. Dept. of Mathematics.

    mit Repository record for Generating functions and enumeration of sequences. (opens in a new tab)

  14. Classification and Enumeration of Autonomous Sequential Machines

    Made available in DSpace on 2014-12-08T22:24:18Z (GMT). No. of bitstreams: 1 6801844.pdf: 3273828 bytes, checksum: 14dc083d97fe40169810dc1e426c3328 (MD5) Previous issue date: 1967

    uiuc Repository record for Classification and Enumeration of Autonomous Sequential Machines (opens in a new tab)

  15. Enumeration, algorithms, and complexity in algebraic combinatorics

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-09-01 without embargo terms

    uiuc Repository record for Enumeration, algorithms, and complexity in algebraic combinatorics (opens in a new tab)

  16. Two enumeration problems about the Aztec diamonds

    Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1991.

    mit Repository record for Two enumeration problems about the Aztec diamonds (opens in a new tab)

Page 1 of 20