2000 character limit reached
A lower bound on forcing numbers based on height functions
Published 31 Oct 2024 in math.CO | (2410.23621v1)
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.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.