Representability of matroids by \(c\)-arrangements is undecidable
From MaRDI portal
Publication:2696633
DOI10.1007/s11856-022-2345-zOpenAlexW2995575014MaRDI QIDQ2696633
Publication date: 17 April 2023
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.06123
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unsolvability of the universal theory of finite groups
- On the classification of ideal secret sharing schemes
- Matroid representations by partitions
- Frame matroids and biased graphs
- Almost affine codes
- Skew partial fields, multilinear representations of matroids, and a matrix tree theorem
- Undecidability of \(c\)-arrangement matroid representations
- A class of geometric lattices based on finite groups
- Note on Independence Functions
- Networks, Matroids, and Non-Shannon Information Inequalities
- On the decidability of Diophantine problems in combinatorial geometry
- Polymatroidal dependence structure of a set of random variables
- Network information flow
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- Multi-linear Secret-Sharing Schemes
- Von Staudt constructions for skew-linear and multilinear matroids
