Centred-hexagonal-number conjecture for the smallest hexagon containing disks

Let nNn\in\mathbb{N} be a centred hexagonal number, and consider the smallest hexagon containing nn disks and the smallest hexagon containing n1n-1 disks. Centred-hexagonal-number conjecture. The smallest hexagon containing nn disks is the same as that containing n1n-1 disks. The source proves that when nn is a centred hexagonal number, the smallest containing hexagon is regular, and proposes this statement as an analogy of the triangular-number conjecture; the asserted equality remains open.

Sources & referencesView supporting material

Primary source

Orgil-Erdene Erdenebaatar and Uuganbaatar Ninjbat, “The smallest convex K-gon containing N congruent disks”, arXiv:2102.02568 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.