Abstract
In this work we want to clarify, how many non-similar plane diagrams a planar lattice can have. In the first part demonstrate how to find all these diagrams by specifying all realizers, i.e. all pairs of linear orders whose intersection equals to the lattice order. The tools we use to achieve that goal are Ferrers-graphs [DDF84, Reu89] and left-relations on contexts [Zsc07]. Finally we determine the set of numbers which can occur as the number of plane diagrams of a planar lattice.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bertolazzi, P., et al.: Optimal upward planarity testing of single-source digraphs. SIAM J. COmput. 27, 132–169 (1998)
Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension 2. Networks 2, 11–28 (1971)
Birkhoff, G.: Lattice theory, third ed., Amer. Math. Soc (1967)
Cogis, O.: On the ferrers-dimension of a digraph. Discrete Math. 38, 47–52 (1982)
Doignon, J.P., Ducamp, A., Falmagne, J.C.: On realizable biorders and the biorder dimension of a relation. J. of. Math. Psychology 28, 73–109 (1984)
Diestel, R.: Graphentheorie. Springer, Heidelberg (1996)
Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Math 63, 600–610 (1941)
Ganter, B.: Conflict avoidance in order diagrams. J. of Univ. Comp. Sc. 10(8), 955–966 (2004)
Ganter, B., Wille, R.: Formal concept analysis - mathematical foundations. Springer, Heidelberg (1999)
Jungnickel, D.: Graphen, Netzwerke und Algorithmen, third ed., BI-Wiss.-Verl (1994)
Kelly, D., Rival, I.: Planar lattices. Can. J. Math. 27(3), 636–665 (1975)
Platt, C.R.: Planar lattices and planar graphs. J. Combinatorial Theory Ser. B, 30–39 (1976)
Reuter, K.: Removing critical pairs, Tech. Report 1241, TU Darmstadt (1989)
Schmidt, B.: Ein Algorithmus zum Zeichnen von Liniendiagrammen, Master’s thesis, TU Dresden (2002)
Spinrad, J.: Two dimensional partial orders, Ph.D. thesis, Princeton Univ (1982)
Zschalig, C.: Planarity of lattices - an approach based on attribute additivity. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 391–402. Springer, Heidelberg (2005)
Bipartite ferrers-graphs and planar concept lattices. In: Kuznetsov, S.O., Schmidt, S. (eds.) ICFCA 2007. LNCS (LNAI), vol. 4390, pp. 313–327. Springer, Heidelberg (2007)
Left-relations, A.: unified approach to characterize planar lattices, Ph.D. thesis, TU Dresden (to appear, 2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zschalig, C. (2008). The Number of Plane Diagrams of a Lattice. In: Medina, R., Obiedkov, S. (eds) Formal Concept Analysis. ICFCA 2008. Lecture Notes in Computer Science(), vol 4933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78137-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-78137-0_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78136-3
Online ISBN: 978-3-540-78137-0
eBook Packages: Computer ScienceComputer Science (R0)