Further applications of a power series method for pattern avoidance

@article{Rampersad2011FurtherAO,
  title={Further applications of a power series method for pattern avoidance},
  author={Narad Rampersad},
  journal={Electr. J. Comb.},
  year={2011},
  volume={18}
}
In combinatorics on words, a word w over an alphabet Σ is said to avoid a pattern p over an alphabet ∆ if there is no factor x of w and no non-erasing morphism h from ∆ to Σ such that h(p) = x. Bell and Goh have recently applied an algebraic technique due to Golod to show that for a certain wide class of patterns p there are exponentially many words of length n over a 4-letter alphabet that avoid p. We consider some further consequences of their work. In particular, we show that any pattern… CONTINUE READING

Topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 20 REFERENCES

Lower bounds for pattern avoidance

  • J. Bell, T. L. Goh
  • Inform. and Comput. 205
  • 2007
Highly Influential
6 Excerpts

Motifs évitables et régularités dans les mots

  • J. Cassaigne
  • Thèse de doctorat, Université Paris 6, LITP…
  • 2011
1 Excerpt

Similar Papers

Loading similar papers…