On a construction of Friedman

Simple item page
dc.creatorShallit, Jeffrey
dc.creatorWang, Ming-wei
dc.date2000-09-08
dc.date.accessioned2026-07-07T04:37:17Z
dc.date.available2026-07-07T04:37:17Z
dc.descriptionH. Friedman obtained remarkable results about the longest finite sequence $x$ such that for all $i \not= 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''.
dc.identifierhttps://arxiv.org/abs/math/0009090
dc.identifierhttp://arxiv.org/abs/math/0009090
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/59899
dc.subjectCombinatorics
dc.subject68R15
dc.titleOn a construction of Friedman
dc.typetext

Files

Collections

arXiv