The monotonicity conjecture for exceptional-word ratios
The monotonicity conjecture for exceptional-word ratios
For each positive integer , let be the set of exceptional normalized words of length , and let be the set of normalized words of length . Here, a word is exceptional when its hare-fertility exceeds its tortoise-fertility. The monotonicity conjecture for exceptional-word ratios. The numbers
are increasing in . The paper reports computed values for and observes that, if the conjecture holds, the limiting ratio exists; its value remains to be determined.
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
Colin Defant and Noah Kravitz, “Stack-sorting for Words”, arXiv:1809.09158 (2018).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.