WinnSpace Repository

Avoidability index for binary patterns with reversal

Show simple item record

dc.contributor.author Currie, James
dc.contributor.author Lafrance, Philip
dc.date.accessioned 2018-01-11T22:49:15Z
dc.date.available 2018-01-11T22:49:15Z
dc.date.issued 2016-02-19
dc.identifier.citation James D. Currie and Philip Lafrance, "Avoidability Index for Binary Patterns with Reversal," Electronic Journal of Combinatorics 23(1) (2016) P1.36. en_US
dc.identifier.issn 1077-8926
dc.identifier.uri http://hdl.handle.net/10680/1340
dc.description.abstract For every pattern p over the alphabet {x, x^R, y, y^R}, we specify the least k such that p is k-avoidable. en_US
dc.description.sponsorship The first author was supported by an NSERC Discovery Grant, and also by Deutsche Forschungsge-meinschaft, which supported him through its Mercator program. The second author was supported through the NSERC USRA program. en_US
dc.language.iso en en_US
dc.publisher The Electronic Journal of Combinatorics en_US
dc.subject pattern avoidance en_US
dc.title Avoidability index for binary patterns with reversal en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search WinnSpace


Browse

My Account