A lower bound on forcing numbers based on height functions
Fateh Aliyev, Nikita Gladkov·2024-10-31·via math.CO updates on arXiv.org
We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.