On the Hadwiger numbers of starlike disks

The Hadwiger number $H(J)$ of a topological disk $J$ in $\Re^2$ is the maximal number of pairwise nonoverlapping translates of $J$ that touch $J$. It is well known that for a convex disk, this number is six or eight. A conjecture of A. Bezdek., K. and W. Kuperberg says that the Hadwiger number of a starlike disk is at most eight. A. Bezdek proved that this number is at most seventy five for any starlike disk. In this note, we prove that the Hadwiger number of a starlike disk is at most thirty five. Furthermore, we show that the Hadwiger number of a topological disk $J$ such that (\conv J) \setminus J is connected, is six or eight.Comment: 13 pages, 8 figure

Stick index of knots and links in the cubic lattice

The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p,p+1)-torus knots, and show how composing and taking satellites can be used to obtain the cubic lattice stick index for a relatively large infinite class of knots. Additionally, we present several bounds relating cubic lattice stick index to other known invariants.Comment: 16 pages, 12 figure

Untangling polygons and graphs

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at least \Omega(n^{2/3}) vertices fixed. For any graph G, we also present an upper bound on the number of fixed vertices in the worst case. The bound is a function of the number of vertices, maximum degree and diameter of G. One of its consequences is the upper bound O((n log n)^{2/3}) for all 3-vertex-connected planar graphs.Comment: 11 pages, 3 figure

Outerplanar graph drawings with few slopes

We consider straight-line outerplanar drawings of outerplanar graphs in which a small number of distinct edge slopes are used, that is, the segments representing edges are parallel to a small number of directions. We prove that $\Delta-1$ edge slopes suffice for every outerplanar graph with maximum degree $\Delta\ge 4$. This improves on the previous bound of $O(\Delta^5)$, which was shown for planar partial 3-trees, a superclass of outerplanar graphs. The bound is tight: for every $\Delta\ge 4$ there is an outerplanar graph with maximum degree $\Delta$ that requires at least $\Delta-1$ distinct edge slopes in an outerplanar straight-line drawing.Comment: Major revision of the whole pape

Obstacle Numbers of Planar Graphs

Given finitely many connected polygonal obstacles $O_1,\dots,O_k$ in the plane and a set $P$ of points in general position and not in any obstacle, the {\em visibility graph} of $P$ with obstacles $O_1,\dots,O_k$ is the (geometric) graph with vertex set $P$, where two vertices are adjacent if the straight line segment joining them intersects no obstacle. The obstacle number of a graph $G$ is the smallest integer $k$ such that $G$ is the visibility graph of a set of points with $k$ obstacles. If $G$ is planar, we define the planar obstacle number of $G$ by further requiring that the visibility graph has no crossing edges (hence that it is a planar geometric drawing of $G$). In this paper, we prove that the maximum planar obstacle number of a planar graph of order $n$ is $n-3$, the maximum being attained (in particular) by maximal bipartite planar graphs. This displays a significant difference with the standard obstacle number, as we prove that the obstacle number of every bipartite planar graph (and more generally in the class PURE-2-DIR of intersection graphs of straight line segments in two directions) of order at least $3$ is $1$.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Quantum entanglement between a nonlinear nanomechanical resonator and a microwave field

We consider a theoretical model for a nonlinear nanomechanical resonator coupled to a superconducting microwave resonator. The nanomechanical resonator is driven parametrically at twice its resonance frequency, while the superconducting microwave resonator is driven with two tones that differ in frequency by an amount equal to the parametric driving frequency. We show that the semi-classical approximation of this system has an interesting fixed point bifurcation structure. In the semi-classical dynamics a transition from stable fixed points to limit cycles is observed as one moves from positive to negative detuning. We show that signatures of this bifurcation structure are also present in the full dissipative quantum system and further show that it leads to mixed state entanglement between the nanomechanical resonator and the microwave cavity in the dissipative quantum system that is a maximum close to the semi-classical bifurcation. Quantum signatures of the semi-classical limit-cycles are presented.Comment: 36 pages, 18 figure

Convex drawings of graphs with non-convex boundary

Abstract. In this paper, we study a new problem of finding a convex drawing of graphs with a non-convex boundary. It is proved that every triconnected plane graph whose boundary is fixed with a star-shaped polygon admits a drawing in which every inner facial cycle is drawn as a convex polygon. Such a drawing, called an inner-convex drawing, can be obtained in linear time.

Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time

Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs, J. Graph Theory, 10(3), 335-341, 1988]. In this paper, we characterize some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph can be re-embedded into a straight-line drawable 1-plane embedding of the same graph if and only if it does not contain the configuration. Re-embedding of a 1-plane embedding preserves the same set of pairs of crossing edges. We give a linear-time algorithm for finding a straight-line drawable 1-plane re-embedding or the forbidden configuration.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016). This is an extended abstract. For a full version of this paper, see Hong S-H, Nagamochi H.: Re-embedding a 1-Plane Graph into a Straight-line Drawing in Linear Time, Technical Report TR 2016-002, Department of Applied Mathematics and Physics, Kyoto University (2016