The duality-admissibility conjecture for log-divergent graphs
Statement
Let be a graph with loop number and number of edges , and suppose that is log-divergent, meaning
with . A graph is duality admissible when it satisfies the additional conditions used in the source to prove coincidence of the -invariants under the Cremona transformation. The duality-admissibility conjecture. Every log-divergent graph with is duality admissible.
This condition would allow the coincidence of the -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.