The generic-rank conjecture for bipartite circulant graphs
Statement
Let be a bipartite circulant graph of the form considered in the paper, and let the generic completion rank be the rank attained by a generic matrix completion. The dimension-count prediction is
Bipartite circulant generic-rank conjecture. Every graph has generic completion rank predicted by the dimension count; equivalently,
The paper proves the dimension-count prediction for a subset of these graphs and conjectures it for all bipartite circulant graphs of this form. The claim is presented as unresolved.
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.