Shellability conjecture for k-cut complexes of hexagonal line tilings
Statement
Let be one of , , or , and let be a hexagonal line tiling. Consider the -cut complex of .
Hexagonal line tiling shellability conjecture. For and , the -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 -cut complexes persists for these higher values of . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.