Angle orders,regular n-gon orders and the crossing number |
| |
Authors: | Nicola Santoro Jorge Urrutia |
| |
Affiliation: | (1) School of Computer Science, Carleton University, Ottawa, Canada;(2) Department of Computer Science, University of Ottawa, Ottawa, Canada |
| |
Abstract: | A finite poset P(X,<) on a set X={x1,...,xm} is an angle order (regular n-gon order) if the elements of P(X,<) can be mapped into a family of angular regions on the plane (a family of regular polygons with n sides and having parallel sides) such that xij if and only if the angular region (regular n-gon) for xi is contained in the region (regular n-gon) for xj. In this paper we prove that there are partial orders of dimension 6 with 64 elements which are not angle orders. The smallest partial order previously known not to be an angle order has 198 elements and has dimension 7. We also prove that partial orders of dimension 3 are representable using equilateral triangles with the same orientation. This results does not generalizes to higher dimensions. We will prove that there is a partial order of dimension 4 with 14 elements which is not a regular n-gon order regardless of the value of n. Finally, we prove that partial orders of dimension 3 are regular n-gon orders for n3.This research was supported by the Natural Sciences and Engineering Research Council of Canada, grant numbers A0977 and A2415. |
| |
Keywords: | Primary 06A10 secondary 06B05 05A05 |
本文献已被 SpringerLink 等数据库收录! |
|