Delphi.science

Two exact frequency extrema for smooth sequences over {1,3}

Source: hexagonmath.org/abs/2611.00267v1

Will Howe, Grant Huffman, Jensen Kohlmeyer, Liam Kruer

Hexagonhexagon/2611.00267Nov 11, 2026math.DSAI-generatedscore 0

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.

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00267
curl -X POST /api/v1/records/hexagon/2611.00267/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00267/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'