✦ LIBER ✦

The number of three-choice polygons

✍ Scribed by A. Conway; A.J. Guttmann; M. Delest

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 763 KB
Volume: 26
Category: Article
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(97)00199-4

No coin nor oath required. For personal study only.

✦ Synopsis

polynomial time enumeration method for the three-choice polygon model in two dimensions is given together with numerical analysis of the enumerated series and an argument supporting the asymptotic behaviour of the number of imperfect staircase polygons.

📜 SIMILAR VOLUMES

Closed Forms for the Number of Polygon D

Closed Forms for the Number of Polygon Dissections

✍ Petr Lisoněk 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 178 KB

We consider unlabelled dissections of the regular s-gon into \(r\) cells by means of nonintersecting diagonals. We prove that if the parameter \(r\) is fixed then the number of dissections is quasi-polymonial in \(s\).

Polygonal radix representations of compl

Polygonal radix representations of complex numbers

✍ Taoufik Safer 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 726 KB

Complex numbers can be represented in positional notation using certain digit sets. In this paper, we present the polygonal representation which uses zero and the n-roots of unity as digits. We give conditions on the base in order that every complex number be representable in such a system. We total

MILNOR Number of Complete Intersections

MILNOR Number of Complete Intersections and NEWTON Polygons

✍ Bernd Martin; Gerhard Pfister 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 744 KB

The main result of this 1)aper will he a formula to compute the Milnor number of an isolated complete intersection singulaFity using the Newton polygon. We were inspired by the articles of KOUCHNIRENKO [4], who gave such a formula for hyl)ersurfaces, anti GREUEL and HAMM [2], who proved a similar re

Choice number and energy of graphs

✍ Saieed Akbari; Ebrahim Ghorbani 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 87 KB

Three-coloring the vertices of a triangu

Three-coloring the vertices of a triangulated simple polygon

✍ A.A. Kooshesh; B.M.E. Moret 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 47 KB

On the choice number of claw-free perfec

On the choice number of claw-free perfect graphs

✍ Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 273 KB

We prove that every 3-chromatic claw-free perfect graph is 3-choosable.