Advanced Search

Match of the following rules

Add Sub-clause

Add Another Rule

Contains the following math formula (red border means the formula is incomplete)

Formula preview

The search session has expired. Please query the service again.

Currently displaying 1 – 2 of 2

Order by Relevance | Title | Year of publication

Pattern avoidance in partial words over a ternary alphabet

Adam Gągol — 2015

Annales UMCS, Mathematica

Blanched-Sadri and Woodhouse in 2013 have proven the conjecture of Cassaigne, stating that any pattern with m distinct variables and of length at least 2m is avoidable over a ternary alphabet and if the length is at least 3 2m−1 it is avoidable over a binary alphabet. They conjectured that similar theorems are true for partial words - sequences, in which some characters are left “blank”. Using method of entropy compression, we obtain the partial words version of the theorem for ternary words

Pattern avoidance in partial words over a ternary alphabet

Adam Gągol — 2015

Annales Universitatis Mariae Curie-Skłodowska, sectio A – Mathematica

Blanched-Sadri and Woodhouse in 2013 have proven the conjecture of Cassaigne, stating that any pattern with $m$ distinct variables and of length at least $2^{m}$ is avoidable over a ternary alphabet and if the length is at least $3 \cdot 2^{m - 1}$ it is avoidable over a binary alphabet. They conjectured that similar theorems are true for partial words – sequences, in which some characters are left “blank”. Using method of entropy compression, we obtain the partial words version of the theorem for ternary words.

Page 1

Download Results (CSV)