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...
Main Authors: | Conlon, D, Fox, J, Sudakov, B |
---|---|
Formato: | Journal article |
Publicado em: |
American Mathematical Society
2019
|
Registos relacionados
-
Unavoidable Sets of Partial Words of Uniform Length
Por: Joey Becker, et al.
Publicado em: (2017-08-01) -
Large unavoidable subtournaments
Por: Long, E
Publicado em: (2016) -
Globalisation as an unavoidable process?
Por: Dujić Ivan
Publicado em: (2012-01-01) -
On the Unavoidability of the Human Sciences
Por: Odo Marquard, et al.
Publicado em: (2021-12-01) -
The unavoidable instability of politics
Por: Vinícius Rodrigues Vieira
Publicado em: (2013-08-01)