Abstract
Concept lattices with symmetries may be simplified by “folding” them along the orbits of their automorphism group. The resulting diagram is often more intuitive than the full lattice diagram, but well defined annotations are required to make the folded diagram as informative as the original one. The folding procedure can be extended to formal contexts.
A typical situation where such lattice foldings are useful is when hierarchies of structures are considered “up to isomorphisms”.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Behrisch, M.: Personal communication (2006)
Caspard, N., Monjardet, B.: The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey. Discrete Applied Mathematics 127(2), 241–269 (2003)
Habib, M., Nourine, L.: The number of Moore families on n = 6. Discrete Mathematics 294, 291–296 (2005)
The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.4.12 (2008), http://www.gap-system.org
Ganter, B., Reuter, K.: Finding closed sets: a general approach. Order 8, 283–290 (1991)
Ganter, B., Wille, R.: Formal Concept Analysis – Mathematical Foundations. Springer, Heidelberg (1999)
Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Sequences A102896 and A108799, http://www.research.att.com/~njas/sequences/A108799
Zickwolff, M.: Rule Exploration: First Order Logic in Formal Concept Analysis. Dissertation, Darmstadt (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borchmann, D., Ganter, B. (2009). Concept Lattice Orbifolds – First Steps. In: Ferré, S., Rudolph, S. (eds) Formal Concept Analysis. ICFCA 2009. Lecture Notes in Computer Science(), vol 5548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01815-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-01815-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01814-5
Online ISBN: 978-3-642-01815-2
eBook Packages: Computer ScienceComputer Science (R0)