Undecidability of c-arrangement matroid representations

zbMATH Open1447.05049MaRDI QIDQ2199891FDOQ2199891

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

matroidssubspace arrangementsword problemspolymatroids\(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)

Cites Work

• A class of geometric lattices based on finite groups
• Unsolvability of the universal theory of finite groups
• New inequalities for subspace arrangements
• Two Constructions on Limits of Entropy Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• On undecidability bounds for matrix decision problems
• Matroid Complexity and Nonsuccinct Descriptions
• Representability of matroids by \(c\)-arrangements is undecidable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2199891)