Maximal 2-dimensional binary words of bounded degree
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909616880746496 |
|---|---|
| author | Massé, Alexandre Blondin Goupil, Alain L'Heureux, Ralphael Marin, Louis |
| author_facet | Massé, Alexandre Blondin Goupil, Alain L'Heureux, Ralphael Marin, Louis |
| contents | Let d be an integer between 0 and 4, and W be a 2-dimensional word of dimensions h x w on the binary alphabet {0, 1}, where h, w in Z > 0. Assume that each occurrence of the letter 1 in W is adjacent to at most d letters 1. We provide an exact formula for the maximum number of letters 1 that can occur in W for fixed (h, w). As a byproduct, we deduce an upper bound on the length of maximum snake polyominoes contained in a h x w rectangle. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_13640 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Maximal 2-dimensional binary words of bounded degree Massé, Alexandre Blondin Goupil, Alain L'Heureux, Ralphael Marin, Louis Combinatorics Formal Languages and Automata Theory Let d be an integer between 0 and 4, and W be a 2-dimensional word of dimensions h x w on the binary alphabet {0, 1}, where h, w in Z > 0. Assume that each occurrence of the letter 1 in W is adjacent to at most d letters 1. We provide an exact formula for the maximum number of letters 1 that can occur in W for fixed (h, w). As a byproduct, we deduce an upper bound on the length of maximum snake polyominoes contained in a h x w rectangle. |
| title | Maximal 2-dimensional binary words of bounded degree |
| topic | Combinatorics Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2505.13640 |