Möbius functions of lattices

DOI10.1006/AIMA.1997.1616zbMATH Open0872.06004arXivmath/9801009OpenAlexW2158959301WikidataQ56853328 ScholiaQ56853328MaRDI QIDQ1355470FDOQ1355470

Bruce E. Sagan, Andreas Blass

Publication date: 6 October 1997

Published in: Advances in Mathematics (Search for Journal in Brave)

Abstract: We introduce the concept of a bounded below set in a lattice. This can be used to give a generalization of Rota's broken circuit theorem to any finite lattice. We then show how this result can be used to compute and combinatorially explain the M"obius function in various examples including non-crossing set partitions, shuffle posets, and integer partitions in dominance order. Next we present a generalization of Stanley's theorem that the characteristic polynomial of a semimodular supersolvable lattice factors over the integers. We also give some applications of this second main theorem, including the Tamari lattices.

Full work available at URL: https://arxiv.org/abs/math/9801009

zbMATH Keywords

characteristic polynomialinteger partitionsdominance orderfinite latticeTamari latticesbounded below setnon-crossing set partitionsRota's broken circuit theoremshuffle posetsStanley's theoremMöbius function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Combinatorics of partially ordered sets (06A07) Semimodular lattices, geometric lattices (06C10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Sur les partitions non croisées d'un cycle. (The non-crossed partitions of a cycle)
• The lattice of integer partitions
• Wonderful models of subspace arrangements
• Supersolvable lattices
• Combinatorics and topology of complements of hyperplanes
• Non-crossing partitions for classical reflection groups
• Problems of associativity: a simple proof for the lattice property of systems ordered by a semi-associative law
• The Geometry of Root Systems and Signed Graphs
• Linear Decision Trees, Subspace Arrangements, and Mobius Functions
• Primes, irreducibles and extremal lattices
• On Tamari lattices
• Problèmes d'associativité: Une structure de treillis finis induite par une loi demi-associative
• A class of lattices with Möbius function \(\pm 1,0\)
• A generalization of Rota's NBC theorem
• The higher Stasheff‐Tamari posets
• Posets of shuffles
• A class of lattices whose intervals are spherical or contractible

Cited In (39)

• Characterizations of categories of commutative \(C^*\)-subalgebras
• Supersolvable LL-lattices of binary trees
• Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets
• Rank-metric lattices
• Non-crossing partitions
• Two generalizations of posets of shuffles
• Line-closed matroids, quadratic algebras, and formal arrangments
• Noncrossing partitions and representations of quivers
• A new subgroup lattice characterization of finite solvable groups.
• The noncrossing bond poset of a graph
• Tamari lattices and noncrossing partitions in type \(B\)
• On the Möbius function of a pointed graded lattice
• The Möbius function of the \(P\)-partition lattice
• Extremality, left-modularity and semidistributivity
• A class of lattices with Möbius function \(\pm 1,0\)
• Generating binary trees by Glivenko classes on Tamari lattices
• Title not available (Why is that?)
• Characteristic polynomials of the weak order on classical and affine Coxeter groups
• Möbius function on cross-section lattices.
• Topological properties of activity orders for matroid bases
• Noncrossing arc diagrams, Tamari lattices, and parabolic quotients of the symmetric group
• Left-modular elements of lattices
• An abstraction of Whitney's broken circuit theorem
• Why the characteristic polynomial factors
• Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
• The noncrossing bond poset of a graph
• Combinatorial and algebraic structure in Orlik-Solomon algebras
• A broken cycle theorem for the restrained chromatic function
• Factoring the characteristic polynomial of a lattice
• Poset edge-labellings and left modularity
• Applications of quotient posets
• Two posets of noncrossing set partitions
• Interview with Bruce Sagan
• A geometric and combinatorial exploration of Hochschild lattices
• An analogue of distributivity for ungraded lattices
• Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices
• An 𝐸𝐿-labeling of the subgroup lattice
• A broad class of shellable lattices
• Characteristic polynomials of weighted lattices

This page was built for publication: Möbius functions of lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355470)