ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a full-rank typical graph. A GG-partial matrix is a partial symmetric matrix whose specified off-diagonal entries correspond to the edges of GG; it is minimally completable to full rank if it has a completion of full rank but no proper submatrix obtained by deleting a specified entry has this property. Write GcG^c for the complement of GG, and let In⁡(M)=(m,n,0)\operatorname{In}(M)=(m,n,0) denote the common inertia of all completions of MM, with mm positive and nn negative eigenvalues. A proper bicoloring of GcG^c assigns red or blue to every vertex so that adjacent vertices have different colors. Inertia–bicoloring conjecture. There exists a GG-partial matrix MM, minimally completable to full rank, with In⁡(M)=(m,n,0)\operatorname{In}(M)=(m,n,0) if and only if GcG^c has a proper bicoloring with mm red vertices and nn blue vertices. The conjecture characterizes the possible inertias of minimally full-rank-completable partial matrices in terms of proper two-colorings of the complement. The stated evidence is that the authors found no full-rank typical graph and corresponding partial matrix whose inertia failed to arise from such a coloring; the general characterization remains open.

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.