Multidimensional unrepetitive configurations (Q1106022)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4060746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multidimensional unrepetitive configurations |
scientific article; zbMATH DE number 4060746 |
Statements
Multidimensional unrepetitive configurations (English)
0 references
1988
0 references
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.
0 references
avoidable patterns
0 references
combinatorics on words
0 references
r-th power-free words
0 references
0.8146352171897888
0 references
0.7549068331718445
0 references
0.7538555860519409
0 references
