Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2410.23621 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909373293395968 |
|---|---|
| author | Aliyev, Fateh Gladkov, Nikita |
| author_facet | Aliyev, Fateh Gladkov, Nikita |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23621 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A lower bound on forcing numbers based on height functions Aliyev, Fateh Gladkov, Nikita Combinatorics 05C70, 52C20 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. |
| title | A lower bound on forcing numbers based on height functions |
| topic | Combinatorics 05C70, 52C20 |
| url | https://arxiv.org/abs/2410.23621 |