This book provides a uniform treatment of the theory and applications of lattice theory. The applications covered include tracking dependency in distributed systems, combinatorics, detecting global predicates in distributed systems, set families, and integer partitions. The book presents algorithmic proofs of theorems whenever possible. These proofs are written in the calculational style advocated by Dijkstra, with arguments explicitly spelled out step by step. The author’s intent is for readers to learn not only the proofs, but the heuristics that guide said proofs.
Introduction to Lattice Theory with Computer Science Applications:
- Examines; posets, Dilworth’s theorem, merging algorithms, lattices, lattice completion, morphisms, modular and distributive lattices, slicing, interval orders, tractable posets, lattice enumeration algorithms, and dimension theory
- Provides end of chapter exercises to help readers retain newfound knowledge on each subject
- Includes supplementary material at www.ece.utexas.edu/~garg
Introduction to Lattice Theory with Computer Science Applications is written for students of computer science, as well as practicing mathematicians.
Keywords: Lattice theory; Combinatorics; Posets; Distributed Computing; Dilworth's Theorem; Hall's Marriage Theorem; Bipartite Matching; Merging Algorithms; Sublattices; Dedekind-MacNeille Completion; Data Mining; Lattice Homomorphism; Lattice Isomorphism; Lattice Congruences; Quotient Lattice; Modular Lattice; Birkhoff's Representation Theorem; Boolean Algebra; Interval Oders; Tractable Posets; Enumeration Algorithms; Maximal Antichain Lattice; Dimension Theory, Numerical Methods & Algorithms, Numerical Methods & Algorithms