Partially Ordered Sets
From MaRDI portal
Publication:5780132
DOI10.2307/2371374zbMath0025.31002OpenAlexW2325654786WikidataQ59509276 ScholiaQ59509276MaRDI QIDQ5780132
Publication date: 1941
Published in: American Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/be44f6333785f87efb011bb3c026ced8c0a90488
Related Items (only showing first 100 items - show all)
Acyclic Digraphs, Young Tableaux and Nilpotent Matrices ⋮ Mathematical models of human memory ⋮ Concurrency-Preserving Minimal Process Representation ⋮ Unnamed Item ⋮ Order Types and Similarity Transformations ⋮ SZPILRAJN, ARROW AND SUZUMURA: CONCISE PROOFS OF EXTENSION THEOREMS AND AN EXTENSION ⋮ Renormings of the dual of James tree spaces ⋮ On the comparison of order types ⋮ A Partition Theorem for Triples ⋮ Changing the Depth of an Ordered Set by Decomposition ⋮ On relations of equivalence and ordering ⋮ Containment graphs and posets of paths in a tree: wheels and partial wheels ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Two Double Poset Polytopes ⋮ Unnamed Item ⋮ The Hardness of Approximating Poset Dimension ⋮ A partition calculus in set theory ⋮ The Complexity of the Partial Order Dimension Problem: Closing the Gap ⋮ The chain covering number of a poset with no infinite antichains ⋮ Convex Independence in Permutation Graphs ⋮ Succinct permutation graphs ⋮ Strongly algebraically closed \(p\)-semilattices ⋮ On Modular Lattices of Order Dimension Two ⋮ Dominance drawings for DAGs with bounded modular width ⋮ Drawing Order Diagrams Through Two-Dimension Extension ⋮ Dimension is polynomial in height for posets with planar cover graphs ⋮ On Ordinal Invariants in Well Quasi Orders and Finite Antichain Orders ⋮ On the dimension of vertex labeling of k-uniform dcsl of an even cycle ⋮ Binary Relations in Mathematical Economics: On Continuity, Additivity and Monotonicity Postulates in Eilenberg, Villegas and DeGroot ⋮ Vertex Cover in Graphs with Locally Few Colors ⋮ Steiner Transitive-Closure Spanners of Low-Dimensional Posets ⋮ On homomorphisms of partially ordered sets and lattices ⋮ Metacompact subspaces of products of ordinals ⋮ On the well dimension of ordered sets ⋮ A forbidden subposet characterization of an order — dimension inequality ⋮ On the dimension of partially ordered sets ⋮ On the dimension of vertex labeling of $k$-uniform dcsl of $k$-uniform caterpillar ⋮ Domination graphs: Examples and counterexamples ⋮ Unnamed Item ⋮ Dimension transitiv orientierbarer graphen ⋮ AN ALGORITHMIC APPROACH TO PREFERENCE REPRESENTATION ⋮ Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ A note about games-composition dimension ⋮ The Number of Plane Diagrams of a Lattice ⋮ Representation of Planar Hypergraphs by Contacts of Triangles ⋮ A note on the McKelvey uncovered set and Pareto optimality ⋮ Dimension and matchings in comparability and incomparability graphs. ⋮ Decidability and ℵ0-categoricity of theories of partially ordered sets ⋮ Some cardinal characteristics of ordered sets ⋮ Set functions and Souslin’s hypothesis ⋮ Endomorphism monoids of distributive double p-algebras ⋮ On the pseudodimension of ordered sets ⋮ Compact Spaces and Spaces of Maximal Complete Subgraphs ⋮ On the lexicographic product of ordered sets ⋮ Uniqueness of means in the Cohen model ⋮ On Kierstead’s conjecture ⋮ Universal Infinite Partially Ordered Sets ⋮ Inequalities in Dimension Theory for Posets ⋮ Unnamed Item ⋮ A study of the order dimension of a poset using matrices ⋮ Crisp dimension theory and valued preference relations ⋮ Two-dimensional partial orderings: Recursive model theory ⋮ A New Perspective on the Mereotopology of RCC8. ⋮ The Complexity of the Partial Order Dimension Problem ⋮ PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT ⋮ MEASURING THE SIZE OF INFINITE COLLECTIONS OF NATURAL NUMBERS: WAS CANTOR’S THEORY OF INFINITE NUMBER INEVITABLE? ⋮ Graph Classes and Forbidden Patterns on Three Vertices ⋮ Uniquely Restricted Matchings in Interval Graphs ⋮ Unnamed Item ⋮ General d-position sets ⋮ Measures in Boolean Algebras ⋮ The Dimension of a Comparability Graph ⋮ Partial orderings of fixed finite dimension: Model companions and density ⋮ Concerning a Certain Set of Arrangements ⋮ Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies ⋮ A note on the dimension of a poset ⋮ Partition relations for \(\kappa\)-normal ideals on \(P_{\kappa}(\lambda)\) ⋮ An efficient implicit data structure for relation testing and searching in partially ordered sets ⋮ The dimension of interior levels of the Boolean lattice ⋮ 3-interval irreducible partially ordered sets ⋮ Generalized dimension of an ordered set and its MacNeille completion ⋮ The crossing number of posets ⋮ Computational aspects of the 2-dimension of partially ordered sets ⋮ A formal study of linearity axioms for fuzzy orderings ⋮ Semistandard tableaux associated with generalized labellings of posets ⋮ A conjecture on the construction of orderings by Borda's rule ⋮ Perpendicular orders ⋮ A recognition algorithm for orders of interval dimension two ⋮ Irreflexive and reflexive dimension ⋮ Perfect sequences of chain-complete posets ⋮ 2-dimension from the topological viewpoint ⋮ A half-space approach to order dimension ⋮ Simultaneous representation of interval and interval-containment orders ⋮ Simultaneous dominance representation of multiple posets ⋮ A generalized permutahedron ⋮ Representing digraphs using intervals or circular arcs ⋮ Tree-width and dimension ⋮ Dimension of fuzzy ordered sets ⋮ Dimension of CPT posets ⋮ Planar posets that are accessible from below have dimension at most 6
This page was built for publication: Partially Ordered Sets
