Scholarlink

<p>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 2<i>n</i> by 2<i>n</i> square as well as other cases.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Lower Bound on Forcing Numbers Based on Height Functions

  • 期刊论文

  • 发表日期：

    2026年1月5日

查看全文
  • Fateh Aliyev,
  • Nikita Gladkov

摘要

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.