Finite and infinite frieze patterns from p-angulations and a generalization of Weyl groupoids

A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between $p$-angulations of regular polygons and frieze patterns of type $Λ_p$. One of the features of Conway-Coxeter theory is a combinatorial procedure to obtain from the triangulation all entries of the corresponding frieze pattern. We first present a combinatorial algorithm, involving Chebyshev polynomials, for obtaining from a dissection all entries of the corresponding frieze pattern. As an application we obtain a characterisation of frieze patterns of types $Λ_4$ and $Λ_6$ in terms of all entries (not only the quiddity cycle). We then study infinite frieze patterns of type $Λ_p$, which appeared in a preprint by Banaian and Chen, generalizing the infinite frieze patterns of positive integers studied by Baur, Parsons and Tschabold. As our main result we obtain a combinatorial model for infinite frieze patterns of type $Λ_p$, these are in bijection with certain $p$-angulations of an infinite strip. This extends results by Baur, Parsons and Tschabold from $p=3$ to arbitrary $p\ge 3$, and also provides new insight in the classic case. Infinite frieze patterns of positive integers appear in the context of Weyl groupoids. In the final section we extend this to infinite frieze patterns of type $Λ_p$ for any $p\ge 3$ by introducing a generalization of Cartan graphs and Weyl groupoids. We show that, up to equivalence, there is a 1-1 correspondence between connected simply connected Cartan graphs of type $Λ_p$ of rank two with infinitely many vertices permitting a root system and infinite frieze patterns of type $Λ_p$.

Authors

Publication Details

Journal
Discrete Mathematics
Published
2026-11-04
DOI
https://doi.org/10.1016/j.disc.2026.115514
Primary Topic
Advanced Combinatorial Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Finite and infinite frieze patterns from p-angulations and a generalization of Weyl groupoids

Michael Cuntz, Thorsten Holm, Peter Jorgensen
Discrete Mathematics
Advanced Combinatorial Mathematics
article

Finite and infinite frieze patterns from p-angulations and a generalization of Weyl groupoids

Michael Cuntz, Thorsten Holm, Peter Jorgensen
article en

Abstract

A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between $p$-angulations of regular polygons and frieze patterns of type $Λ_p$. One of the features of Conway-Coxeter theory is a combinatorial procedure to obtain from the triangulation all entries of the corresponding frieze pattern. We first present a combinatorial algorithm, involving Chebyshev polynomials, for obtaining from a dissection all entries of the corresponding frieze pattern. As an application we obtain a characterisation of frieze patterns of types $Λ_4$ and $Λ_6$ in terms of all entries (not only the quiddity cycle). We then study infinite frieze patterns of type $Λ_p$, which appeared in a preprint by Banaian and Chen, generalizing the infinite frieze patterns of positive integers studied by Baur, Parsons and Tschabold. As our main result we obtain a combinatorial model for infinite frieze patterns of type $Λ_p$, these are in bijection with certain $p$-angulations of an infinite strip. This extends results by Baur, Parsons and Tschabold from $p=3$ to arbitrary $p\ge 3$, and also provides new insight in the classic case. Infinite frieze patterns of positive integers appear in the context of Weyl groupoids. In the final section we extend this to infinite frieze patterns of type $Λ_p$ for any $p\ge 3$ by introducing a generalization of Cartan graphs and Weyl groupoids. We show that, up to equivalence, there is a 1-1 correspondence between connected simply connected Cartan graphs of type $Λ_p$ of rank two with infinitely many vertices permitting a root system and infinite frieze patterns of type $Λ_p$.

Discrete MathematicsVol. 350(2)
Openalex Percentile: Top 62%
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon