7,351 research outputs found
Projective plane embeddings of polyhedral pinched maps
We give various conditions on pinched-torus polyhedral maps which are necessary for their graphs to be embeddable in the projective plane. Our other main result is that even if the graph of a polyhedral map in the pinched torus is embeddable in a projective plane, the map induced by the embedding cannot be polyhedral, but must have all faces bounded by cycles. Finally, we give a class of examples of graphs which have polyhedral embeddings on the pinched torus and also on orientable surfaces of arbitrary high genus
On Hardness of the Joint Crossing Number
The Joint Crossing Number problem asks for a simultaneous embedding of two
disjoint graphs into one surface such that the number of edge crossings
(between the two graphs) is minimized. It was introduced by Negami in 2001 in
connection with diagonal flips in triangulations of surfaces, and subsequently
investigated in a general form for small-genus surfaces. We prove that all of
the commonly considered variants of this problem are NP-hard already in the
orientable surface of genus 6, by a reduction from a special variant of the
anchored crossing number problem of Cabello and Mohar
Embeddings and immersions of tropical curves
We construct immersions of trivalent abstract tropical curves in the
Euclidean plane and embeddings of all abstract tropical curves in higher
dimensional Euclidean space. Since not all curves have an embedding in the
plane, we define the tropical crossing number of an abstract tropical curve to
be the minimum number of self-intersections, counted with multiplicity, over
all its immersions in the plane. We show that the tropical crossing number is
at most quadratic in the number of edges and this bound is sharp. For curves of
genus up to two, we systematically compute the crossing number. Finally, we use
our immersed tropical curves to construct totally faithful nodal algebraic
curves via lifting results of Mikhalkin and Shustin.Comment: 23 pages, 14 figures, final submitted versio
Simultaneous Embeddability of Two Partitions
We study the simultaneous embeddability of a pair of partitions of the same
underlying set into disjoint blocks. Each element of the set is mapped to a
point in the plane and each block of either of the two partitions is mapped to
a region that contains exactly those points that belong to the elements in the
block and that is bounded by a simple closed curve. We establish three main
classes of simultaneous embeddability (weak, strong, and full embeddability)
that differ by increasingly strict well-formedness conditions on how different
block regions are allowed to intersect. We show that these simultaneous
embeddability classes are closely related to different planarity concepts of
hypergraphs. For each embeddability class we give a full characterization. We
show that (i) every pair of partitions has a weak simultaneous embedding, (ii)
it is NP-complete to decide the existence of a strong simultaneous embedding,
and (iii) the existence of a full simultaneous embedding can be tested in
linear time.Comment: 17 pages, 7 figures, extended version of a paper to appear at GD 201
- …