Résumé
We work on the Réveillès hyperplane P(v,0,ω) with normal vector v∈Rd, shift μ = 0 and thickness ω∈R. Such a hyperplane is connected as soon as ω is greater than some value Ω(v,0), called the connecting thickness of v with null shift. In the case where v satisfies the so called Kraaikamp and Meester criterion, at the connecting thickness the hyperplane has very specific properties. First of all the adjacency graph of the voxels forms a tree. This tree appeared in many works both in discrete geometry and in discrete dynamical systems. In addition, it is well known that for a finite coding of length n of discrete lines, the number of palindromes in the language is exactly n + 1. We extend this notion of language to labeled trees and we compute the number of distinct palindromes. In fact for our voxel adjacency trees with n letters we show that the number of palindromes in the language is also n + 1. This result establishes a first link between combinatorics on words, palindromic languages, voxel adjacency trees and connecting thickness of Réveillès hyperplanes. It also provides a better understanding of the combinatorial structure of discrete planes.
| Langue originale | Anglais |
|---|---|
| Pages (de - à) | 101-108 |
| Nombre de pages | 8 |
| Revue | Theoretical Computer Science |
| Volume | 624 |
| Les DOIs | |
| État | Publié - 18 avr. 2016 |
| Modification externe | Oui |
Classification disciplinaire ASJC Scopus
- Informatique théorique
- Informatique générale
Empreinte digitale
Voici les principaux termes ou expressions associés à « Palindromic language of thin discrete planes ». Ces libellés thématiques sont générés à partir du titre et du résumé de la publication. Ensemble, ils forment une empreinte digitale unique.Citer cette ressource
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver