ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph with loop number hGh_G and number of edges nGn_G, and suppose that GG is log-divergent, meaning

NG=2hG,N_G=2h_G,

with hG,nG≥3h_G,n_G\geq 3. A graph is duality admissible when it satisfies the additional conditions used in the source to prove coincidence of the c2c_2-invariants under the Cremona transformation. The duality-admissibility conjecture. Every log-divergent graph GG with hG,nG≥3h_G,n_G\geq 3 is duality admissible.

This condition would allow the coincidence of the c2c_2-invariants in the different graph representations to be extended beyond the planar and already admissible cases. The source states the claim as a conjecture, but gives no resolution status.

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.