Counting formulas for glued lattices

DOI10.1007/BF00383603zbMath0552.06003MaRDI QIDQ800946

Klaus Reuter

Publication date: 1985

Published in: Order (Search for Journal in Brave)

zbMATH Keywords

complete latticecoversblockstolerance relationDilworth's covering theoremglued tolerance relation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Complete lattices, completions (06B23) Structure theory of lattices (06B05) Lattice ideals, congruence relations (06B10)

Related Items

Matchings for linearly indecomposable modular lattices, Subdiagrams equal in number to their duals, Distributive lattices determined by weighted double skeletons, A note on blocks of skeleton tolerances., The core of finite lattices, Matchings and Radon transforms in lattices II. Concordant sets

Cites Work

• Unnamed Item
• Subdirect decomposition of concept lattices
• Dilworth's covering theorem for modular lattices: A simple proof
• S-verklebte Summen von Verbänden
• Proof of a conjecture on finite modular lattices
• The imbedding problem for modular lattices
• Tolerance relations on lattices
• Tolerance relation on lattices
• Subdirekte Produkte vollständiger Verbände.