Combinatorial representations

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any graph is representable over all alphabets of size larger than some number depending on the graph. We also provide a characterisation of families representable over a given alphabet. Then, we associate a rank function and a closure operator to any representation which help us determine some criteria for the functions used in a representation. While linearly representable matroids can be viewed as having representations via matrices with only one row, we conclude this paper by an investigation of representations via matrices with only two rows.

[1]  Nikolai K. Vereshchagin,et al.  A new class of non-Shannon-type inequalities for entropies , 2002, Commun. Inf. Syst..

[2]  Zhen Zhang,et al.  On a new non-Shannon-type information inequality , 2002, Proceedings IEEE International Symposium on Information Theory,.

[3]  Zhen Zhang,et al.  A non-Shannon-type conditional inequality of information quantities , 1997, IEEE Trans. Inf. Theory.

[4]  Paul D. Seymour.  On secret-sharing matroids , 1992, J. Comb. Theory, Ser. B.

[5]  Terence Chan.  Recent Progresses in Characterising Information Inequalities , 2011, Entropy.

[6]  Richard M. Wilson,et al.  Constructions and Uses of Pairwise Balanced Designs , 1975 .

[7]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[8]  Ryan Kinser,et al.  New inequalities for subspace arrangements , 2009, J. Comb. Theory, Ser. A.

[9]  L. Mirsky,et al.  Permutation endomorphisms and refinement of a theorem of Birkhoff , 1960, Mathematical Proceedings of the Cambridge Philosophical Society.

[10]  Frantisek Matús,et al.  Matroid representations by partitions , 1999, Discret. Math..

[11]  M. Lunelli,et al.  Representation of matroids , 2002, math/0202294.

[12]  R. A. Bailey,et al.  Design of comparative experiments , 2008 .

[13]  Ernest F. Brickell,et al.  On the classification of ideal secret sharing schemes , 1989, Journal of Cryptology.

[14]  Randall Dougherty,et al.  Six New Non-Shannon Information Inequalities , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[16]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .