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

MaRDI QIDQ311532zbMATHFDO

Authors Petteri Kaski, Jukka Kohonen, Thomas Westerbäck

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

semimodular latticeER-labelable posetMöbius inversion

Mathematics Subject Classification ID

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

Abstract: We consider the problem of fast zeta and M"obius transforms in finite posets, particularly in lattices. It has previously been shown that for a certain family of lattices, zeta and M"obius transforms can be computed in $O(e)$ elementary arithmetic operations, where $e$ denotes the size of the covering relation. We show that this family is exactly that of geometric lattices. We also extend the algorithms so that they work in $e$ operations for all semimodular lattices, including chains and divisor lattices. Finally, for both transforms, we provide a more general algorithm that works in $e$ operations for all R-labelable posets and their non-graded generalization, which we call U-labelable.

Recommendations

• Fast zeta transforms for lattices with few irreducibles
• Fast Zeta Transforms for Lattices with Few Irreducibles
• On lattices with Möbius function \(\pm 1,0\)
• Möbius functions of lattices
• Computational aspects of the Mobius transformation of graphs

Cites work

• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• A space-time tradeoff for permutation problems
• Computational aspects of the Mobius transformation of graphs
• Fast Fourier transforms for finite inverse semigroups
• Fast Zeta Transforms for Lattices with Few Irreducibles
• Finding efficient circuits for ensemble computation
• Fourier meets M\"{o}bius: fast subset convolution
• Lattice Theory: Foundation
• Negation is Powerless for Boolean Slice Functions
• Shellable Nonpure Complexes and Posets. I
• Supersolvable lattices

Cited in

(5)

• Focal points and their implications for Möbius transforms and Dempster-Shafer theory
• scientific article; zbMATH DE number 7604026 (Why is no real title available?)
• Fast zeta transforms for lattices with few irreducibles
• Efficient Möbius transformations and their applications to D-S theory
• scientific article; zbMATH DE number 7561519 (Why is no real title available?)

This page was built for publication: Fast Möbius inversion in semimodular lattices and ER-labelable posets

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