Passer à la navigation principale Passer à la recherche Passer au contenu principal

Palindromic language of thin discrete planes

  • CNRS
  • Université Savoie Mont Blanc

Résultats de recherche: Contribution à un journal › Article publié dans une revue, révisé par les pairs › Revue par des pairs

1 Citation (Scopus)

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 originaleAnglais
Pages (de - à)101-108
Nombre de pages8
RevueTheoretical Computer Science
Volume624
Les DOIs
ÉtatPublié - 18 avr. 2016
Modification externeOui

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