Tightness conjecture for the folded-form construction of minimum-density monotone 3-subwords
Tightness conjecture for the folded-form construction of minimum-density monotone 3-subwords
Let , and for variables with
let be the degree- polynomial such that every folded-form -word corresponding to these parameters has monotone 3-subword density . Let denote the limiting minimum density of monotone 3-subwords over .
Folded-form tightness conjecture. The construction's upper bound is tight:
The proposition immediately before the conjecture proves only the corresponding upper bound; equality remains open in the provided text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Raphael Yuster, “On the minimum density of monotone subwords”, arXiv:2407.20641 (2024).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.