Order, genus, and diagram invariance (Q1182056)

Our objective is to draw the diagram of an ordered set, without edge crossings, on surfaces. We are motivated, on the one hand, by such particular themes as ice flow analysis, as well as visibility problems from computational geometry, in general and, on the other hand, by the continuing interest in drawing and reading diagrams of orders arising from sorting, scheduling and search problems in optimization. Here is our principal result. Theorem 1. The genus of any ordered set equals the genus of its covering graph.