Metraipolis › archive › dc_d398786ac78d
How large can $B_n$- and $D_n$-friezes be? — arXiv:2609.31537
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.31537
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T02:59:18.245Z
- SHA-256 of the archived text
96f2537134355827e668e101b009fd9fd6f47edc6bb94dab6f6ad248746f0cbf- Stable URL of this page
https://metraipolis.com/documento/dc_d398786ac78d
How to cite
How large can $B_n$- and $D_n$-friezes be? — arXiv:2609.31537 — arXiv (en), https://arxiv.org/abs/2609.31537 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d398786ac78d (Metraipolis archive dc_d398786ac78d, sha256 96f2537134355827e668e101b009fd9fd6f47edc6bb94dab6f6ad248746f0cbf)
BibTeX
@misc{dcd398786ac78d,
title = {How large can $B_n$- and $D_n$-friezes be? — arXiv:2609.31537},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.31537},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d398786ac78d; sha256 96f2537134355827e668e101b009fd9fd6f47edc6bb94dab6f6ad248746f0cbf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.31537. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We pin down the largest entries possible in positive integral friezes of types $D_n$ for $n\geq 4$ and $B_n$ for $n\geq 2$, addressing a conjecture of Robin Zhang. For type $D_n$, the sharp upper bound is $F_nF_{n+1}-1$, and for type $B_n$, it is $F_{n+1}F_{n+2}-1$, where $F_k$ are the Virahanka--Fibonacci numbers.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-28 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.31537 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T02:28:17.931Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-28?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).