Combinatorics and Partially Ordered Sets

Dimension Theory

AvWilliam T. Trotter

Häftad, Engelska, 2002

Del 6 i serien Johns Hopkins Studies in the Mathematical Sciences

537 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

Primarily intended for research mathematicians and computer scientists, Combinatorics and Partially Ordered Sets: Dimension Theory also serves as a useful text for advanced students in either field. William Trotter concentrates on combinatorial topics for finite partially ordered sets, and with dimension theory serving as a unifying theme, research on partially ordered sets or posets is linked to more traditional topics in combinatorial mathematics -- including graph theory, Ramsey theory, probabilistic methods, hypergraphs, algorithms, and computational geometry. The book's most important contribution is to collect, organize, and explain the many theorems on partially ordered sets in a way that makes them available to the widest possible audience.

Produktinformation

Utgivningsdatum:2002-02-26
Mått:152 x 229 x 20 mm
Vikt:499 g
Format:Häftad
Språk:Engelska
Serie:Johns Hopkins Studies in the Mathematical Sciences
Antal sidor:328
Förlag:Johns Hopkins University Press
ISBN:9780801869778

Utforska kategorier

Mer om författaren

William T. Trotter is Regents' Professor of Mathematics at Arizona State University and director of Combinatorics and Operations Research for Bell Communications Research in Morristown, New Jersey.

Recensioner i media

Eminently suitable as a self-study or supervised text in partially ordered sets and combinatorics. SIAM Review

Innehållsförteckning

Contents: Introduction to Dimension * Crowns, Splits, Stacks, Sums and Products * Characterization Problems for Posets, Lattices, Graphs, and Families of Sets * Hypergraph Coloring, Computational Complexity and Irreducible Posets * Planar Maps, and Convex Polytopes * Probabilistic Methods in Dimension Theory * Interval and Geometric Containment Orders * Greedy Dimension, Back-Tracking and Depth First Search * Products of Chains of Bounded Length * Large Minimal Realizers