ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn be a positive integer, let Rn\mathcal{R}_n denote the 22-rigidity matroid on the edge set of the complete graph on [n][n], and let K3,3K_{3,3} 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 22-rigidity matroid if it has the relevant 22-rigidity rank properties.

Finiteness conjecture. There are only finitely many values of nn for which there exists a symmetric abstract 22-rigidity matroid Mn≠Rn\mathcal{M}_n\neq\mathcal{R}_n in which K3,3K_{3,3} is independent.

The conjecture asks whether the exceptional distinction between symmetric 22-rigidity matroids and the standard 22-rigidity matroid can occur for arbitrarily large numbers of vertices. The paper gives an example at n=6n=6 and reports no further examples at n=7n=7, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.