Pith. sign in

REVIEW 1 cited by

Polygon dissections and Euler, Fuss, Kirkman and Cayley numbers

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/9811086 v1 pith:4YE6MOQ3 submitted 1998-11-13 math.CO

Jozef H. Przytycki , Adam S. Sikora This is my paper · ORCID
classification math.CO
keywords numberdissectionsformulafussgonsnumberspolygonproof
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We give a short proof for a formula for the number of divisions of a convex (sn+2)-gon along non-crossing diagonals into (sj+2)-gons, where 1<=j<=n-1. In other words, we consider dissections of an (sn+2)-gon into pieces which can be further subdivided into (s+2)-gons. This formula generalizes the formulas for classical numbers of polygon dissections: Euler-Catalan number, Fuss number and Kirkman-Cayley number. Our proof is elementary and does not use the method of generating functions.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Combinatorics of the geometry of Wilson loop diagrams I: equivalence classes via matroids and polytopes

    math-ph 2019-08 conditional novelty 7.0 of 10

    Two Wilson loop diagrams define the same positroid exactly when they differ by retriangulating certain exact subdiagrams, and inequivalent diagrams correspond to non-parallel faces of an associahedron.

Pith tools