Computing surfaces via pq-permutations

✍ Scribed by Gabriele Pulcini

• Publisher: John Wiley and Sons
• Year: 2009
• Tongue: English
• Weight: 195 KB
• Volume: 19
• Category: Article
• ISSN: 0899-9457
• DOI: 10.1002/ima.20186

✦ Synopsis

Abstract

In algebraic topology, compact two‐dimensional manifolds are usually dealt through a well‐defined class of words denoting polygonal presentations. In this article, we show how to eliminate the useless bureaucracy intrinsic to word‐based presentations by considering very simple combinatorial structures called pq‐permutations. Thanks to their specific effectiveness, pq‐permutations induce a rewriting system P able to compute, in a very easy and intuitive way, the quotient surface associated with any given polygonal presentation. The system P is shown to enjoy both the fundamental computational properties of strong normalization and strict strong confluence. © 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 132–139, 2009.