Strongly non-repetitive sequences and progression-free sets (Q1141145): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of the repetitive commutative semigroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5646912 / rank
 
Normal rank

Revision as of 04:20, 13 June 2024

scientific article
Language Label Description Also known as
English
Strongly non-repetitive sequences and progression-free sets
scientific article

    Statements

    Strongly non-repetitive sequences and progression-free sets (English)
    0 references
    1979
    0 references
    infinite sequence on a finite set of symbols
    0 references
    strongly non-repetitive sequence
    0 references
    0 references

    Identifiers