2 problems
Unitary-frieze bound conjecture. The value of a frieze at any node of a Dynkin diagram is less than the maximal value of that node over the set of unitary friezes.
Frieze-count conjecture. The numbers of friezes of types , , and are , , and , respectively.