• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 17
  • 2
  • 1
  • Tagged with
  • 27
  • 27
  • 27
  • 13
  • 7
  • 5
  • 5
  • 4
  • 4
  • 4
  • 3
  • 3
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

T-Split interval orders /

Moller, Trisha, January 2004 (has links)
Thesis (Ph. D.)--Lehigh University, 2004. / Includes vita. Includes bibliographical references (leaves 73-74).
2

On the dimension of partially ordered sets

Komm, Horace. January 1900 (has links)
Thesis--University of Michigan. / "Reprinted from American journal of mathematics, vol. LXX, no. 3, July, 1948."
3

Some Properties of Partially Ordered Sets

Hudson, Philip Wayne 08 1900 (has links)
It may be said of certain pairs of elements of a set that one element precedes the other. If the collection of all such pairs of elements in a given set exhibits certain properties, the set and the collection of pairs is said to constitute a partially ordered set. The purpose of this paper is to explore some of the properties of partially ordered sets.
4

Fundamentals of Partially Ordered Sets

Compton, Lewis W. 08 1900 (has links)
Gives the basic definitions and theorems of similar partially ordered sets; studies finite partially ordered sets, including the problem of combinatorial analysis; and includes the ideas of complete, dense, and continuous partially ordered sets, including proofs.
5

A polynomial LYM inequality and an association scheme on a lattice

Ford, Pari L. January 2008 (has links)
Thesis (Ph.D.)--University of Nebraska-Lincoln, 2008. / Title from title screen (site viewed Dec. 15, 2008). PDF text: vi, 93 p. ; 616 K. UMI publication number: AAT 3333017. Includes bibliographical references. Also available in microfilm and microfiche formats.
6

Order-theoretic results for sets of monomials

McCrary, Laura C. 01 January 1998 (has links)
No description available.
7

Enumerative combinatorics of posets

Carroll, Christina C. January 2008 (has links)
Thesis (Ph. D.)--Mathematics, Georgia Institute of Technology, 2008. / Committee Chair: Tetali, Prasad; Committee Member: Duke, Richard; Committee Member: Heitsch, Christine; Committee Member: Randall, Dana; Committee Member: Trotter, William T.
8

On comparability of random permutations

Hammett, Adam Joseph, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 115-119).
9

Combinatorial algorithms on partially ordered sets

Koda, Yasunori 29 June 2018 (has links)
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 themselves. First, we present two algorithms for listing ideals of a forest poset. These algorithms generate ideals in a Gray Code manner, that is, consecutive ideals differ by exactly one element. Both algorithms use storage O(n), where n is the number of elements in the poset. The first algorithm traverses, at each phase, the current ideal being listed and runs in time O(nN), where N is the number of ideals of the poset. The second algorithm mimics the first but eliminates the traversal and runs in time O(N). This algorithm has the property that the amount of computation between successive ideals is O(1). Secondly, we give orderly algorithms for constructing acyclic digraphs, acyclic transitive digraphs, finite topologies and finite topologies and finite lattices. For the first time we show that the number of finite lattices on 11, 12, and 13 elements are 37622, 262775, and 2018442, respectively, and the number of finite topologies on 8 and 9 elements are 35979 and 363083, respectively. We also describe orderly algorithms for generating k-colored graphs. We present, in particular, an algorithm for generating connected bicolorable graphs. We also prove some properties of a canonic matrix which might be generally useful for improving the efficiency of orderly algorithms. / Graduate
10

Generalized total and partial set covering problems

Parrish, Edna L. January 1986 (has links)
This thesis is concerned with the development of two generalized set covering models. The first model is formulated for the total set covering problem where cost is minimized subject to the constraint that each customer must be served by at least one facility. The second model is constructed for the partial set covering problem in which customer coverage is maximized subject to a budget constraint. The conventional formulations of both the total set covering and partial set covering problems are shown to be special cases of the two generalized models that arc developed. Appropriate solution strategies arc discussed for each generalized model. A specialized algorithm for a particular case of the partial covering problem is constructed and computational results are presented. / M.S.

Page generated in 0.1211 seconds