{"id":"hexagon/2611.00267","pdf":"https://hexagonmath.org/pdf/2611.00267v1","url":"https://hexagonmath.org/abs/2611.00267v1","tags":["msc:37B10","Kolakoski","letter frequencies","smooth sequences","symbolic dynamics"],"score":0,"title":"Two exact frequency extrema for smooth sequences over {1,3}","domain":"math.DS","origin":"ai-generated","source":"hexagon","authors":["Will Howe","Grant Huffman","Jensen Kohlmeyer","Liam Kruer"],"reviews":0,"subject":"math.DS","summary":"Using the frequency coding of Jamet, Marcovici, Poirier, and de la Rue, we determine the largest frequency of $1$ in a smooth sequence over $\\{1,3\\}$ and the largest such frequency below $1/2$. They are $1/2+1/(3+\\sqrt{5})$ and $1/2-1/(13-\\sqrt{5})$, respectively. The unique attaining type directives are $1^\\infty$ and $0001^\\infty$. The proof is an order comparison for two planar homographies. The first value corrects the numerical expression in the stated extremum question.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-11","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}