Abstract
In the development of computational techniques for combinatorial theory, attention has lately centered on ROTA’S theory of Möbius inversion [6]. The main theorem of ROTA’S paper, concerning the computation of the Möbius invariant across a Galois connection, is a prerequisite to the use of lattice-theoretic methods in combinatorics.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. H. Crapo, The Möbius Function of a Lattice. J. Combinatorial Theory 1, 126–131 (1966).
H. H. Crapo, The Tutte Polynomial. Aequationes Math, (to appear).
H. H. Crapo, Geometric Duality. Rend. Sem. Mat. Univ. Padova 38, 23–26 (1967).
D. A. Higgs, Strong Maps of Geometries. J. Combinatorial Theory 5 (1968) (to appear).
O. Ore, Galois Connexions. Trans Amer. Math. Soc. 55, 493–513 (1944).
G.-C. Rota, On the Foundations of Combinatorial Theory I. Z. Wahrscheinlichkeitstheorie und verw. Gebiete 2, 340–368 (1964).
W. T. Tutte, A Ring in Graph Theory. Proc. Cambridge Philos. Soc. 43, 26–40 (1947).
W. T. Tutte, A Contribution to the Theory of Chromatic Polynomials. Canad. J. Math. 6, 80–91 (1954).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Birkhäuser Boston, a part of Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Crapo, H.H. (2009). Möbius Inversion in Lattices. In: Gessel, I., Rota, GC. (eds) Classic Papers in Combinatorics. Modern Birkhäuser Classics. Birkhäuser Boston. https://doi.org/10.1007/978-0-8176-4842-8_29
Download citation
DOI: https://doi.org/10.1007/978-0-8176-4842-8_29
Publisher Name: Birkhäuser Boston
Print ISBN: 978-0-8176-4841-1
Online ISBN: 978-0-8176-4842-8
eBook Packages: Springer Book Archive