Table of Contents
Fetching ...

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

Michael Cuntz, Thorsten Holm, Peter Jorgensen

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$.

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

Abstract

A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between -angulations of regular polygons and frieze patterns of type . 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 and in terms of all entries (not only the quiddity cycle). We then study infinite frieze patterns of type , 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 , these are in bijection with certain -angulations of an infinite strip. This extends results by Baur, Parsons and Tschabold from to arbitrary , 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 for any 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 of rank two with infinitely many vertices permitting a root system and infinite frieze patterns of type .
Paper Structure (11 sections, 24 theorems, 125 equations, 3 figures)

This paper contains 11 sections, 24 theorems, 125 equations, 3 figures.

Key Result

Theorem 2.5

(HJ17) Let $p\ge 3$ and $n\ge 3$ be integers. There is a bijection between $p$-angulations of a regular $n$-gon and frieze patterns of type $\Lambda_p$ with height $n-3$.

Figures (3)

  • Figure :
  • Figure :
  • Figure :

Theorems & Definitions (100)

  • Definition 2.1
  • Remark 2.2
  • Example 2.3
  • Definition 2.4
  • Theorem 2.5
  • Example 2.6
  • Example 2.7
  • Definition 3.1
  • Remark 3.2
  • Remark 3.3
  • ...and 90 more