ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk be one of 44, 55, or 66, and let HH be a hexagonal line tiling. Consider the kk-cut complex of HH.

Hexagonal line tiling shellability conjecture. For k=4,5,k=4,5, and 66, the kk-cut complex of the hexagonal line tiling is shellable.

The conjecture is motivated by computational experiments using SageMath, which suggest that the behavior proved in the paper for 33-cut complexes persists for these higher values of kk. No resolution is given in the supplied source.

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.