• English
    • français
  • English 
    • English
    • français
View Item 
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Narad Rampersad
  • View Item
  •   WinnSpace Home
  • Department of Mathematics and Statistics
  • Narad Rampersad
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Further applications of a power series method for pattern avoidance

Thumbnail

View Open

Further applications of a power series method for pattern avoidance.pdf (133.8Kb)

Metadata

Show full item record

Author

Rampersad, Narad

Uri

http://hdl.handle.net/10680/1413

Date

2011-06-21

Citation

N. Rampersad, “Further applications of a power series method for pattern avoidance”, Electron. J. Combinatorics. 18(1) (2011), #P134.

Abstract

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 with k variables of length at least 4k is avoidable on the binary alphabet. This improves an earlier bound due to Cassaigne and Roth.

Collections

  • Narad Rampersad

Report a copyright concern

Contact Us | Send Feedback
 

 

Browse

All of WinnSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

LoginRegister

Report a copyright concern

Contact Us | Send Feedback