A combinatorial model for tame frieze patterns

DOI10.17879/85169763588zbMATH Open1417.05025arXiv1711.09687MaRDI QIDQ5224441FDOQ5224441

Authors: Michael Cuntz 

Publication date: 23 July 2019

Abstract: 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 $0$'s and $1$'s.

Full work available at URL: https://arxiv.org/abs/1711.09687

Recommendations

• Frieze patterns over integers and other subsets of the complex numbers
• Factorization of frieze patterns
• Frieze patterns with coefficients
• On wild frieze patterns
• Coxeter's frieze patterns at the crossroads of algebra, geometry and combinatorics

zbMATH Keywords

triangulationcluster algebra

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Cluster algebras (13F60) Polyhedra and polytopes; regular figures, division of spaces (51M20)

Cited In (9)

• Irreducible minimal monomial solutions in \(\mathrm{SL}_2(\mathbb{Z}/p^n\mathbb{Z})\)
• Combinatorial description of the principal congruence subgroup \(\Gamma(2)\) in \(\mathrm{SL}(2, \mathbb{Z})\)
• Frieze patterns over integers and other subsets of the complex numbers
• Combinatorics of congruence subgroups of the modular group. II
• Counting Coxeter's friezes over a finite field via moduli spaces
• Combinatorics of congruence subgroups of the modular group
• Frieze patterns with coefficients
• Frieze patterns over algebraic numbers
• Factorization of frieze patterns

This page was built for publication: A combinatorial model for tame frieze patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224441)