Multidimensional unrepetitive configurations
type: Item
instance of: scholarly article
title: Multidimensional unrepetitive configurations
zbMATH Open document ID: 0649.68073
DOI: 10.1016/0304-3975(88)90080-1
author: Arturo Carpi
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
review text: An existence of bi-finite words on finite alphabets which are r-th power- free together with a certain class of their subwords is used for an effective construction of the following n-dimensional configuration: It is possible to associate with each lattice-point of the n-dimensional space a letter of a finite alphabet so that the sequences of the letters corresponding to the points lying on a same straight line are r-th power- free words \((r>1)\). An analogous result is obtained also for some avoidable sets of patterns.
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 05B99
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4060746
zbMATH Keywords: avoidable patterns
zbMATH Keywords: combinatorics on words
zbMATH Keywords: r-th power-free words
Wikidata QID: Q64357140
reviewed by: Marie Demlová
MaRDI profile type: Publication
full work available at URL: 0304-3975(88)90080-1
OpenAlex ID: W2043048015
cites work: Avoidable patterns in strings of symbols
cites work: Q3704906
cites work: Uniformly growing k-th power-free homomorphisms
cites work: Sur un théorème de Thue
cites work: 2726. A problem on strings of beads
cites work: Q4529547
cites work: Unending chess, symbolic dynamics and a problem in semi-groups
cites work: A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
description: scientific article; zbMATH DE number 4060746