Counting friezes in type D_n
Combinatorics
2016-10-20 v3
Abstract
We prove that there is an finite number of friezes in type D_n, and we provide a formula to count them. As a corollary, we obtain formulas to count the number of friezes in types B_n, C_n and G_2. We conjecture finiteness (and precise numbers) for other Dynkin types.
Cite
@article{arxiv.1409.3698,
title = {Counting friezes in type D_n},
author = {Bruce Fontaine and Pierre-Guy Plamondon},
journal= {arXiv preprint arXiv:1409.3698},
year = {2016}
}
Comments
9 pages. v2: fixed figure and added links. v3: added introductory section and fixed typo in conjecture; made changes in presentation