ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be an RR-disjoint graph. Write B(G)B(G) for its bipartite part, and for each odd cycle CC of GG, let R(C)R(C) denote the subgraph associated with CC. Determinantal factorization conjecture. Then

det⁡A(G)=det⁡A(G[B(G)])∏Cdet⁡A(G[R(C)]).\det A(G)=\det A(G[B(G)])\prod_{C}\det A(G[R(C)]).

The product is taken over all odd cycles CC of GG. The paper proves this factorization for the broader class of BAB-graphs, so the stated conjecture is verified for the particular case of RR-disjoint graphs.

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.