.png){kind=icon}
.png){kind=icon}
Return
Computing Surfaces via pq-Permutations
.png){kind=icon}
OA
AI
DOI：10.1002/ima.20186.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2009 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 19, 132-139, 2009; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ima.20186
Keywords:
algebraic topology
classification of surfaces
linear proof-theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
2.1K
Citations:
2.3K
Organization
No organization information available