Skip to main content
Log in

Representability of matroids by c-arrangements is undecidable

  • Published:
Israel Journal of Mathematics Aims and scope Submit manuscript

Abstract

For a natural number c, a c-arrangement is an arrangement of dimension c subspaces satisfying the following condition: the sum of any subset of the subspaces has dimension a multiple of c. Matroids arising as normalized rank functions of c-arrangements are also known as multilinear matroids. We prove that it is algorithmically undecidable whether there exists a c such that a given matroid has a c-arrangement representation, or equivalently whether the matroid is multilinear. It follows that certain problems on network coding and secret sharing schemes are also undecidable. In the proof, we encode group presentations in frame matroids of rank three which we call generalized Dowling geometries: the construction is inspired by Dowling geometries of finite groups and by the von Staudt construction. The idea is to construct a reduction from the uniform word problem for finite groups to multilinear representability of matroids. The c-arrangement condition gives rise to some difficulties and their resolution is the main part of the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. R. Ahlswede, N. Cai, S.-Y. R. Li and R. W. Yeung, Network information flow, Institute of Electrical and Electronics Engineers. Transactions on Information Theory 46 (2000), 1204–1216.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. Beimel, A. Ben-Efraim, C. Padró and I. Tyomkin, Multi-linear secret-sharing schemes, in Theory of Cryptography, Lecture Notes in Computer Science, Vol. 8349, Springer, Heidelberg, 2014, pp. 394–418.

    MATH  Google Scholar 

  3. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, Journal of Cryptology 4 (1991), 123–134.

    Article  MATH  Google Scholar 

  4. A. Björner, Subspace arrangements, in First European Congress of Mathematics, Vol. I (Paris, 1992), Progress in Mathematics, Vol. 119, Birkhäuser, Basel, 1994, pp. 321–370.

    Book  Google Scholar 

  5. R. Dougherty, C. Freiling and K. Zeger, Networks, matroids, and non-shannon information inequalities, Institute of Electrical and Electronics Engineers. Transactions on Information Theory 53 (2007), 1949–1969.

    Article  MathSciNet  MATH  Google Scholar 

  6. T. A. Dowling, A class of geometric lattices based on finite groups, Journal of Combinatorial Theory. Series B 14 (1973), 61–86.

    Article  MathSciNet  MATH  Google Scholar 

  7. S. El Rouayheb, A. Sprintson and C. Georghiades, On the index coding problem and its relation to network coding and matroid theory, Institute of Electrical and Electronics Engineers. Transactions on Information Theory 56 (2010), 3187–3195.

    Article  MathSciNet  MATH  Google Scholar 

  8. W. Feit, Characters of Finite Groups, W.A. Benjamin, NewYork—Amsterdam, 1967.

    MATH  Google Scholar 

  9. S. Fujishige, Polymatroidal dependence structure of a set of random variables, Information and Control 39 (1978), 55–72.

    Article  MathSciNet  MATH  Google Scholar 

  10. M. Goresky and R. MacPherson, Stratified Morse theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 14, Springer, Berlin, 1988.

    Book  MATH  Google Scholar 

  11. L. Kuühne, R. Pendavingh and G. Yashfe, Von staudt constructions for skew-linear and multilinear matroids, https://arxiv.org/abs/2012.07361.

  12. L. Kühne and G. Yashfe, Undecidability of c-arrangement matroid representations, Séminaire Lotharingien de Combinatoire 84B (2020), Article no. 87.

  13. R. C. Lyndon and P. E. Schupp, Combinatorial Group Theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 89 Springer, Berlin—New York, 1977.

    MATH  Google Scholar 

  14. A. Malcev, On isomorphic matrix representations of infinite groups, Matematich-eskiĭ Sbornik 8 (1940), 405–422.

    MathSciNet  MATH  Google Scholar 

  15. F. Matúš, Matroid representations by partitions, Discrete Mathematics 203 (1999), 169–194.

    Article  MathSciNet  MATH  Google Scholar 

  16. N. E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties, in Topology and GeometryRohlin Seminar, Lecture Notes in Mathematics, Vol. 1346, Springer, Berlin, 1988, pp. 527–543.

    Chapter  Google Scholar 

  17. H. Q. Nguyen, Semimodular Functions, in Theory of Matroids, Encyclopedia of Mathematics and its Applications, Vol. 26, Cambridge University Press, Cambridge, 1986, pp. 272–297.

    Chapter  Google Scholar 

  18. J. Oxley, Matroid Theory, Oxford Graduate Texts in Mathematics, Vol. 21, Oxford University Press, Oxford, 2011.

    Book  MATH  Google Scholar 

  19. R. A. Pendavingh and S. H. van Zwam, Skew partial fields, multilinear representations of matroids, and a matrix tree theorem, Advances in Applied Mathematics 50 (2013), 201–227.

    Article  MathSciNet  MATH  Google Scholar 

  20. R. Rado, Note on independence functions, Proceedings of the London Mathematical Society 7 (1957), 300–320.

    Article  MathSciNet  MATH  Google Scholar 

  21. J. Simonis and A. Ashikhmin, Almost affine codes, Designs, Codes and Cryptography 14 (1998), 179–197.

    Article  MathSciNet  MATH  Google Scholar 

  22. A. M. Slobodskoi, Unsolvability of the universal theory of finite groups, Algebra and Logic 20 (1981), 139–156.

    Article  MathSciNet  Google Scholar 

  23. B. Sturmfels, On the decidability of Diophantine problems in combinatorial geometry, Bulletin of the American Mathematical Society 17 (1987), 121–124.

    Article  MathSciNet  MATH  Google Scholar 

  24. T. Zaslavsky, Frame matroids and biased graphs, European Journal of Combinatorics 15 (1994), 303–307.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We would like to thank Karim Adiprasito for his mentorship and for introducing us to the topic of c-arrangements. We are grateful to Rudi Pendavingh for helpful conversations on von Staudt constructions. Our application of them is inspired by joint work with him in [KPY20]. We would also like to thank Eran Nevo, and other participants of the 2020–21 mathematical writing workshop at the Hebrew University, for helpful comments. Lastly, we thank the anonymous referee for carefully reading an earlier version of this article and for giving many suggestions which significantly improved the paper.

An extended abstract of this paper appeared as “Undecidability of c-Arrangement Matroid Representations” in a proceedings volume of Séminaire Lotharingien de Combinatoire, among extended abstracts from the 2020 FPSAC conference [KY20].

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lukas Kühne.

Additional information

L.K. was supported by a Minerva fellowship of the Max-Planck-Society, the Studienstiftung des deutschen Volkes and by ERC StG 716424 - CASe.

G.Y. was supported by ISF grant 1050/16.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kühne, L., Yashfe, G. Representability of matroids by c-arrangements is undecidable. Isr. J. Math. 252, 95–147 (2022). https://doi.org/10.1007/s11856-022-2345-z

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11856-022-2345-z

Navigation