REVIEW 4 major objections 5 minor 4 references
On the construction of frieze patterns from partitions of convex polygons by nonintersecting diagonals
T0 review · 4 major / 5 minor · reviewed 2026-08-04 · deepseek-v4-flash
Pith's one-line read This paper proves by elementary induction that any partition of a convex polygon into polygons by nonintersecting diagonals produces a frieze pattern of width m-3, using weights 2cos(pi/n) per n-gon.
desk verdict An honest but incomplete elementary proof of Holm-Jorgensen's theorem; the weight derivation is clean, but the induction has a genuine base-case gap and some cases are waved off. 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 identity is the pair of evaluations Q_{r-2}(2cos(pi/r)) = 1 and Q_{r-1}(2cos(pi/r)) = 0 for the polynomial sequence Q_1=x, Q_2=x^2-1, Q_n=xQ_{n-1}-Q_{n-2}. These identities make the repeated weight t of an r-gon behave like an inert block: inserting r-2 copies of t into a frieze diagonal does not disturb the required boundary values. The geometric mechanism is the ear cut: a dissection always has a piece whose all but one sides are boundary edges, and removing it leaves a smaller convex polygon whose frieze can be extended by a clean substitution.
What would settle it
Take a concrete dissection, for example the octagon cut into a triangle, a quadrilateral, and a pentagon shown in Example 3.1, assign the weights 1, sqrt(2), and 2cos(pi/5), build the first row from vertex-weight sums, and run the diagonal recurrence; if any adjacent quadruple failed bc - ad = 1, the theorem would be false. A computer search over all dissections up to moderate m with symbolic weights would settle the claim definitively.
Extended reading notes
Core claim
Theorem 3.1 states that a partition of an m-gon into polygonal parts by nonintersecting diagonals generates a frieze pattern of width m-3. For each part with r sides, define its weight as t = 2cos(pi/r); each vertex weight is the sum of weights of the parts incident to it, and the infinite periodic sequence of vertex weights is the first row of a valid frieze. The proof is by induction on the number of sides: every dissection has a piece whose all but one sides are boundary edges of the original polygon, so removing that piece leaves a smaller dissected polygon whose frieze is known by induction. The new frieze is obtained by inserting r-2 repeated entries t into each diagonal, and the inser
Load-bearing premise
The proof assumes, without giving a formal argument, that in every dissection of a convex polygon some piece has all but one of its sides on the original boundary, so that removing it leaves a smaller convex polygon; if that geometric fact failed, the induction step would not get off the ground.
Editorial extensions
If this is right
- Every dissection of a convex m-gon into polygonal pieces by nonintersecting diagonals yields an explicit, periodic frieze pattern of width m-3.
- When all pieces are triangles, the weights are all 1, so the construction reduces to the classical integer friezes from triangulations.
- The trivial partition of an m-gon into one piece shows that the constant first row 2cos(pi/m) itself generates a frieze of width m-3.
- The proof gives a finite inductive recipe: choose an ear piece, read off a frieze for the remaining smaller polygon, then insert r-2 repeated entries into each diagonal to obtain the full frieze.
- Consequently, the frieze relation bc - ad = 1 holds for every adjacent quadruple in the constructed array, for any dissection, with no further hypotheses.
Reading between the lines
- One step beyond the paper: the proof is constructive enough to serve as an algorithm that builds the frieze from any dissection by repeated ear removal, though the paper does not present it in that form.
- Because the induction uses only the two polynomial identities, the construction may work for other algebraic roots satisfying Q_{r-2}=1 and Q_{r-1}=0; the paper's Remark 2.1 already points to such roots and to the negative entries they produce, suggesting a fuller classification of admissible weights.
- The same insertion-block mechanism might extend to dissections of polygons with holes or non-convex polygons whenever an analogous ear cut exists, but convexity is used in the present proof to guarantee the cut leaves a smaller polygon.
- A natural neighbouring question is whether the entries of these general friezes have a combinatorial interpretation, analogous to the counts of triangulations in the triangle-only case; the trigonometric weights would then be entering a counting problem as algebraic numbers.
Signed reviews
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper presents an elementary construction of frieze patterns from a partition of a convex m-gon into polygonal parts by nonintersecting diagonals. The main theorem (Theorem 3.1) asserts that such a partition generates a frieze pattern of width m−3, provided each r-gonal part is assigned the weight 2cos(π/r). The author first develops a polynomial Q_n (essentially a Chebyshev-type sequence) and proves in Theorem 2.2 that at x=2cos(π/n) one has Q_{n−2}=1 and Q_{n−1}=0, which is the frieze terminal condition for a trivial partition. The proof of Theorem 3.1 is by induction: a part P_j with i_j−1 boundary edges is removed, the smaller polygon generates a frieze by the induction hypothesis, and r−2 copies of the new weight are inserted into the first row. Two cases of the insertion are computed, and the remaining cases are dismissed as analogous. The paper also contains illustrative examples, including a pentagon partition and an octagon partition with triangle, quadrangle, and pentagon parts.
Significance. If the induction proof is completed, the paper gives a short, self-contained derivation of the weights 2cos(π/n) that appear in the earlier work of Holm and Jørgensen, and it demonstrates the construction on worked examples. The main theorem is plausible and the computational checks in the first case of the induction are sound. The contribution is expository and incremental rather than a new result, but an elementary proof of this known construction has value. The manuscript is honest in its claims and does not overstate novelty.
major comments (4)
- [Section 3, proof of Theorem 3.1] The induction has no explicit base case. The displayed sum i_1−2+...+i_k−2=n−2 does not imply that some P_j has i_j−1 boundary edges when k=1; for the trivial partition the unique part has n boundary edges. This case must be treated separately. It can be proved from Theorem 2.2 together with the converse stated in Section 1, because all diagonals in a constant first-row pattern coincide, but the paper does not say this. Also, the smallest polygons (m=3 maybe) are not mentioned.
- [Section 3, geometric claim in Theorem 3.1] The assertion 'As i_1−2+...+i_k−2=n−2, then i_j−1 edges of some P_j are edges of P' is not a consequence of that sum alone. For k≥2 the statement is true, but the proof must use the tree structure of the dual graph of the dissection: a leaf part has exactly one internal diagonal and all other sides on the boundary. This is a load-bearing step for the induction and should be stated and proved.
- [Section 3, end of proof of Theorem 3.1] The special cases 'k=0, k=r−2, f_1=a_1+t' are dismissed with 'can be considered in the same way.' Since the theorem is proved by induction, these cases are part of the necessary case analysis. The second case is itself written in compressed form, and the omitted variants are not obviously identical to it. At minimum the author should explain how the two computed cases reduce to or cover these variants, or give the computations for them.
- [Section 2, Theorem 2.2 and its use] Theorem 2.2 establishes that t=2cos(π/n) satisfies the necessary conditions Q_{n−2}(t)=1 and Q_{n−1}(t)=0 for a trivial partition. The paper does not explicitly justify sufficiency, i.e. that these two equalities imply the full diagonal terminal condition for the frieze generated from the constant first row t. The standard converse in Section 1 supplies this, but the author should invoke it explicitly, otherwise the base case of the induction remains incomplete.
minor comments (5)
- [Title/Abstract] The phrase 'not intersecting diagonals' should be 'nonintersecting diagonals' throughout.
- [Section 2, definition of Q_n] The recurrence Q_n = x Q_{n−1} − Q_{n−2} silently assumes Q_0=1. This should be stated explicitly.
- [Theorem 2.2] The notation Q_j(α) is used instead of Q_j(2cos α). After the substitution x=2cos α, the polynomial arguments should be written consistently.
- [Remark 2.1] The claim that weights 2cos(kπ/n), k≥3, generate frieze patterns with negative entries is asserted without proof and is not used in the paper. It should either be proved briefly or removed as distracting.
- [Section 3, indexing of diagonals] The sentence 'The (s−2)-nd element of every diagonal in F is 1 and the next element — 0' should clarify whether elements are numbered from v_0=1 or v_1=a_1. This affects the readability of the subsequent computations.
Circularity Check
No significant circularity: the weight w_n=2cos(pi/n) is derived from a base-case frieze condition and then verified for all dissections by an independent induction; no self-citation is load-bearing.
full rationale
The paper's derivation chain is self-contained in the relevant sense. Section 2 imposes the necessary frieze-terminal conditions on the trivial partition: 'If the trivial partition ... indeed generate a frieze, then Q_{m-2}(t)=1 and Q_{m-1}(t)=0.' It then proves (Theorem 2.2) that t=2cos(pi/n) satisfies these identities. This is a derivation from a base case, not a fit. The general statement is proved by induction in Theorem 3.1: the smaller dissection is assumed to give a frieze by the induction hypothesis, and the inserted polygon is handled using only the Q-identities from Section 2, not by assuming the target theorem for that polygon. Thus the central claim is not equivalent to its input by construction. References [2] and [4] supply standard frieze facts, and [3] is an external prior result, so there is no self-citation chain. The 'opposite is also true' criterion is an external standard fact, not an artifact of this paper. One expository gap exists: the ear lemma 'As i_1-2+...+i_k-2 = n-2, then i_j-1 edges of some P_j are edges of P' is false for the trivial partition k=1, so the induction as written needs a separate base case; however that base case is essentially supplied by Section 2 together with the quoted external sufficiency criterion. That is a proof-completeness issue, not circularity.
Assumptions & free parameters
assumptions (3)
- domain assumption A pattern of width m with the diagonal property (v_{i+1}=a_{i+1}v_i - v_{i-1}, ending with 1 and 0) is a frieze pattern.
- domain assumption In every dissection of a convex n-gon there exists a part P_j with i_j-1 edges on the boundary (an ear polygon).
- domain assumption Standard frieze properties: rows are periodic with period dividing m+3, and the diagonal recurrence holds.
Cite this review
Pith. "Pith review of On the construction of frieze patterns from partitions of convex polygons by nonintersecting diagonals." pith.science (2026). https://pith.science/paper/R7UHWYUJ
@misc{pith2026250907600,
author = {Pith},
title = {Pith review of: On the construction of frieze patterns from partitions of convex polygons by nonintersecting diagonals},
year = {2026},
howpublished = {\url{https://pith.science/paper/R7UHWYUJ}},
note = {Machine review of arXiv:2509.07600}
}
abstract
We demonstrate in an elementary way how to construct a frieze pattern of width $m-3$ from a partition of a convex $m$-gon by not intersecting diagonals.
Reference graph
Works this paper leans on
-
[3]
A $p$-angulated generalisation of Conway and Coxeter's theorem on frieze patterns
T. Holm and P. Jørgensen. Ap-angulated generalisation of Conway and Coxeter’s theorem on frieze patterns. arXiv: 1709.09861
-
[1]
J.H. Conway and H.S.M. Coxeter. Triangulated polygons and frieze patterns.Math. Gaz., 57(400): 87-94, 175-183, 1973
work page 1973
-
[2]
H.S.M. Coxeter. Frieze patterns.Acta Arithm., 18:297-310, 1971
work page 1971
-
[4]
Coxeter's frieze patterns at the crossroads of algebra, geometry and combinatorics
S. Morier-Genoud. Coxeter’s frieze patterns at the crossroads of algebra, geometry and combinatorics. arXiv:1503.05049. Email address:yukochetkov@hse.ru,yuyukochetkov@gmail.com
Reviewed August 4, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.