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 73 for “"Partially ordered sets"”.
-
Fundamentals of Partially Ordered Sets
… 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.
-
Combinatorial algorithms on partially ordered sets
… 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 …
-
The weakness of partially ordered sets
Master of Science (M.S.)
-
Some Properties of Partially Ordered Sets
… 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.
-
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 …
-
Generic filters in partially ordered sets
… (epsilon) 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 …
-
Combinatorial channels from partially ordered sets
… classical 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 …
-
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 …
-
Dimension and Ramsey results in partially ordered sets.
… is the dimension results on different classes of partially ordered sets. We developed new tools and theorems to solve the bounds on interval orders using different number of lengths. We also discussed the dimension of interval orders that have a representation with interval lengths in a certain …
-
Sorting and Selection Problems in Partially Ordered Sets
Σε αυτή την εργασία παρουσιάζουμε κάποια αποτελέσματα από την βιβλιογραφία σχετικά με προβλήματα ταξινόμησης και επιλογής σε μερικώς διατεταγμένα σύνολα. Στο πρόβλημα ταξινόμησης μας δίνεται ένα μερικώς διατεταγμένο σύνολο U και, επιπλέον, μια συνάρτηση μαντείου. Έχουμε την δυνατότητα να …
-
Combinatorial problems for graphs and partially ordered sets
… about the connections between the dimension of posets and the size of matchings in comparability and incomparability graphs. In 1951, Hiraguchi proved that for any finite poset P, the dimension of P is at most half of the number of points in P. We develop some new inequalities for the dimension of …
-
Algebraic Combinatorics on Partially Ordered Sets and Graphs
Thesis (Ph.D.)--Michigan State University. Mathematics - Doctor of Philosophy, 2025
-
Some results on linear discrepancy for partially ordered sets
… in 2001, proposing it as a way to measure a partially ordered set's distance from being a linear order. In addition to proving a number of results about linear discrepancy, they posed eight challenges and questions for future work. This dissertation completely resolves one of those challenges …
-
A study of discrepancy results in partially ordered sets
… the notions of linear and weak discrepancy of a partially ordered set or poset. Linear discrepancy for a poset is the least k such that for any ordering of the points in the poset there is a pair of incomparable points at least distance k away in the ordering. Weak discrepancy is similar to …
-
Problems and results in partially ordered sets, graphs and geometry
… the height sequence of an element of a partially ordered set. Let $x$ be an element of the partially ordered set $P$. Then $h_i(x)$ is the number of linear extensions of $P$ in which $x$ is in the $i$th lowest position. The sequence ${h_i(x)}$ is called the height sequence of $x$ in $P$. …
-
Intrinsic topologies on partially ordered sets and results on compact semigroups
… major chapters of this work are concerned with partially ordered sets and compact semigroups, respectively.</p><p>In Chapter II, the concepts of a continuous lattice and a generalized continuous lattice are extended to the setting of a partially ordered set. Several notions of convergence are …
-
Forbidding and Enforcing of Formal Languages, Graphs, and Partially Ordered Sets
… Several normal forms for forbidding and enforced sets are stated and proved. This work introduces the notion of forbidding and enforcing to posets where fe-systems are used to define families of subsets of a given poset, which in some sense generalizes language fe-systems. Poset fe-systems are, …
Page 1 of 4