Erweiterte Suche

A combinatorial model for tame frieze patterns

Let R be an arbitrary subset of a commutative ring. We introduce a combinatorial model for the set of tame frieze patterns with entries in R based on a notion of irreducibility of frieze patterns. When R is a ring, then a frieze pattern is reducible if and only if it contains an entry (not on the border) which is 1 or −1. To my knowledge, this model generalizes simultaneously all previously presented models for tame frieze patterns bounded by 0s and 1s.

Titel: A combinatorial model for tame frieze patterns
Verfasser: Cuntz, Michael
Dokumenttyp: Artikel
Medientyp: Text
Erscheinungsdatum: 2019
Publikation in MIAMI: 14.03.2019
Datum der letzten Änderung: 16.04.2019
Zeitschrift/Periodikum: Münster Journal of Mathematics / 12 (2019), S. 49 - 56
Verlag/Hrsg.: Mathematisches Institut (Universität Münster)
Fachgebiete: Mathematik
Sprache: Englisch
Format: PDF-Dokument
URN: urn:nbn:de:hbz:6-85169764076
Permalink: https://nbn-resolving.org/urn:nbn:de:hbz:6-85169764076
DOI: 10.17879/85169763588
Onlinezugriff: