Finiteness conjecture for symmetric abstract 2-rigidity matroids
Statement
Let be a positive integer, let denote the -rigidity matroid on the edge set of the complete graph on , and let be the complete bipartite graph with parts of size three. A matroid on this edge set is symmetric if it is invariant under relabelling the vertices, and it is an abstract -rigidity matroid if it has the relevant -rigidity rank properties.
Finiteness conjecture. There are only finitely many values of for which there exists a symmetric abstract -rigidity matroid in which is independent.
The conjecture asks whether the exceptional distinction between symmetric -rigidity matroids and the standard -rigidity matroid can occur for arbitrarily large numbers of vertices. The paper gives an example at and reports no further examples at , but does not resolve the question in general.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.