ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GH(n)G^H(n) be the Hasse diagram associated with the divisors of nn. For a level ll, let Vl(n)V_l(n) and ElH(n)E^H_l(n) denote its vertices and arcs, respectively, and let Wv(n)W_v(n) and We(n)W_e(n) denote the node and arc widths. Relationship between widths by nodes and arcs. There always exists a level ll such that, if

∣Vl(n)∣=Wv(n),|V_l(n)|=W_v(n),

then

∣ElH(n)∣=We(n).|E^H_l(n)|=W_e(n).

Equivalently, the levels maximizing the number of arcs and vertices should coincide:

argmax⁡l∈{0,..,Ω(n)−1}∣ElH(n)∣=argmax⁡l∈{0,..,Ω(n)−1}∣Vl(n)∣.\operatornamewithlimits{argmax}_{l\in\{0,..,\Omega(n)-1\}}|E^H_l(n)|=\operatornamewithlimits{argmax}_{l\in\{0,..,\Omega(n)-1\}}|V_l(n)|.

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 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.