Fast Möbius inversion in semimodular lattices and ER-labelable posets

zbMath1377.06006arXiv1603.03889MaRDI QIDQ311532

Petteri Kaski, Thomas Westerbäck, Jukka Kohonen

Publication date: 13 September 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

semimodular latticeMöbius inversionER-labelable poset

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Combinatorics of partially ordered sets (06A07) Semimodular lattices, geometric lattices (06C10)

Related Items

Focal points and their implications for Möbius transforms and Dempster-Shafer theory, Efficient Möbius Transformations and Their Applications to D-S Theory, Unnamed Item, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast Fourier transforms for finite inverse semigroups
• Supersolvable lattices
• Finding Efficient Circuits for Ensemble Computation
• Lattice Theory: Foundation
• Fourier meets M\"{o}bius: fast subset convolution
• Computational aspects of the Mobius transformation of graphs
• Negation is Powerless for Boolean Slice Functions
• Shellable Nonpure Complexes and Posets. I
• Fast Zeta Transforms for Lattices with Few Irreducibles