Undecidability conjecture for rank-3 gain-graphic matroids
Undecidability conjecture for rank-3 gain-graphic matroids
Let be an infinite group, and consider the class of rank- -gain-graphic matroids. Undecidability conjecture. This class has an undecidable theory. The source presents this as a belief rather than a proved result; it follows the preceding discussion of the unresolved finite-exponent case for infinite groups.
Sources & referencesView supporting material
Primary source
Daryl Funk, Dillon Mayhew and Mike Newman, “Tree automata and pigeonhole classes of matroids: I”, arXiv:1910.04360 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.