Maximizing Möbius functions on subsets of Boolean algebras

DOI10.1016/0012-365X(94)90273-9zbMath0809.05004WikidataQ89354640 ScholiaQ89354640MaRDI QIDQ1318819

Yeong-Nan Yeh, Bruce E. Sagan, Günter M. Ziegler

Publication date: 4 April 1994

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

zbMATH Keywords

Möbius functionposetEuler characteristicBoolean algebrassimplexsubcomplexsubposet

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07)

Related Items

Extremal problems for the Möbius function in the face lattice of the \(n\)-octahedron ⋮ Principal \(\Gamma\)-cone for a tree ⋮ The boustrophedon transform for descent polytopes ⋮ The \(f\)-vector of the descent polytope ⋮ The asymptotics of almost alternating permutations ⋮ Explicit bounds for multidimensional linear recurrences with restricted coefficients ⋮ Cyclotomic factors of the descent set polynomial ⋮ Order-chain polytopes ⋮ The excedance set of a permutation ⋮ Maximizing the descent statistic ⋮ A probabilistic approach to the descent statistic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits of values of the Möbius function
• On induced subgraphs of the cube
• An extended Euler-Poincaré theorem
• Die Euler-Charakteristik von Vereinigungen konvexer Mengen im R
• Posets with maximal Möbius function
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]