Digital Convexity and Combinatorics on Words
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_ | 1866929751746150400 |
|---|---|
| author | De Luca, Alessandro Fici, Gabriele Frosini, Andrea |
| author_facet | De Luca, Alessandro Fici, Gabriele Frosini, Andrea |
| contents | An upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We study these words from the combinatorial point of view, formalizing their geometric properties and highlighting connections with Christoffel words and finite Sturmian words. In particular, we study from the combinatorial perspective the operations of inflation and deflation on digitally convex words. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_19926 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Digital Convexity and Combinatorics on Words De Luca, Alessandro Fici, Gabriele Frosini, Andrea Combinatorics Discrete Mathematics Formal Languages and Automata Theory 68R15 An upward (resp. downward) digitally convex word is a binary word that best approximates from below (resp. from above) an upward (resp. downward) convex curve in the plane. We study these words from the combinatorial point of view, formalizing their geometric properties and highlighting connections with Christoffel words and finite Sturmian words. In particular, we study from the combinatorial perspective the operations of inflation and deflation on digitally convex words. |
| title | Digital Convexity and Combinatorics on Words |
| topic | Combinatorics Discrete Mathematics Formal Languages and Automata Theory 68R15 |
| url | https://arxiv.org/abs/2502.19926 |