Tower-type bounds for unavoidable patterns in words
A word w is said to contain the pattern P if there is a way to substitute a nonempty word for each letter in P so that the resulting word is a subword of w. Bean, Ehrenfeucht and McNulty and, independently, Zimin characterised the patterns P which are unavoidable, in the sense that any sufficiently...
Autors principals: | Conlon, D, Fox, J, Sudakov, B |
---|---|
Format: | Journal article |
Publicat: |
American Mathematical Society
2019
|
Ítems similars
-
Unavoidable Sets of Partial Words of Uniform Length
per: Joey Becker, et al.
Publicat: (2017-08-01) -
Large unavoidable subtournaments
per: Long, E
Publicat: (2016) -
Globalisation as an unavoidable process?
per: Dujić Ivan
Publicat: (2012-01-01) -
On the Unavoidability of the Human Sciences
per: Odo Marquard, et al.
Publicat: (2021-12-01) -
The unavoidable instability of politics
per: Vinícius Rodrigues Vieira
Publicat: (2013-08-01)