Undecidability of c-arrangement matroid representations
From MaRDI portal
Publication:2199891
Recommendations
- Representability of matroids by \(c\)-arrangements is undecidable
- Matroids of combinatorially formal arrangements are not determined by their points and lines
- Von Staudt constructions for skew-linear and multilinear matroids
- On Matroid Representability and Minor Problems
- scientific article; zbMATH DE number 3880730
Cites work
- scientific article; zbMATH DE number 3963849 (Why is no real title available?)
- scientific article; zbMATH DE number 192849 (Why is no real title available?)
- scientific article; zbMATH DE number 727439 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3351601 (Why is no real title available?)
- A class of geometric lattices based on finite groups
- New inequalities for subspace arrangements
- Two Constructions on Limits of Entropy Functions
- Unsolvability of the universal theory of finite groups
Cited in
(3)
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)