{"id":"6f92a26e-2e69-4a47-9b15-c2255bbd7d41","arxiv_id":"1908.03169","paper_version":4,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The repetition threshold for binary rich words is exactly 2+sqrt(2)/2.","lead":"This paper proves that the smallest possible maximum repetition rate for infinite binary rich words is 2 plus the square root of 2 over 2, about 2.707. It resolves a conjecture by Baranwal and Shallit and an open problem posed by Vesti for two-letter alphabets.","discovery_kind":"first_principles","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 2's final inference from Theorem 1 omits the lower-bound half: critical exponents of the whole structured family are never bounded below, so the threshold claim is not yet proved.","rationale":"The reader's weakest assumption is exactly this missing monotonicity/lower-bound lemma; I agree. Other potential issues (e.g., computer backtracking checks without code) are real but secondary: they concern finite verifications that could be certified, whereas the final inference is a structural gap in the argument. The structure theorem itself and the Sturmian analysis of the two extremal words are substantial and convincing; the paper is likely correct. However, as written, Theorem 2 does not follow from the preceding results without an additional argument. This warrants a conditional acceptance: the authors should supply the missing lemma (or an alternative direct proof that every 14/5-free rich word has critical exponent ≥ α) and, ideally, provide certificates or code for the backtracking assertions. The reader's CONDITIONAL verdict stands; no adjustment is needed.","tokens_in":106,"tokens_out":9130,"duration_ms":216239,"concrete_test":"Prove or disprove the missing lemma: for every n ≥ 1 and every rich cube-free w ∈ Σ_3^ω, if f(h^n(w)) (resp. f(g(h^n(w)))) is 14/5-free, then its critical exponent is at least 2+√2/2. A direct way to check whether the concern is substantive is to test the finite analogue by enumerating all rich cube-free words w over {0,1,2} of length ≤ 20 that avoid the factors in F (Lemma 10), compute the critical exponents of f(h^n(w)) and f(g(h^n(w))) for n = 1, 2, 3, and look for any 14/5-free image with exponent below 2+√2/2. If such an image exists, Theorem 2 is false; if none is found, the proof still lacks the analytic lemma, so the final sentence of Section 3 remains unjustified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"Section 3 ends with: \"Since f(h^ω(0)) and f(g(h^ω(0))) both have critical exponent 2+√2/2, Theorem 2 now follows immediately from Theorem 1.\" This sentence carries the entire lower-bound argument, and the paper gives no justification for it. The repetition threshold is an infimum: to show it equals α one must prove both that α is attainable (the two examples) and that no infinite binary rich word has critical exponent < α. Any hypothetical word with exponent < α is automatically 14/5-free, so Theorem 1 applies and gives, for each n, a suffix f(h^n(w_n)) or f(g(h^n(w_n))) with w_n rich and cube-free (by Lemma 7). The proof never shows that all such suffixes have critical exponent at least α. It only computes the exponent for the two special words; other choices of w_n would give different Rote/Sturmian images, and Theorem 17's bound (Eq. 1) is tied to the single slope (3-√2)/7. Thus the structure theorem is compatible with the existence of a 14/5-free rich word of smaller exponent unless a further lower-bound lemma is supplied. The missing lemma would need to assert: for all n ≥ 1 and all rich cube-free w, if f(h^n(w)) or f(g(h^n(w))) is 14/5-free, then its critical exponent is at least 2+√2/2. That is precisely the unstated monotonicity assumption, and it is load-bearing.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the repetition threshold for infinite binary rich words. It introduces three morphisms f, g, h on a ternary alphabet and proves a structure theorem (Theorem 1): every infinite binary rich word that avoids 14/5-powers has, for each n ≥ 1, a suffix of the form f(h^n(w_n)) or f(g(h^n(w_n))) for some infinite ternary word w_n. The proof combines a forbidden-factor analysis with induction, using several computer-assisted backtracking checks. In Section 3 the authors show that the two words f(h^ω(0)) and f(g(h^ω(0))) are rich and have critical exponent 2+√2/2, using a connection to complementary symmetric Rote words and Sturmian words. From Theorem 1 and these two examples they conclude (Theorem 2) that the repetition threshold for binary rich words is exactly 2+√2/2, resolving a conjecture of Baranwal and Shallit.","tokens_in":13565,"tokens_out":8810,"duration_ms":92624,"significance":"If the conclusion is fully established, the paper resolves the binary case of Vesti's problem and confirms the Baranwal–Shallit conjecture. The structure theorem is a strong and interesting dichotomy, and the use of Sturmian/Rote theory to compute critical exponents of the extremal words is elegant and mostly self-contained. However, the final deduction of Theorem 2 from Theorem 1 is missing a load-bearing lower-bound argument. The paper also depends on several undocumented backtracking computations. These issues do not undermine the plausibility of the main result, but they prevent the paper, in its current form, from being a complete proof.","major_comments":[{"comment":"The sentence \"Since f(h^ω(0)) and f(g(h^ω(0))) both have critical exponent 2+√2/2, Theorem 2 now follows immediately from Theorem 1\" is the entire lower-bound half of Theorem 2, and it does not follow as written. To prove RRT(2)=2+√2/2 one must show not only that some binary rich word attains this exponent, but also that every infinite binary rich word has critical exponent at least 2+√2/2. For the lower bound, suppose w is a rich word with critical exponent < 2+√2/2; then w is 14/5-free, so Theorem 1 applies and gives, for each n ≥ 1, a suffix of the form f(h^n(w_n)) or f(g(h^n(w_n))). The paper computes the critical exponent only for the two particular words obtained when w_n is h^ω(0). No lemma states or proves that an arbitrary rich cube-free w_n (as guaranteed by Lemma 7) yields a word f(h^n(w_n)) or f(g(h^n(w_n))) with critical exponent at least 2+√2/2. The missing statement is precisely a monotonicity property: for all n ≥ 1 and all rich cube-free w, if f(h^n(w)) or f(g(h^n(w))) is 14/5-free, then its critical exponent is at least 2+√2/2. Without this lemma, Theorem 1 is compatible with the existence of rich 14/5-free words of smaller critical exponent, and Theorem 2 is not proved.","section":"Section 3, final paragraph"},{"comment":"The exclusion of the factor 212 in Lemma 12 rests on an unspecified backtracking computation: \"Backtracking by computer ... one finds that the longest right extension of 212 has length 21.\" The paper does not provide the code, the actual extension, or a certificate that would allow the reader to verify this finite check. The same is true for Observation 3 and for the entries of Table 1, where only the lengths of the longest right extensions are reported, not the extensions themselves. These checks are load-bearing for the induction in Theorem 1, since they rule out factors that drive the structure theorem. To make the proof reproducible, please include the program (or machine-readable certificates) and state the exact search parameters, including whether the search is over 14/5-free or cube-free extensions and how the stopping condition is certified.","section":"Section 2, Lemma 12 and Observation 3/Table 1"}],"minor_comments":[{"comment":"The phrase \"For everyn ≥ 1\" should read \"For every n ≥ 1\".","section":"Theorem 1 statement"},{"comment":"The text says \"the number of 1's in v_{i+1} ... v_{i+ℓ−1} v_ℓ\" but Lemma 16 gives the number of 1's in v_i ... v_{i+ℓ−1}; the index appears to be shifted and should be corrected.","section":"Theorem 17, after Lemma 16"},{"comment":"The symbol y is used both for the infinite word Δ(x) in Lemma 16 and for the prefix y' in the repetition y^e y'; this is confusing. Consider renaming the prefix, for example to p or z'.","section":"Lemma 16 and Theorem 17"},{"comment":"The sentence \"Since the critical exponent of c_α is 3+√2, the exponent of z cannot be greater than 2\" is compressed. Spelling out that z = r^m with m=2 and e=2 would make the argument easier to follow and would remove an unnecessary hurdle for the reader.","section":"Theorem 17, non-primitive z case"}],"recommendation":"major_revision","confidential_remarks":"The gap in the proof of Theorem 2 is substantial and must be addressed: the lower-bound half is currently missing. If the authors can supply the required monotonicity lemma, the paper would be a strong contribution. The undocumented backtracking checks are a separate reproducibility concern that should also be fixed, though I would not reject on that basis alone. The attribution to Pelantová and the relation to Rote words are handled appropriately."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"The paper proves a structure theorem for infinite binary rich words avoiding 14/5-powers and claims to resolve the Baranwal–Shallit conjecture on the repetition threshold for binary rich words. The structure theorem is the real contribution; the threshold result as written is not fully proved.\n\nWhat is new and good: Theorem 1 is a genuine structural result—every 14/5-free binary rich word has suffixes of the form f(h^n(w_n)) or f(g(h^n(w_n))) with w_n rich and cube-free. The proof via morphisms, forbidden factors, and tree arguments is detailed and mostly convincing. The connection to complementary symmetric Rote words and Sturmian continued fractions is elegant; the analysis of the two words f(h^ω(0)) and f(g(h^ω(0))) is careful, and the increasing sequence E_k converging to 2+√2/2 is a nice piece of work.\n\nSoft spots: The one-sentence deduction of Theorem 2 from Theorem 1 and two examples is load-bearing, not merely terse. The structure theorem only says that for each n some suffix has a particular form; it does not control the critical exponent of such suffixes for arbitrary rich cube-free w_n. To get the lower bound RRT(2) ≥ 2+√2/2, you need to show that every suffix of these forms (or at least every limit word f(h^ω(x)) or f(g(h^ω(x))) with x rich) has critical exponent at least that value. The paper never supplies that lemma. The Sturmian computation is tied to the specific slope (3−√2)/7; other choices of w_n would give different slopes and potentially lower exponents. Without a further argument, the structure theorem is compatible with the existence of a 14/5-free rich word of smaller critical exponent. I agree with the stress-test note: this is a real gap in the lower-bound proof.\n\nA smaller issue: the backtracking checks in Table 1 and Lemma 12 are asserted with no code or certificates. That is common in the field, but for a paper whose main theorem depends on those exclusions, reproducibility would help.\n\nVerdict: The structural part is likely correct, and the intended threshold result may well be true, but the main theorem as stated is not proved. The paper deserves a serious referee and a request for revision—the gap should be closable. If the authors cannot close it, the paper should be revised to present the structure theorem as the main result.\n\nRecommendation: send to peer review, but require the missing lower-bound lemma or a revised main claim.","headline":"The structure theorem is a real contribution, but the final step from Theorem 1 to the claimed repetition threshold skips the entire lower-bound argument.","tokens_in":14080,"tokens_out":4895,"would_cite":false,"duration_ms":48115,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["68R15"],"pacs":[],"model":"deepseek-v4-flash","headline":"The least possible repetition exponent for infinite binary rich words is $2+\\sqrt{2}/2$.","keywords":["rich words","repetition threshold","critical exponent","palindrome","Sturmian words","Rote words","combinatorics on words","morphic words"],"falsifier":"Exhibit an infinite binary rich word whose critical exponent is strictly below $2+\\sqrt{2}/2$, or find a cube-free rich ternary word $w$ containing a $0$ for which $f(h^n(w))$ or $f(g(h^n(w)))$ has critical exponent below $2+\\sqrt{2}/2$; the paper's claim predicts neither exists.","tokens_in":13055,"feed_emoji":"🔁","tokens_out":15626,"duration_ms":138069,"temperature":0.7,"pith_summary":"Infinite binary rich words—words in which every prefix contains as many distinct palindromes as its length—cannot avoid repetitions entirely, so the meaningful question is how little repetition they can force. This paper proves that the answer is exactly $2+\\sqrt{2}/2 \\approx 2.707$: every infinite binary rich word contains a repetition of exponent at least that large, and there is an explicit word that attains it. The proof establishes a structure theorem for rich words that avoid $14/5$-powers, showing that every such word has suffixes built by iterating a fixed ternary-to-binary morphism. It then computes the critical exponent of the two extremal words produced by that construction, confirming the conjectured threshold.","feed_headline":"Binary rich words bottom out at repetition exponent 2+√2/2","feed_subtitle":"The conjectured least critical exponent for binary rich words is proved; larger alphabets remain open.","key_machinery":"The argument rests on a structure theorem and a morphism calculus. The theorem classifies infinite binary rich words that avoid $14/5$-powers: every such word has, for every $n$, a suffix of the form $f(h^n(w_n))$ or $f(g(h^n(w_n)))$, where $f$, $g$, and $h$ are fixed substitutions (for example, $f$ maps $0 \\mapsto 0$, $1 \\mapsto 01$, $2 \\mapsto 011$) and $w_n$ is a cube-free rich ternary word containing a $0$. The calculus identifies the two extremal words $f(h^\\omega(0))$ and $f(g(h^\\omega(0)))$ as complementary symmetric Rote words, meaning their first-difference sequences are Sturmian; this allows the exponent of their longest repetitions to be computed from the continued fraction of a slope, yielding the value $2+\\sqrt{2}/2$.","core_discovery":"The paper's central claim is that the repetition threshold for binary rich words is $2+\\sqrt{2}/2$. The main structural result, Theorem 1, states that if an infinite binary rich word avoids repetitions of exponent at least $14/5$, then for every $n \\ge 1$ some suffix has the form $f(h^n(w_n))$ or $f(g(h^n(w_n)))$, where $w_n$ is a cube-free rich word over $\\{0,1,2\\}$ containing a $0$, and $f$, $g$, and $h$ are explicit morphisms. The paper then proves that the two canonical words $f(h^\\omega(0))$ and $f(g(h^\\omega(0)))$, both complementary symmetric Rote words, have critical exponent exactly $2+\\sqrt{2}/2$; from this and Theorem 1 it concludes that no rich binary word can have a smaller critical exponent, so the threshold is exactly $2+\\sqrt{2}/2$.","pith_inferences":["If the unstated monotonicity is correct, then every $14/5$-free binary rich word should have critical exponent exactly $2+\\sqrt{2}/2$; the paper exhibits two examples but does not rule out other words with the same value.","The morphism calculus suggests that the family of $14/5$-free binary rich words may be generated by iterating $h$ on arbitrary rich seeds, which would make the class amenable to enumeration and could yield upper bounds for larger alphabets through continued fractions of associated slopes.","A direct computational test of the structure theorem would be to generate all cube-free rich ternary words containing a $0$, apply the morphisms $f$ and $f\\circ g$, and check whether any resulting word has critical exponent below $2+\\sqrt{2}/2$; the paper's argument predicts none."],"forward_implications":["The binary repetition threshold for rich words is now known exactly: $2+\\sqrt{2}/2$ is both a lower bound and an attained value.","Every infinite binary rich word contains arbitrarily long factors with exponent at least $2+\\sqrt{2}/2$, so near-threshold rich words are necessarily repetition-heavy.","The structure theorem gives a normal form for $14/5$-free binary rich words, analogous to classical structure theorems for overlap-free words, which may aid future algorithmic studies of these words.","With the binary case resolved, the same threshold question remains open for alphabets of size three and larger, where no conjectured value is currently available."],"supporting_citations":[{"why":"Constructs the extremal word $f(h^\\omega(0))$ with critical exponent $2+\\sqrt{2}/2$ and states the conjecture that this is optimal; supplies the upper-bound witness.","marker":"[3]"},{"why":"Gives the theorem that a word is a complementary symmetric Rote word exactly when its first-difference sequence is Sturmian, used to prove richness of the extremal words.","marker":"[27]"},{"why":"Provides the bound on the length of the longest factor with a given period in Sturmian words, the key quantitative input for the critical-exponent computation.","marker":"[17]"},{"why":"Characterizes repetitions in Sturmian words as conjugates of standard or semi-standard words, used to restrict the shape of candidate repetitions.","marker":"[25]"},{"why":"States that the characteristic Sturmian word with slope $(3-\\sqrt{2})/7$ has critical exponent $3+\\sqrt{2}$, the starting point for the exponent arithmetic.","marker":"[26]"},{"why":"Gives the template for the critical-exponent argument in the proof of Theorem 17, described by the paper as very similar.","marker":"[28]"},{"why":"Supplies the characterization of rich words via unique palindromic suffixes of prefixes, used in Lemma 5 to show that the morphisms preserve non-richness.","marker":"[15]"}],"fun_headline_variants":["Binary rich repetition threshold proved at 2+√2/2","Repetition minimum for binary rich words is 2+√2/2","Proof: binary rich words need exponent 2+√2/2","Binary rich words: least repetition exponent 2+√2/2","Conjecture resolved: binary rich threshold 2+√2/2"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The final inference from the structure theorem to the lower bound relies on the unstated premise that every suffix of the allowed forms attains critical exponent at least $2+\\sqrt{2}/2$; the paper computes the critical exponent explicitly only for its two constructed extremal words, not for all words satisfying the structure theorem.","fun_headline_variants_meta":{"raw":{"variants":["Binary rich repetition threshold proved at 2+√2/2","Repetition minimum for binary rich words is 2+√2/2","Proof: binary rich words need exponent 2+√2/2","Binary rich words: least repetition exponent 2+√2/2","Conjecture resolved: binary rich threshold 2+√2/2"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000328,"raw_usage":{"total_tokens":1819,"prompt_tokens":916,"completion_tokens":903,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":532,"completion_tokens_details":{"reasoning_tokens":805}},"tokens_in":532,"tokens_out":903,"duration_ms":8458,"temperature":1.0,"reasoning_tokens":805,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:23:03.678082+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Exhibit an infinite binary rich word whose critical exponent is strictly below $2+\\sqrt{2}/2$, or find a cube-free rich ternary word $w$ containing a $0$ for which $f(h^n(w))$ or $f(g(h^n(w)))$ has critical exponent below $2+\\sqrt{2}/2$; the paper's claim predicts neither exists.","supporting_citations":[{"cited_title":"Baranwal and J","cited_arxiv_id":null,"evidence_quote":"Constructs the extremal word $f(h^\\omega(0))$ with critical exponent $2+\\sqrt{2}/2$ and states the conjecture that this is optimal; supplies the upper-bound witness."},{"cited_title":"Rote, Sequences with subword complexity 2n, J","cited_arxiv_id":null,"evidence_quote":"Gives the theorem that a word is a complementary symmetric Rote word exactly when its first-difference sequence is Sturmian, used to prove richness of the extremal words."},{"cited_title":"Justin and G","cited_arxiv_id":null,"evidence_quote":"Provides the bound on the length of the longest factor with a given period in Sturmian words, the key quantitative input for the critical-exponent computation."},{"cited_title":"Peltom¨ aki, Characterization of repetitions in Sturmian words: A new proof","cited_arxiv_id":null,"evidence_quote":"Characterizes repetitions in Sturmian words as conjugates of standard or semi-standard words, used to restrict the shape of candidate repetitions."},{"cited_title":"Peltom¨ aki, Privileged W ords and Sturmian W ords, PhD thesis, TUCS Dissertations No","cited_arxiv_id":null,"evidence_quote":"States that the characteristic Sturmian word with slope $(3-\\sqrt{2})/7$ has critical exponent $3+\\sqrt{2}$, the starting point for the exponent arithmetic."},{"cited_title":"Rampersad, J","cited_arxiv_id":null,"evidence_quote":"Gives the template for the critical-exponent argument in the proof of Theorem 17, described by the paper as very similar."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the characterization of rich words via unique palindromic suffixes of prefixes, used in Lemma 5 to show that the morphisms preserve non-richness."}],"review_version":1}