Counting friezes in type Dn
Abstract
We prove that there is an finite number of friezes in type Dn, and we provide a formula to count them. As a corollary, we obtain formulas to count the number of friezes in types Bn, Cn and G2. We conjecture finiteness (and precise numbers) for other Dynkin types.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.