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 27 for “"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 …
-
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 …
-
Edge labellings of partially ordered sets
… elements. We next study finite graded bounded posets that have Sn EL-labellings and describe a type A 0-Hecke algebra action on their maximal chains. This action is local and the resulting representation of these Hecke algebras is closely related to the flag h-vector. We show that finite graded …
-
Decomposition and enumeration in partially ordered sets
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1999.
-
Property testing for distributions on partially ordered sets
We survey the results of Rubinfeld, Batu et al. ([2], [3]) on testing distributions for monotonicity, and testing distributions known to be monotone for uniformity. We extend some of their results to new partial orders, and provide evidence for some new conjectural lower bounds. Our results apply …
-
Partially ordered sets with hooklengths : an algorithmic approach.
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1979
-
Extermal problems in dimension theory for partially ordered sets
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 1973
-
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$. …
-
Studies in connectivity
… on the structure of highly connected graphs and partially ordered sets.
-
Topics in combinatorics and combinatorial algorithms
… topics. The first is a structural parameter for partially ordered sets (posets). The parameter that we study is the interval number of a poset, denoted by i(P) for a poset P. The interval number is related to a well-studied poset parameter, partial order dimension. We derive an upper bound on the …
-
Differential posets and dual graded graphs
In this thesis I study r-differential posets and dual graded graphs. Differential posets are partially ordered sets whose elements form the basis of a vector space that satisfies DU-UD=rI, where U and D are certain order-raising and order-lowering operators. New results are presented related to the …
-
Zero Divisor Graphs and Poset Decomposition
… algebraic stuctures such as semigroups and partially ordered sets. In this paper, we will discuss some known results on zero-divisor graphs of posets as well as the concept of compactness as it relates to zero-divisor graphs. We will dicuss equivalence class graphs defined on the elements of …
-
On Partially Ordered Rings
No abstract prepared.
-
A Theory of Stationary Trees and the Balanced Baumgartner-Hajnal-Todorcevic Theorem for Trees
… height. We define the diagonal union of subsets of a tree, as well as normal ideals on a tree, and we characterize arbitrary subsets of a non-special tree as being either stationary or non-stationary. We then use this theory to prove the following partition relation for trees: Main Theorem. …
-
The Quicksort algorithm and related topics
… advance. We discuss a number of cases where the partially ordered sets arise at random. To this end, we employ results from Graph and Information Theory. Finally, we obtain an alternative bound on the number of linear extensions when the partially ordered set arises from a random graph, and …
-
AN INTRODUCTION TO BOOLEAN ALGEBRAS
… used a particular notation. The ideas of partially ordered sets, lattices, least upper bounds, and greatest lower bounds were used to define the structure of a Boolean algebra. From this fundamental understanding, we were able to study atoms, Boolean algebra isomorphisms, and Stone’s …
-
PROBABILISTIC MODELS FOR DEPENDENT VARIABLES: COMPLEX ANALYTIC AND COMBINATORIAL APPROACHES
… the characterization of MAT-freeness in terms of partially ordered sets.
-
A partial order approach to decentralized control
… of linear systems. We employ the theory of partially ordered sets (posets) to model and analyze a class of decentralized control problems. Posets have attractive combinatorial and algebraic properties; the combinatorial structure enables us to model a rich class of communication structures …
-
A computational approach to higher categories
… objects. Moreover, we show that the category of partially ordered sets is the free conservative cocompletion of the category of finite (non-empty) totally ordered sets. Although this is a self-contained result, it also motivates the use of posets in layout and anticontraction.
-
Combinatorics of acyclic orientations of graphs : algebra, geometry and probability
… labellings of its vertex-set with a totally ordered set, and they can be regarded as partially ordered sets. We will study this connection between acyclic orientations of a graph and the theory of linear extensions or topological sortings of a poset, from both the points of view of poset …
Page 1 of 2