Secret-sharing matroids need not be algebraic

Abstract We combine some known results and techniques with new ones to show that there exists a non-algebraic, multi-linear matroid. This answers an open question by Matus (1999), and an open question by Pendavingh and van Zwam (2013). The proof is constructive and the matroid is explicitly given.

[1]  Thomas A. Dowling,et al.  A class of geometric lattices based on finite groups , 1973 .

[2]  Gary Gordon,et al.  Algebraic characteristic sets of matroids , 1987, J. Comb. Theory, Ser. B.

[3]  T. A. Dowling.  A q-Analog of the Partition Lattice††t The research reported here was partially supported by the Air Force Office of Scientific Research under Contract AFOSR-68-1415. , 1973 .

[4]  Dowling Geometries Representable over Rings , 2015 .

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

[6]  Bernt Lindström.  Matroids algebraic overF(t) are algebraic overF , 1989, Comb..

[7]  T. Lazarson,et al.  The Representation Problem for Independence Functions , 1958 .

[8]  Carles Padró,et al.  Multi-linear Secret-Sharing Schemes , 2014, TCC.

[9]  A. Ingleton,et al.  Conditions for representability and transversality of matroids , 1971 .

[10]  D. Buchsbaum,et al.  Commutative Algebra, Vol. II. , 1959 .

[11]  Alexei E. Ashikhmin,et al.  Almost Affine Codes , 1998, Des. Codes Cryptogr..

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

[13]  Alexander Sprintson,et al.  On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory , 2008, IEEE Transactions on Information Theory.

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

[15]  Craig Huneke,et al.  Commutative Algebra I , 2012 .

[16]  R. A. Main,et al.  Non-Algebraic Matroids exist , 1975 .

[17]  Stefan H. M. van Zwam,et al.  Skew partial fields, multilinear representations of matroids, and a matrix tree theorem , 2013, Adv. Appl. Math..