Undecidability of \(c\)-arrangement matroid representations

zbMath1447.05049MaRDI QIDQ2199891

Lukas Kühne, Geva Yashfe

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: http://www.mat.univie.ac.at/~slc/wpapers/FPSAC2020//87.html

zbMATH Keywords

matroidspolymatroidssubspace arrangementsword problems\(c\)-arrangements

Mathematics Subject Classification ID

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)

Related Items (1)

Representability of matroids by \(c\)-arrangements is undecidable

Cites Work

• New inequalities for subspace arrangements
• Unsolvability of the universal theory of finite groups
• A class of geometric lattices based on finite groups
• Two Constructions on Limits of Entropy Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Undecidability of \(c\)-arrangement matroid representations