A lower bound on forcing numbers based on height functions
Combinatorics
2024-11-01 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2410.23621,
title = {A lower bound on forcing numbers based on height functions},
author = {Fateh Aliyev and Nikita Gladkov},
journal= {arXiv preprint arXiv:2410.23621},
year = {2024}
}
Comments
10 pages, 4 figures