Skip to main content
QUICK REVIEW

[Paper Review] Ptolemy relations for punctured discs

Karin Baur, Bethany Marsh|arXiv (Cornell University)|Nov 9, 2007
Algebraic structures and combinatorial models11 references5 citations
TL;DR

This paper constructs frieze patterns of type $D_N$ using matchings between vertices and triangles in triangulations of a punctured disc, showing that for triangulations corresponding to orientations of the $D_N$ Dynkin diagram, the entries in the frieze pattern coincide with specialisations of cluster variables in the Fomin-Zelevinsky cluster algebra of type $D_N$. The work generalizes Conway-Coxeter frieze patterns to the punctured case and establishes a direct link between combinatorics of matchings and cluster algebra structures.

ABSTRACT

We construct frieze patterns of type D_N with entries which are numbers of matchings between vertices and triangles of corresponding triangulations of a punctured disc. For triangulations corresponding to orientations of the Dynkin diagram of type D_N, we show that the numbers in the pattern can be interpreted as specialisations of cluster variables in the corresponding Fomin-Zelevinsky cluster algebra.

Motivation & Objective

  • To extend the theory of frieze patterns from unpunctured to punctured discs, generalizing Conway-Coxeter results.
  • To define a new class of frieze patterns of type $D_N$ using combinatorial matchings between vertices and triangles in triangulations.
  • To establish a correspondence between entries in these frieze patterns and specialisations of cluster variables in the Fomin-Zelevinsky cluster algebra of type $D_N$.
  • To show that for triangulations corresponding to oriented $D_N$ Dynkin diagrams, the frieze entries match cluster variable specialisations.

Proposed method

  • Define arcs in a punctured disc with $N$ boundary marked points, including standard arcs $D_{ij}$ and puncture-incident arcs $D_{i0}$.
  • Introduce matching numbers $m_{ij}$ and $m_{i0}$ counting matchings between vertices and triangles in a triangulation of the punctured disc.
  • Establish a set of four frieze relations (1)-(4) that the matching numbers must satisfy, generalizing the Ptolemy relation.
  • Use the structure of tagged triangulations of the punctured disc to define the frieze pattern, ensuring consistency with cluster algebra exchange relations.
  • Specialise cluster variables $x_{ij}$ and $x_{i0}$ of the $D_N$ cluster algebra to 1 to obtain integer values $u_{ij}$ and $u_{i0}$, which are compared to matching counts.
  • Prove that when the quiver of the seed is an orientation of the $D_N$ Dynkin diagram, the matching counts $m_{ij}$ and $m_{i0}$ equal the specialisations $u_{ij}$ and $u_{i0}$.

Experimental results

Research questions

  • RQ1Can frieze patterns of type $D_N$ be constructed combinatorially from triangulations of a punctured disc using matchings between vertices and triangles?
  • RQ2Do the entries in such a frieze pattern correspond to specialisations of cluster variables in the $D_N$ cluster algebra?
  • RQ3Is the correspondence between matching counts and cluster variable specialisations valid specifically for triangulations whose quivers are orientations of the $D_N$ Dynkin diagram?
  • RQ4Can the classical frieze pattern structure be generalized to the punctured disc setting while preserving the Ptolemy-type relations?
  • RQ5Are all frieze patterns of type $D_N$ realizable via some tagged triangulation of the punctured disc?

Key findings

  • The matching numbers $m_{ij}$ and $m_{i0}$ defined on a triangulation of a punctured disc satisfy the frieze relations (1)-(4), forming a valid frieze pattern of type $D_N$.
  • For triangulations corresponding to an orientation of the $D_N$ Dynkin diagram, the matching counts $m_{ij}$ and $m_{i0}$ exactly equal the specialisations $u_{ij}$ and $u_{i0}$ of the corresponding cluster variables in the $D_N$ cluster algebra.
  • In the example of $D_8$, the entry under arc $D_{27}$ is 23, corresponding to 23 matchings between the sub-triangulation and vertices $\{3,4,5,6\}$, confirming the combinatorial count.
  • The entry under $D_{52}$ is 5, corresponding to five matchings in a region not splitting any triangle, illustrating the counting mechanism.
  • The entry under $D_{22}$ is 12, representing 12 matchings involving all vertices and the puncture, with triangles split by the arc still counted appropriately.
  • For all $i$, the ratio $D_{ii}/D_{i0} = 4$, matching the number of triangles incident to the puncture, providing a consistency check on the model.

Better researchstarts right now

From reading papers to final review, dramatically reduce your research time.

No credit card · Free plan available

This review was created by AI and reviewed by human editors.