Ordered sets. An introduction
This book is one more general introduction to the theory of partially ordered sets or posets, which no longer presents the subject merely as a smallish part of discrete mathematics, subset of graph theory or, via the order-complex, a combinatorial structure of algebraic-topological interest. Instead it treats the subject as an area of study in its own right and not in the form of a specialized monograph, no matter how brilliantly conceived or how perfectly executed such might be. Of course, in attempting to provide an initial oversight of a renovated field and incorporating the hope that this text may prove foundational for a generation of young poset theorists, the author has shown high ambition and should be praised for incorporating as many results as he has at a level which not only makes it accessible to the mature undergraduate curious about this subject but the graduate student interested not only in learning about the field but looking for problem areas to plant useful thesis claims with an eye to completing successful research topics. Even a veteran, but one specialized in a particular area, may browse the text with pleasure and advantage, noting that much information is hidden in the exercises which permit the apprentice and journeyman to acquire necessary skills and insights either through direct effort or via a certain amount of work topped-off by consulting the literature provided in a substantial but by no means complete set of references. Certainly the author has done valiant battle with space limitations so as not to end up with the proverbial ``bible which would serve to chase prospective students away rather than attract them. As a result he had to make choices to eliminate or underemphasize certain topics, e.g., those associated with locally finite or Eulerian posets, the Möbius function and associated combinatorics or the area opened up by Stanley in his dissertation example and followed up by students in his school, the chain-meets-antichain theorem of Rival-Zaguia etc. Fortunately there are other classics to cover these areas ranging from Berge to Stanley himself. And, as we have already recognized, books have to be finite in a strong sense to remain digestible. The author has done the field a service by producing an excellent text strong in the presentation of certain topological aspects of the underlying diagrams, e.g., which should serve the developing community and field well and which can be recommended without reservations as one of the volumes which should grace a poseteer's library whether she is interested only or mainly in the theory of these objects or has directed her gaze towards applications. As a sourcebook of ideas and understanding it will make its mark. And deservedly so.
- A stochastic order for the analysis of investments affected by the time value of money
- Ordered dynamics in biased and cooperative Boolean networks
- Interval-valued rank in finite ordered sets
- Ordered sets
- What is reconstruction for ordered sets?
- Isotone relations revisited
- Restricted cooperative games on metabolic networks reveal functionally important reactions
- The zig-zag property and exponential cancellation of ordered sets
- The fixed point property for ordered sets
- Characterization of quasi-orbit spaces
- The distribution function of a probability measure on the Dedekind-Macneille completion
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Harnack and Shmul'yan pre-order relations for Hilbert space contractions
- Lattices defined by multigranular rough sets
- A stochastic order for interval valued random mappings and applications
- Complexity reduction and approximation of multidomain systems of partially ordered data
- On the ranks and implicit constant fields of valuations induced by pseudo monotone sequences
- Poset exponentiation and a counterexample Birkhoff said in 1942 he did not have
- Partially ordered permutation complexity of coupled time series
- Unit representation of semiorders. I: Countable sets
- Posets with the maximal antichain property
- On homotopy types of Alexandroff spaces
- Properties and morphisms of finite ultrametric spaces and their representing trees
- Computing possible and certain answers over order-incomplete data
- Linear extensions of N-free orders.
- From fuzzy sets to the decompositions of non-rigid sets
- About quotient orders and ordering sequences
- Two applications of a generalization of an asymptotic fixed point theorem
- Finite dimensional scattered posets
- A note on the family of extremality stochastic orders
- Posets, clique graphs and their homotopy type
- Uniqueness results in the representation of families of sets by fuzzy sets
- The automorphism conjecture for small sets and series parallel sets
- Quantified conjunctive queries on partially ordered sets
- Finite ordered sets. Concepts, results and applications
- Uniqueness of best proximity pairs and rigidity of semimetric spaces
- Ordered sets. An introduction with connections from combinatorics to topology
- Sets and ordered structures
- Order matters when choosing sets
- Ring extensions with some finiteness conditions on the set of intermediate rings.
- Implicit poset applications
- The fixed point and the common fixed point properties in finite pseudo-ordered sets
- Variants of Essential Arity for Partial Functions
- Advances in finding ideal play on poset games
- f-aggregation operators on a bounded lattice
- Faithful extensions on finite orders classes
- A provably secure non-iterative hash function resisting birthday attack
- Lazy Relations
- Iterated Clique Graphs and Contractibility
- scientific article; zbMATH DE number 41082 (Why is no real title available?)
- scientific article; zbMATH DE number 47694 (Why is no real title available?)
- scientific article; zbMATH DE number 194015 (Why is no real title available?)
- A combinatorial proof of a fixed point property
- scientific article; zbMATH DE number 736305 (Why is no real title available?)
- scientific article; zbMATH DE number 1086853 (Why is no real title available?)
- A stochastic comparison of customer classifiers with an application to customer attrition in commercial banking
- Faithfulness of probability distributions and graphs
- Ordered sets that are reconstructible from two cards and the number of comparabilities.
- scientific article; zbMATH DE number 3993569 (Why is no real title available?)
- scientific article; zbMATH DE number 1890125 (Why is no real title available?)
- Representing graphs via pattern avoiding words
- Extensions of symmetric operators. I: The inner characteristic function case
- On the number of antichains and antichain covers of labeled sets
- scientific article; zbMATH DE number 7376056 (Why is no real title available?)
- Partially ordered sets and lattices
- A binary operation-based representation of a lattice.
- Presymplectic current and the inverse problem of the calculus of variations
- Strengthened fixed point property and products in ordered sets
- Poset topology: tools and applications
- The secret life of keys: on the calculation of mechanical lock systems
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- (F,G)-Derivations on a Lattice
- On stochastic orders defined by other stochastic orders and transformations of probabilities
- Lattice automorphism and zero‐divisor graphs of lattices
- The isomorphism problem for Grassmannian Schubert varieties
- Universal p‐ary designs
- Partially ordered permutation entropies
- Sets with structure, mappings and fixed point property: fixed point structures
- Complexity of couplings in multivariate time series via ordinal persistent homology
- Cancel culture. The search for universally cancellable exponents of posets
- A 2-element antichain that is not contained in any finite retract
- Set-based value operators for non-stationary and uncertain Markov decision processes
- Dimension of RC-lattices
- Runs in random sequences over ordered sets
- A matrix technique to analyse directional stochastic orders with applications to elliptical distributions
- Linearity and linear extensions of fuzzy orders revisited
- Non-Hausdorff parallelized manifolds over geometric models of conservative programs
- Characterizing traces of processes defined by precedence and response constraints: an order theory approach
- Pseudo-similar points in ordered sets
- Asymptotic granularity reduction and its application
- Inferring DAGs and phylogenetic networks from least common ancestors
- A fuzzy posetic toolbox for multi-criteria evaluation on ordinal data systems
- Framed polytopes and higher categories
- Subpattern matching persistent homology for coupling complexity analysis of multivariate time series
- A class of partially ordered sets.
- Inductive characterizations of finite interval orders and semiorders
- Chain dominated orders
- The fixed vertex property for graphs
- Fuzzy topology and geometric formalism of quantum mechanics
- Reconstruction of a word from a multiset of its factors
This page was built for publication: Ordered sets. An introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4791727)