MathDB
If too many subsequences are palindromic, we are periodic

Source: MEMO 2024 T4

August 27, 2024
combinatoricscombinatorics proposedSequenceSequencespalindromesPeriodic sequence

Problem Statement

A finite sequence x1,,xrx_1,\dots,x_r of positive integers is a palindrome if xi=xr+1ix_i=x_{r+1-i} for all integers 1ir1 \le i \le r. Let a1,a2,a_1,a_2,\dots be an infinite sequence of positive integers. For a positive integer j2j \ge 2, denote by a[j]a[j] the finite subsequence a1,a2,,aj1a_1,a_2,\dots,a_{j-1}. Suppose that there exists a strictly increasing infinite sequence b1,b2,b_1,b_2,\dots of positive integers such that for every positive integer nn, the subsequence a[bn]a[b_n] is a palindrome and bn+2bn+1+bnb_{n+2} \le b_{n+1}+b_n. Prove that there exists a positive integer TT such that ai=ai+Ta_i=a_{i+T} for every positive integer ii.