Counting and Computing Join-Endomorphisms in Lattices

DOI10.1007/978-3-030-43520-2_16MaRDI QIDQ5098726zbMATH OpenOpenAlexFDO

Authors Santiago Quintero, Sergio Ramírez, Camilo Rueda, Frank D. Valencia

Publication date 30 August 2022

Published in Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-43520-2_16

zbMATH Keywords

join-endomorphismslattice algorithmslattice cardinality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Regular join endomorphisms on a complemented modular lattice of finite rank
• scientific article; zbMATH DE number 4210218
• scientific article; zbMATH DE number 640695
• On the number of join irreducibles and acyclicity in finite modular lattices
• scientific article; zbMATH DE number 565944
• Counting restricted homomorphisms via Möbius inversion over matroid lattices
• On the number of join-irreducibles in a congruence representation of a finite distributive lattice
• scientific article; zbMATH DE number 1099514
• Publication:4952823
• scientific article; zbMATH DE number 4068271

Cites work

• Belief, knowledge, lies and other utterances in an algebra for space and extrusion
• Continuous Lattices and Domains
• Enumeration of order preserving maps
• Generating all finite modular lattices of a given size
• Handbook of Spatial Logics
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• On discrete idempotent paths
• On the Lattice of All Join-Endomorphisms of a Lattice
• On validity in modelization of musical problems by CCP
• Reasoning about distributed information with infinitely many agents
• Relation algebras, idempotent semirings and generalized bunched implication algebras
• Spatial and epistemic modalities in constraint-based process calculi
• Tree structure for distributive lattices and its applications
• Why mathematical morphology needs complete lattices

Cited in

(4)

• Reasoning about distributed information with infinitely many agents
• Unitless Frobenius quantales
• Isolated sublattices and their application to counting closure operators
• Computing distributed knowledge as the greatest lower bound of knowledge

This page was built for publication: Counting and Computing Join-Endomorphisms in Lattices

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