On a construction of Friedman
Abstract
H. Friedman obtained remarkable results about the longest finite sequence x such that for all i = j the word x[i..2i] is not a subsequence of x[j..2j]. In this note we consider what happens when ``subsequence'' is replaced by ``subword''.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.