Indexed metadata

How large can BnB_n- and DnD_n-friezes be?

Florian Ito Sprung

Source record

Source: arXiv

Published: Sep 25, 2026

arXiv: 2609.31537

Open original source ↗

Source abstract

We pin down the largest entries possible in positive integral friezes of types DnD_n for n≥4n\geq 4 and BnB_n for n≥2n\geq 2, addressing a conjecture of Robin Zhang. For type DnD_n, the sharp upper bound is FnFn+1−1F_nF_{n+1}-1, and for type BnB_n, it is Fn+1Fn+2−1F_{n+1}F_{n+2}-1, where FkF_k are the Virahanka--Fibonacci numbers.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.