A combinatorial model for tame frieze patterns
From MaRDI portal
Abstract: Let be an arbitrary subset of a commutative ring. We introduce a combinatorial model for the set of tame frieze patterns with entries in based on a notion of irreducibility of frieze patterns. When is a ring, then a frieze pattern is reducible if and only if it contains an entry (not on the border) which is or . To my knowledge, this model generalizes simultaneously all previously presented models for tame frieze patterns bounded by 's and 's.
Recommendations
Cited in
(14)- Counting Coxeter's friezes over a finite field via moduli spaces
- Combinatorics of congruence subgroups of the modular group
- Combinatorics of congruence subgroups of the modular group. II
- Frieze patterns over integers and other subsets of the complex numbers
- Factorization of frieze patterns
- Frieze patterns with coefficients
- Frieze patterns over algebraic numbers
- 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})\)
- \(\lambda\)-quiddity over some cyclic subgroups of \(\mathbb{C}\)
- Non-commutative friezes and their determinants, the non-commutative Laurent phenomenon for weak friezes, and frieze gluing
- Classification of monomially irreducible integers and generalizations
- Counting quiddities over finite fields and over some rings \(\mathbb{Z}/N\mathbb{Z} \)
- Frieze patterns over finite commutative local rings
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)