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 6 of 6 for “"Antichains"”.
-
Antichains of interval orders and semiorders, and Dilworth lattices of maximum size antichains
… of two parts. In the first part we count antichains of interval orders and in particular semiorders. We associate a Dyck path to each interval order, and give a formula for the number of antichains of an interval order in terms of the corresponding Dyck path. We then use this formula to …
-
Order Theory and Nonparametric Analysis for Interval Censored Data
… on the natural linear ordering of maximal antichains in interval orders. We also propose a method whereby sets from this partition can be generated with known probability so as to permit efficient cluster or staged sampling. These techniques, among other uses, may be applied to generate …
-
Chain and antichain enumeration in posets, and b-ary partitions
… theorem says that the lengths of chains and antichains in any poset are intimately related via an integer partition, but very little is known about the partition [lambda](P) for most posets P. Our first goal is to develop a method for calculating values of [lambda]k(P) for certain posets. We …
-
Extremal, Probabilistic, and Infinitary Problems in Combinatorics
… in particular the structure of chains and antichains in infinite posets. A poset P is said to satisfy the finite antichain condition, or FAC, if it has no infinite antichain. It was conjectured by Aharoni and Korman in 1992 that any FAC poset P possesses a chain C and a partition into …
-
Combinatorial Problems with Geometric Flavour
… Balogh, Mycroft, and Treglown on the number of antichains in a random subset of the Boolean lattice. Chapter 10 is devoted to positional games. For two graphs $B$ and $H$ the strong Ramsey game $\mathcal{R}(B,H)$ on the board $B$ and with target $H$ is played as follows. Two players alternately …
-
Automaty v rozhodovacích procedurách a výkonnostní analýze
Tato práce se věnuje vylepšení současného stavu formalní analýzy a verifikace založené na automatech a zaměřené na systémy s nekonečnými stavovými prostory. V první části se práce zabývá dvěma rozhodovacími procedurami pro logiku WS1S, které jsou založené na korespondenci mezi formulemi logiky WS1S …