Coincidence of node and arc widths in divisor Hasse diagrams
Statement
Let be the Hasse diagram associated with the divisors of . For a level , let and denote its vertices and arcs, respectively, and let and denote the node and arc widths. Relationship between widths by nodes and arcs. There always exists a level such that, if
then
Equivalently, the levels maximizing the number of arcs and vertices should coincide:
The source presents this as an open problem about the relationship between two width invariants of divisor Hasse diagrams.
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.