REVIEW 2 major objections 3 minor 12 references
Frieze patterns with coefficients
T0 review · 2 major / 3 minor · reviewed 2026-08-14 · deepseek-v4-flash
Pith's one-line read The paper proves a complete classification of which triples of positive integers label triangles in classic Conway-Coxeter friezes, and a finiteness theorem for frieze patterns with coefficients.
desk verdict The triangle classification is real and the stress-test objection to Prop 5.4 is a red herring; the paper deserves peer review. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The load-bearing machinery is the tame frieze with coefficients viewed as a labelling of the edges and diagonals of a regular polygon that satisfies all Ptolemy relations, with propagation controlled by the $2\times 2$ matrices $\mu(c,d,e)=\begin{pmatrix} 0 & -d/e \\ 1 & c/e \end{pmatrix}$. The triangle classification is carried by the map $\Delta$, which sends a six-tuple $(a_1,a_2,b_1,b_2,c_1,c_2)$ of pairwise coprime nonnegative integers to the triple $(b_1c_1+b_1c_2+b_2c_2,\, a_1c_1+a_2c_1+a_2c_2,\, a_1b_1+a_1b_2+a_2b_2)$; a triple of labels is realizable exactly when it lies in the image of $\Delta$ on nonnegative six-tuples. The proof that $\Delta$'s image is exactly the admissible triples uses the Euclidean algorithm to build triangulations containing a prescribed pair of coprime labels, a transformation $\Gamma_t$ that moves preimages toward the nonnegative orthant while preserving $\Delta$, and a modulo-2 analysis that exposes the 2-adic obstruction.
What would settle it
Enumerate all triangulations of, say, $n$-gons for $n\le 12$, read off every triangle label triple from the corresponding classic frieze, and check the theorem's criterion. Any triple with equal pairwise gcds and equal positive 2-adic valuations would falsify it; so would a concrete case where the gluing construction in Proposition 5.4 fails to produce a genuine polygon triangulation.
Extended reading notes
Core claim
The central discovery is that the question "which labelled triangles appear inside classic Conway-Coxeter friezes?" has a complete and elementary answer. Writing $\nu_2(n)$ for the exponent of 2 in $n$, the paper proves that $(a,b,c)\in\mathbb{N}^3$ occurs as the labels of a triangle in some classic Conway-Coxeter frieze if and only if $\gcd(a,b)=\gcd(b,c)=\gcd(a,c)$ and either $\nu_2(a)=\nu_2(b)=\nu_2(c)=0$ (all three labels odd) or the set $\{\nu_2(a),\nu_2(b),\nu_2(c)\}$ has more than one element. The proof passes through a six-variable parametrization $\Delta$ of triangle labels in terms of pairwise coprime nonnegative integers, a Euclidean-algorithm construction showing that any admissible triple is realized, and a parity analysis showing that the only obstruction is the case where all three labels have the same positive 2-adic valuation. The paper also establishes that frieze patterns with coefficients are governed by $\mu$-matrices and Ptolemy relations, and that for every discrete subset $R\subseteq\mathbb{C}$ and every boundary sequence only finitely many nonzero such friezes exist.
Load-bearing premise
The construction proving that every admissible triple really occurs glues three polygon triangulations together along sides labelled 1 to form an inner unit triangle, and it assumes without a detailed check that the vertex identifications yield a single valid polygon triangulation with the required labels.
Editorial extensions
If this is right
- Given $a,b,c$, checking the classification is elementary: compute the three pairwise gcds and the three 2-adic valuations; if the gcds are not all equal, or the valuations are all equal and positive, no triangle with those labels exists.
- Every labelled subpolygon cut from a classic Conway-Coxeter frieze must have every one of its internal triangles satisfying the theorem's condition, so the triangle classification constrains all larger subpolygons.
- For any discrete subset $R\subseteq\mathbb{C}$ and any fixed boundary sequence, only finitely many nonzero frieze patterns with coefficients over $R$ have that boundary, because Lemma 6.1 bounds every quiddity entry by a constant depending only on the boundary and the minimal modulus of $R$.
- The Euclidean-algorithm construction in Lemma 4.4 gives an explicit triangulation, and hence an explicit classic frieze, containing a triangle with prescribed coprime labels $(1,a,b)$.
Reading between the lines
- A natural extension would be to ask whether the same six-variable parametrization classifies quadrilaterals or larger subpolygons cut from classic friezes; the paper solves only the triangle case, so this is an inference beyond the paper's claims.
- The 2-adic condition suggests that for friezes over other coefficient rings or other lattices, a $p$-adic version of the obstruction might hold; the paper does not pursue this.
- The Euclidean-algorithm proof of Lemma 4.4 could be turned into a direct algorithm: run the extended Euclidean algorithm on the two coprime labels and read off the polygon triangulation; this is implicit in the proof but not stated as an algorithm.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript develops a systematic theory of frieze patterns with coefficients over subsets R of C. A tame condition is introduced, and the authors prove propagation formulae via µ-matrices, a glide-reflection theorem, and the Ptolemy relations. They then study friezes with coefficients obtained by cutting subpolygons out of classic Conway-Coxeter friezes, and they give a classification of the label triples of triangles that can appear in such friezes (Theorems 5.11 and 5.12). Finally, they prove a finiteness result (Proposition 6.3) bounding the number of nonzero frieze patterns with a fixed boundary sequence over a discrete subset of C.
Significance. If the classification is correct, Theorem 5.12 is an attractive, effectively checkable criterion for triangle labels in Conway-Coxeter friezes, and Proposition 6.3 is a genuine generalization of the known finiteness result from classic friezes to frieze patterns with coefficients over arbitrary discrete subsets of C. The µ-matrix and Ptolemy framework in Sections 2-3 is a useful foundational contribution, and Lemma 4.4 gives a nice Euclidean-algorithm construction. However, the converse direction of the classification depends on a gluing argument in Proposition 5.4 that does not preserve frieze labels, so the geometric significance is conditional until that step is repaired.
major comments (2)
- [§5, Proposition 5.4] The gluing argument in Proposition 5.4 is not valid as written. Frieze labels are not intrinsic to the edges of a triangulation; they are recomputed from the whole triangulation after gluing. In the minimal case a1=a2=b1=b2=c1=c2=1, Lemma 4.4 produces three unit triangles, and gluing the three distinguished edges pairwise gives the hexagon with ears (1,2,3), (3,4,5), (5,6,1) and central triangle (1,3,5). The Conway-Coxeter frieze of this triangulation has quiddity (3,1,3,1,3,1), so the central edges have labels 3, not 1; moreover, an edge that had label 2 in one of the component polygons can become a boundary edge of the new polygon with label 1. Thus the claimed configuration of Figure 3 is not produced by the described construction, and the Ptolemy computation identifying (ci,j, cj,k, ck,i) with Delta((a1,a2,b1,b2,c1,c2)) has no basis. Since Theorem 5.12 and the 'if' direction of Theorem 5.11 rely on Proposition 5.4, the classification is not established by the present proof.
- [§5, Lemma 5.1] The proof of Lemma 5.1 ends with the case j = i+1 dismissed as 'not hard to check'. This case is load-bearing because Proposition 5.3 uses the lemma to find a triangle of unit labels, and the natural candidate, namely the triangle of the triangulation containing the boundary edge (i,i+1), need not have all frieze labels equal to 1. The authors should supply a complete proof of this case.
minor comments (3)
- [§5, Theorem 5.10] In the proof of Theorem 5.10, the parity subcase where the two summands in equation (5.6) are odd is deferred with 'the details are left to the reader'; please spell out this case.
- [§5, Remark 5.7] Remark 5.7 is stated as a remark but is used as a fact in the proof of Theorem 5.6; it would be cleaner to label it as a lemma or to incorporate its short proof into the proof of Theorem 5.6.
- [§2, Example 2.4] In Example 2.4(3), 'coeffcents' should be 'coefficients'.
Circularity Check
No significant circularity: the triangle classification and finiteness theorem are derived from the paper's own definitions and from external, non-self-referential results.
full rationale
The paper's derivation chain is self-contained and does not reduce to its own inputs. The main classification theorem (Theorem 5.12) is built from necessary conditions (Lemma 4.2 and Proposition 5.3), an algebraic characterization of the image of the map Delta (Theorems 5.6, 5.9, 5.10, 5.11), and a construction of witness friezes (Proposition 5.4). The construction in Lemma 4.4 is explicitly carried out via the Euclidean algorithm and the Broline-Crowe-Isaacs algorithm, neither of which presupposes the classification. Proposition 5.4 glues three triangulations obtained from Lemma 4.4; whether that gluing argument is fully verified is a mathematical correctness concern, not a circularity concern, because it does not assume the conclusion it is meant to establish. The finiteness result in Section 6 is likewise proved from the defining local equations in Definition 2.1 and an explicit induction in Lemma 6.1; the cited earlier work [6] is used as a benchmark analogue, not as a premise that entails the result. No fitted parameters are renamed as predictions, no uniqueness theorem is imported from the authors' prior work, and no ansatz is smuggled in via citation. The few self-citations (e.g., [4], [5], [6], [9]) provide context or benchmarks and are not load-bearing for the central claims. Therefore the appropriate circularity score is 0.
Assumptions & free parameters
assumptions (4)
- standard math Classic Conway-Coxeter friezes over positive integers are in bijection with triangulations of polygons.
- standard math Frieze entries can be computed from a triangulation by the Broline-Crowe-Isaacs algorithm.
- standard math In a classic Conway-Coxeter frieze, the entries attached to edges of the triangulation are all 1.
- domain assumption The results are restricted to tame frieze patterns, meaning every adjacent 3x3 determinant is 0.
Cite this review
Pith. "Pith review of Frieze patterns with coefficients." pith.science (2026). https://pith.science/paper/IUMPGQ2I
@misc{pith2026190902332,
author = {Pith},
title = {Pith review of: Frieze patterns with coefficients},
year = {2026},
howpublished = {\url{https://pith.science/paper/IUMPGQ2I}},
note = {Machine review of arXiv:1909.02332}
}
read the original 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.
Figures
Reference graph
Works this paper leans on
-
[1]
D. Broline, D. W. Crowe, I. M. Isaacs, The geometry of frieze patterns , Geometriae Dedicata 3 (1974), 171-176
work page 1974
-
[2]
J. H. Conway, H. S. M. Coxeter, Triangulated polygons and frieze patterns , Math. Gaz. 57 (1973), no. 400, 87-94 and no. 401, 175-183
work page 1973
-
[3]
H. S. M. Coxeter, Frieze patterns, Acta Arith. 18 (1971), 297-310
work page 1971
-
[4]
Cuntz, On wild frieze patterns , Exp
M. Cuntz, On wild frieze patterns , Exp. Math. 26 (2017), 342-348
work page 2017
-
[5]
, A combinatorial model for tame frieze patterns , M¨ unster J. Math. 12 (2019), no. 1, 49–56
work page 2019
- [6]
- [7]
- [8]
Show all 12 references
-
[9]
T. Holm, P. Jørgensen, A p-angulated generalisation of Conway and Coxeter’s theorem on frieze patterns , Int. Math. Res. Not. IMRN, to appear, DOI:10.1093/imrn/rny020, arXiv:1709.09861
-
[10]
Morier-Genoud, Coxeter’s frieze patterns at the crossroads of algebra, geometry and combinatorics , Bull
S. Morier-Genoud, Coxeter’s frieze patterns at the crossroads of algebra, geometry and combinatorics , Bull. Lond. Math. Soc. 47 (2015), no. 6, 895-938
2015
-
[11]
Propp, The combinatorics of frieze patterns and Markoff numbers , Preprint (2005), arXiv:math/0511633
J. Propp, The combinatorics of frieze patterns and Markoff numbers , Preprint (2005), arXiv:math/0511633
2005 arXiv
-
[12]
Schiffler, A cluster expansion formula ( An case), Electron
R. Schiffler, A cluster expansion formula ( An case), Electron. J. Combin. 15 (2008) no. 1. Michael Cuntz, Leibniz Universit¨at Hannover, Institut f¨ur Algebra, Zahlentheorie und Diskrete Mathematik, Fakult¨at f¨ur Mathematik und Physik, Welfengarten 1, D-30167 Hannover, Germany...
2008
Reviewed August 14, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.