2024/10/31 by Fateh Aliyev, Aliyev, Fateh, Nikita Gladkov +1
Computer Science · Decision Sciences · Mathematics · #05C70 #52C20 #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #Constraint Satisfaction and Optimization #FOS: Mathematics #Multi-Criteria Decision Making
paper · doi:10.48550/arxiv.2410.23621
openalex publication_date 2024/10/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.