Papers
Topics
Authors
Recent
Search
2000 character limit reached

Frieze patterns with coefficients

Published 5 Sep 2019 in math.CO | (1909.02332v1)

Abstract: Frieze patterns, as introduced by Coxeter in the 1970's, are closely related to cluster algebras without coefficients. A suitable generalization of frieze patterns, linked to cluster algebras with coefficients, has only briefly appeared in an unpublished manuscript by Propp. In this paper we study these frieze patterns with coefficients systematically and prove various fundamental results, generalizing classic results for frieze patterns. As a consequence we see how frieze patterns with coefficients can be obtained from classic frieze patterns by cutting out subpolygons from the triangulated polygons associated to classic Conway-Coxeter frieze patterns. We address the question of which frieze patterns with coefficients can be obtained in this way and solve this problem completely for triangles. Finally, we prove a finiteness result for frieze patterns with coefficients by showing that for a given boundary sequence there are only finitely many (non-zero) frieze patterns with coefficients with entries in a discrete subset of the complex numbers.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.