Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2503.14218 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908273590927360 |
|---|---|
| author | Milchev, Valcho |
| author_facet | Milchev, Valcho |
| contents | This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the question of the number of tiles required for all possible tilings - both the number of tiles in total and by type - is developed for the first time in this article. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_14218 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Tiling of Strip Lattices and Asymptotics Milchev, Valcho Combinatorics This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the question of the number of tiles required for all possible tilings - both the number of tiles in total and by type - is developed for the first time in this article. |
| title | Tiling of Strip Lattices and Asymptotics |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2503.14218 |