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 61 for “"partially-ordered set"”.

  1. Extensions of a Partially Ordered Set

    … introduce the concept of a dense extension of a partially ordered set and study some of the properties of the resulting class of extensions. In particular we study the dense distributive extensions, dense Boolean extensions and dense meet continuous extensions of distributive, Boolean and meet …

    mcmaster Repository record for Extensions of a Partially Ordered Set (opens in a new tab)

  2. Dual algorithm for L1 isotonic optimization on a partially ordered set

    <p>Let X be a partially ordered finite set with a partial order <<. A real-valued function g on X is called isotone with respect to << if g(x) ≤ g(y) whenever x, y ϵ X and X << y. Let G(X) be the set of all isotone functions on x. The problem being considered here is:(UNFORMATTED TABLE OR EQUATION …

    iastate Repository record for Dual algorithm for L1 isotonic optimization on a partially ordered set (opens in a new tab)

  3. Use-Bounded Strong Reducibilities

    … We show that any noncomputable c.e. set is part of a uniformly c.e. copy of $(\BQ,\leq)$ in the c.e. cl-degrees within a single wtt-degree; that there exist uncountable chains in each of the degree structures in question; and that any countable partially-ordered set can be embedded …

    waterloo Repository record for Use-Bounded Strong Reducibilities (opens in a new tab)

  4. COMBINATORIAL PROPERTIES OF ALGEBRAIC SETS

    … we investigate those properties of an algebraic set that are determined by its partially ordered set of subvarieties. These properties are called the combinatorial properties of the algebraic set. We say that two algebraic sets are combinatorially equivalent (or homeomorphic) if their partially …

    nebraska Repository record for COMBINATORIAL PROPERTIES OF ALGEBRAIC SETS (opens in a new tab)

  5. Generic filters in partially ordered sets

    … a central role in the present day development of Set Theory;In this dissertation, we consider questions related to both of the above concepts;In Section 2, we prove the existence of a model (M,(ELEM)) for the unrestricted Comprehension Scheme;((FOR ALL)x)((x (epsilon) M) (--->) ((THERE …

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

  6. Progress on the 1/3 - 2/3 conjecture

    Let (P,<) be a finite partially ordered set, also called a poset, and let n denote the cardinality of P. Fix a natural labeling on P so that the elements of P correspond to [n] = {1,2,...,n}. A linear extension is an order-preserving total order x_1 < x_2 < ... < x_n on the elements of P, and more …

    msu Repository record for Progress on the 1/3 - 2/3 conjecture (opens in a new tab)

  7. Some Properties of Partially Ordered Sets

    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 …

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

  8. Finitary incidence algebras.

    Let P be an arbitrary partially ordered set and I(P) its incidence space. Then F(P) is the finitary incidence algebra and I(P) is a bimodule over it. Consequently we can form D(P) = FI(P) ⊕ I(P) the idealization of I(P). In this paper we will study the automorphisms of FI(P) and D(P). We will also …

    baylor Repository record for Finitary incidence algebras. (opens in a new tab)

  9. Group automorphisms of incidence algebras.

    Let (P,≤) be an arbitrary partially ordered set and I(P) its incidence space. Then FI(P) denotes the associated finitary incidence algebra, where FI(P) = I(P) for locally finite posets (P,≤). We investigate the group of units U(FI(P)) of incidence algebras and its normal subgroups. This includes …

    baylor Repository record for Group automorphisms of incidence algebras. (opens in a new tab)

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

    gatech Repository record for Problems and results in partially ordered sets, graphs and geometry (opens in a new tab)

  11. Topologies on Complete Lattices

    … description or comparison of two elements of a set in terms of one preceding or being smaller than or equal to the other. If the elements of a set, as pairs, exhibit certain order-type characteristics, the set is said to be a partially ordered set. The purpose of this paper is to investigate a …

    unt Repository record for Topologies on Complete Lattices (opens in a new tab)

  12. Quotient posets and the characteristic polynomial

    … function for the M öbius function of finite partially ordered sets. This generating function is called the characteristic polynomial of the partially ordered set. We are primarily interested in explaining why certain families of partially ordered sets have characteristic polynomials where all …

    msu Repository record for Quotient posets and the characteristic polynomial (opens in a new tab)

  13. The projective line over the integers and decompositions of modules over one -dimensional rings

    … towards a characterization of the underlying partially ordered set of the projective line Proj([special characters omitted][h, k]) over the integers [special characters omitted]. Roger Wiegand discovered an interesting axiom which holds for the affine line over [special characters omitted], …

    nebraska Repository record for The projective line over the integers and decompositions of modules over one -dimensional rings (opens in a new tab)

  14. Properties of Functionally Alexandroff Topologies and Their Lattice

    … the collection of such topologies on some set X. We present several theorems about the properties of these topologies as well as their partially ordered set. The first chapter introduces functionally Alexandroff topologies and motivates why this work is of interest to topologists. This …

    wku-diss Repository record for Properties of Functionally Alexandroff Topologies and Their Lattice (opens in a new tab)

  15. Decision Space Decomposition for Multiobjective Programs

    … a decom- position theorem for computing the set of minimal elements of a partially ordered set. This set is decomposed into subsets whose minimal elements are used to retrieve the overall minimal elements. We apply this approach to strictly convex MOPs de- composing their decision space into …

    clemson Repository record for Decision Space Decomposition for Multiobjective Programs (opens in a new tab)

  16. Graph Granularity through Bi-intuitionistic Modal Logic

    … modal accessibility relation R defined on the set of nodes and edges. The connection between modal logic and mathematical morphology is exploited to study notions of granulation on subgraphs, namely the process of changing granularity, and to define qualitative spatial relations between these …

    whiterose Download PDF for Graph Granularity through Bi-intuitionistic Modal Logic (opens in a new tab)

  17. Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-Up Learning, and to Deduction

    … of any two or more syntactic objects in a partially-ordered set of such objects. The dual of unification is an operation called generalization, or anti-unification, which computes least or minimal upper bounds. As with unification, anti-unification comes in a variety of forms. The thesis of …

    uiuc Repository record for Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-Order Logic, to Speed-Up Learning, and to Deduction (opens in a new tab)

  18. Local automorphisms of finitary incidence algebras.

    … identity and let $(P,\le)$ be a locally finite partially ordered set. Let $FI(P)$ denote the finitary incidence algebra of $(P,\le)$ over $R$. In this case, the finitary incidence algebra exactly coincides with the incidence space. We will give an explicit criterion for when local automorphisms …

    baylor Repository record for Local automorphisms of finitary incidence algebras. (opens in a new tab)

  19. Extremal Problems On Families of Subsets With Forbidden Subposets

    We study the families of subsets of finite sets that have some special properties. For all families with the properties, we look for the largest sizes of the families. In the thesis, we use a method to bound the size of families of subsets, which is what we call the Lubell function now. The method …

    south-carolina Repository record for Extremal Problems On Families of Subsets With Forbidden Subposets (opens in a new tab)

  20. 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)

Page 1 of 4