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 111 for “"Ordered sets."”.

  1. Fundamentals of Partially Ordered Sets

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

    unt Repository record for Fundamentals of Partially Ordered Sets (opens in a new tab)

  2. The pagenumber of ordered sets.

    … this The pagenumber of a series-parallel planar ordered set is at most two. We present an $O(n\sp3)$ algorithm to construct a two-page embedding in the case that it is a lattice, where n is the number of the elements of the lattice. Once consequence of independent interest, is a characterization …

    ottawa-retro Repository record for The pagenumber of ordered sets. (opens in a new tab)

  3. Linear extensions of ordered sets.

    Abstract Not Available.

    ottawa-retro Repository record for Linear extensions of ordered sets. (opens in a new tab)

  4. Connectivity properties of partially ordered sets

    Electronic Thesis or Dissertation

    alabama Repository record for Connectivity properties of partially ordered sets (opens in a new tab)

  5. Combinatorial algorithms on partially ordered sets

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

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

  6. Some Properties of Partially Ordered Sets

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

    unt Repository record for Some Properties of Partially Ordered Sets (opens in a new tab)

  7. Partially Ordered Sets and Their Invariants

    … invariants can give on the structure of the ordered set on which they are de�ned. We consider the basic de�nitions of an ordered set and see how they are related to one another. We generalize some results on cardinal invariants for ordered sets and state some useful characterizations. We …

    east-anglia Download PDF for Partially Ordered Sets and Their Invariants (opens in a new tab)

  8. The book embedding of ordered sets

    … cost is optimized. In a book embedding for an ordered set, the elements are embedded on the spine of the book to form a linear extension. The pagenumber is the minimum number of pages needed to draw the edges as simple curves such that edges drawn in the same page do not intersect. The book …

    ottawa-retro Repository record for The book embedding of ordered sets (opens in a new tab)

  9. Generic filters in partially ordered sets

    … y(VBAR)(VBAR) is a subset of a partially ordered set P with (VBAR)(VBAR)(IL-PERP)F(VBAR)(VBAR) defined as z (VBAR)z (epsilon) P and z is incompatible with every element of (VBAR)(VBAR)F(VBAR)(VBAR) and with the other connectives defined in their usual set-theoretical interpretations. These …

    iastate Repository record for Generic filters in partially ordered sets (opens in a new tab)

  10. Combinatorial channels from partially ordered sets

    … and modern, using the framework of partially ordered sets. We represent adversarial error models as combinatorial channels, form combinatorial channels from posets, identify a structural property of posets that leads to families of channels with the same codes, and bound the size of codes by …

    uiuc Repository record for Combinatorial channels from partially ordered sets (opens in a new tab)

  11. On the topology of n-ordered sets

    Electronic Thesis or Dissertation

    alabama Repository record for On the topology of n-ordered sets (opens in a new tab)

  12. Symmetric chain decompositions of partially ordered sets

    A partially ordered set, or poset, is a set of elements and a binary relation which determines an order within elements. Various combinatorial properties of finite and ordered posets have been extensively studied during the last 4 decades. The Sperner property states that the size of the largest …

    umn Repository record for Symmetric chain decompositions of partially ordered sets (opens in a new tab)

  13. On the surface geometry of ordered sets.

    … aims. The first is to study upward drawings of ordered sets on two-dimensional surfaces and secondly to study the geometry of the surfaces on which ordered sets can be drawn without crossing edges. Critical points, in particular, saddle points of ordered sets will play a decisive role. The …

    ottawa-retro Repository record for On the surface geometry of ordered sets. (opens in a new tab)

  14. Visualizing ordered sets using force-directed placement.

    … is to study and develop algorithms to visualise ordered sets and secondly to develop algorithms to visualise the faces of complicated ordered sets. To obtain a "pleasing" drawing for an order is an important issue and deserves attention. To this end, the ordered set may be drawn with minimum edge …

    ottawa-retro Repository record for Visualizing ordered sets using force-directed placement. (opens in a new tab)

  15. K-Tuple Sampling From Partially Rank-Ordered Sets

    … burden. Ozturk (2011) introduced Partially Rank-Ordered Set Sampling (PRSS) and showed that even when ties are allowed, estimators can still have lower variance when compared to their simple random sampling counterparts. Thus, the ranking burden can be reduced while still providing more efficient …

    unlv Repository record for K-Tuple Sampling From Partially Rank-Ordered Sets (opens in a new tab) Download PDF for K-Tuple Sampling From Partially Rank-Ordered Sets (opens in a new tab)

  16. Set theoretic and topological characterisations of ordered sets

    … two interlocking nests. Given a collection of subsets \(\mathcal L\) of a set X, van Dalen and Wattel define an order \(\triangleleft\)\(_\mathcal L\) by declaring \(_\mathcal X\) \(\triangleleft\)\(_\mathcal L\) \(_\mathcal Y\) if and only if there exists some L \(\in\) \(\mathcal L\) such that x …

    birmingham Download PDF for Set theoretic and topological characterisations of ordered sets (opens in a new tab)

Page 1 of 6