ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GH(n)G^H(n) be the Hasse diagram associated with the divisors of nn, let Vl(n)V_l(n) denote its vertices at level ll, and let Wv(n)W_v(n) denote the node width. Node width at middle level. The node width should equal the number of vertices at the middle level:

Wv(n)=∣V⌈Ω(n)/2⌉(n)∣.W_v(n)=|V_{\lceil \Omega(n)/2\rceil}(n)|.

The source lists this among intriguing conjectures posed as open problems about graph 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.