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 15 of 15 for “"Linear orderings"”.

  1. Lexicographic Products of Linear Orderings

    For each pair of linear orderings (L, M), the representability number reprM(L) of L in M is the least ordinal alpha such that L can be order-embedded into the lexicographic power Malex . The case M = R is relevant to utility theory, a branch of mathematical economics. First we characterize …

    uiuc Repository record for Lexicographic Products of Linear Orderings (opens in a new tab)

  2. Ramsey Property of Posets and Related Structures

    … several classes of finite posets equipped with linear orderings. We examine these classes according to the Ramsey and the ordering property. As an application we give several new extremely amenable groups of automorphisms of countable structures and compute several new universal minimal flows …

    toronto-retro Repository record for Ramsey Property of Posets and Related Structures (opens in a new tab)

  3. Automorphisms and linearisations of computable orderings

    … content of existing classical theorems on linearisations of partial orderings and automorphisms of linear orderings, and provide computational refinements in terms of the Ershov hierarchy. In Chapter 2, we examine questions as to the constructiveness of linearisations obtained in terms of …

    whiterose Download PDF for Automorphisms and linearisations of computable orderings (opens in a new tab)

  4. REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING

    … is realized by 2<em>k</em> - 1 rankings, called linear orderings, of the vertices in the tournament. Every <em>k</em>-majority voting scenario can be modeled by a tournament, but not every tournament is a model for a <em>k</em>-majority voting scenario. In this thesis we show that all acyclic …

    csusb Repository record for REALIZING TOURNAMENTS AS MODELS FOR K-MAJORITY VOTING (opens in a new tab)

  5. ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ

    … A SERIES OF PARAMETTERS, DEFINED IN TERMS OF LINEAR ORDERINGS ARE STUDIED. THE BASIC DIRECTIONS ARE THE INVESTIGATION OF THEIR COMPUTATIONAL COMPLEXITY, THE FINDING OF UPPER AND LOWER BOUNDS TO THEIR VALUES, THEIR RELATION WITH GRAPH SEARCHING PROBLEMS AND THEIR APPLICATION ON THE CONSTRAINT …

    greece Repository record for ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ (opens in a new tab)

  6. Coloring and covering problems on graphs

    … $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are ``separated'' in some ordering, meaning that both endpoints of one edge appear before both endpoints of the other. We introduce the \emph{fractional separation dimension} …

    uiuc Repository record for Coloring and covering problems on graphs (opens in a new tab)

  7. Classification of Vertex-Transitive Structures

    … we show that the class of vertex-transitive linear orderings does not. We explore this phenomenon further by considering other natural classes of vertex-transitive structures such as tournaments and partial orderings. In doing so, we discover that several other complexities arise for classes …

    boise Repository record for Classification of Vertex-Transitive Structures (opens in a new tab)

  8. Contributions towards a Fine Structure Theory of Aronszajn Orderings.

    … is to add to the structure theory of Aronszajn orderings. We shall focus essentially in four topics. The first topic of discussion is about the relation between Lipschitz and coherent trees. I will demonstrate that the tree T(ρ0) is coherent without any extra set theoretic hypothesis. The second …

    toronto-retro Repository record for Contributions towards a Fine Structure Theory of Aronszajn Orderings. (opens in a new tab)

  9. A generalized linear complexity

    … strong sequence must have a high linear complexity, where the linear complexity of a sequence s is the minimum number of stages in a linear feedback shift register capable of generating s. However, trivial examples exist which show that a high linear complexity does not insure that …

    ttu Repository record for A generalized linear complexity (opens in a new tab)

  10. Linear Order

    This paper will be concerned with some fundamental properties of a line. In particular, fundamental ordering properties of a line segment are covered.

    unt Repository record for Linear Order (opens in a new tab)

  11. Map Folding

    … then it is flat foldable, and the linear ordering of the faces is called a valid linear ordering. Otherwise, the map is unfoldable. In this thesis, we show that, given a linear ordering of the faces of an m × n map, we can decide in linear time whether it is a valid linear ordering …

    uvic Repository record for Map Folding (opens in a new tab)

  12. Enhanced Representations and Efficient Analysis of Syntactic Dependencies Within and Beyond Tree Structures

    … patterns, which encode the number, types, and linear orderings of each word’s dependent syntactic relations (e.g., a transitive verb in English has a subject to its left and a direct object to its right). This method is demonstrated to improve precision on the selected subsets of dependency …

    cornell Repository record for Enhanced Representations and Efficient Analysis of Syntactic Dependencies Within and Beyond Tree Structures (opens in a new tab)

  13. Results on the Generalised Shift Graph

    … are distinct (non-isomorphic) for distinct linear orderings S, S'. The other is to what extent we can recognise S inside the graph (called ‘reconstruction’). A positive solution to the latter also yields one for the former, since if we can recognise S in its graph, and S′ in its graph, and …

    whiterose Download PDF for Results on the Generalised Shift Graph (opens in a new tab)