Abstract
Consider a matrix satisfying the following two properties. There are no two rows of the matrix having the same entries in two cyclically neighbouring columns. On the other hand for each subset of the columns not containing a cyclically neighbouring pair there are two rows having the same entries in these columns.
In this paper the magnitude of the minimal number of the rows of such a matrix will be determined for given number of columns. Using the same method, the analogue question can be answered for some other Spernersystems, too. The heart of the proof is a combinatorial lemma, which might be interesting in itself.
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
W.W. Armstrong, Dependency structures of database relationship, Information Processing 74 (North Holland, Amsterdam, 1974) 580–583.
F.E. Benett, Lisheng Wu, On minimum matrix representation of closure operations, Discrete Appl. Math. 26 (1990) 25–40.
J. Demetrovics, Candidate keys and antichains, SIAM J. Algebraic Methods 1 (1980) 92.
J. Demetrovics, On the equivalence of candidate keys with Sperner systems, Acta Cybernet. 4 (1979) 247–252.
J. Demetrovics, Z. Füredi, G.O.H. Katona, Minimum matrix representation of closure operations, Discrete Appl. Math. 11 (1985) 115–128.
J. Demetrovics, G.O.H. Katona, Extremal combinatorial problems in relational database, in Fundamentals of Computation Theory 81, Proc. of the 1981 International FCT-Conference, Szeged, Hungary, 1981, Lecture Notes in Computer Science 117 (Springer, Berlin 1981) 110–119.
Z. Füredi, Perfect error-correcting databases, Discrete Appl. Math. 28 (1990) 171–176.
G.O.H. Katona, Combinatorial and algebraic results for database relations, in J. Biskup, R. Hull, ed., Database Theory-ICDT’ 92, Berlin, 1992, Lecture Notes in Comput. Science, 646 (Springer Verlag, Berlin, 1992) 1–20.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tichler, K. (2000). Minimum Matrix Representation of Some Key System. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_17
Download citation
DOI: https://doi.org/10.1007/3-540-46564-2_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67100-8
Online ISBN: 978-3-540-46564-5
eBook Packages: Springer Book Archive