Triangulated polygons and frieze patterns

  title={Triangulated polygons and frieze patterns},
  author={John H. Conway and H. S. M. Coxeter},
  journal={The Mathematical Gazette},
  pages={87 - 94}
And then I felt sorry. I don't want to hurt anybody and especially I don't want to hurt poor Emmy Noether. I thought about it repeatedly and finally I decided that, after all, it was not one hundred per cent my fault. She should have answered: "And a mathematician who can only specialise is like a monkey who can only climb DOWN a tree." In fact, neither the up, nor the down, monkey is a viable creature. A real monkey must find food and escape his enemies and so he must incessantly climb up and… 

Friezes over Z [ √ 2 ] and Z [ √ 3 ]

A frieze on a polygon is a map from the diagonals of the polygon to an integral domain that respects the Ptolemy relation. Motivated by Holm and Jørgensen’s study of friezes from gluing together

Friezemønstre og triangulerte polygon

Friezes were introduced by Conway and Coxeter. In what is practically a problem sheet, they imply that there exists a bijection between friezes and triangulated polygons. SL2-tilings with enough ones

Friezes over Z [ √ 2 ] UMN-Twin Cities REU Summer 2021

  • Mathematics
  • 2021
A frieze on a polygon is a map from the diagonals of the polygon to an integral domain which respects the Ptolemy relation. Conway and Coxeter previously studied positive friezes over Z and showed

Frieze groups, cylinders, and quotient groups

This paper is about the classification of frieze groups. A frieze is a decorative strip of paper (or wood, stone,…) on which a pattern is produced by the periodic repetition of a picture along the

Triangulations and Pick's Theorem

where Vi and Vb, respectively, denote the number of lattice points in the interior and on the boundary of P. Observe that Vb includes, in addition to the vertices, any lattice points which occur on


AbstractMuch has been written about the discovery by physicists of quasicrystals and the almost simultaneous discovery by geometers of nonperiodic tessellations and honeycombs. A somewhat similar



Mathematics and Plausible Reasoning

This is a guide to the practical art of plausible reasoning, this book has relevance in every field of intellectual activity. Professor Polya, a world-famous mathematician from Stanford University,

Triangular Dissections of N-Gons

Let f(n) denote the number of dissections of a regular n-gon into n-2 triangles by n-3 non-intersecting diagonals. It is known that and that 1 for n = 3, 4, . . . , where f(2) = 1 by definition. (For

Induction and Analogy in Mathematics

Professor Polya uses mathematics to show how hunches and guesses play an important part in even the most rigorously deductive science, explaining how solutions to problems can be guessed at; good guessing is often more important than rigorous deduction in finding correct solutions.

The number of plane trees

Historical Note on a Recurrent Combinatorial Problem

ISSN: 0002-9890 (Print) 1930-0972 (Online) Journal homepage: Historical Note on a Recurrent Combinatorial Problem William G. Brown To cite this article: William

Some Problems in Combinatorics

The following problems are merely different forms of one 1. In how many ways can a convex polygon of n + 1 sides be split into triangles by non-intersecting diagonals? We represent such a splitting

Forder, Some problems in combinatorics, Mathl Gaz

  • XLV,
  • 1961

Graph theory