On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings

We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting one additional type of edge segments (circular arcs and diagonal segments, respectively). For planar graphs of max-degree 4, we analyze relationships between the graph classes that can be drawn bendless in the two models and we also prove NP-hardness for a restricted version of the bendless drawing problem for both models. For planar graphs of higher degree, we present an algorithm that produces bi-monotone smooth orthogonal drawings with at most two segments per edge, which also guarantees a linear number of edges with exactly one segment.Comment: Appears in the Proceedings of the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017

Combinatorial Properties and Recognition of Unit Square Visibility Graphs

Unit square (grid) visibility graphs (USV and USGV, resp.) are described by axis-parallel visibility between unit squares placed (on integer grid coordinates) in the plane. We investigate combinatorial properties of these graph classes and the hardness of variants of the recognition problem, i.e., the problem of representing USGV with fixed visibilities within small area and, for USV, the general recognition problem

Exact bosonization of the Ising model

We present exact combinatorial versions of bosonization identities, which equate the product of two Ising correlators with a free field (bosonic) correlator. The role of the discrete free field is played by the height function of an associated bipartite dimer model. Some applications to the asymptotic analysis of Ising correlators are discussed.Comment: 35 page

Convexity in partial cubes: the hull number

We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some earlier results in the literature. On the other hand we provide a polynomial-time algorithm to determine the hull number of planar partial cube quadrangulations. Instances of the hull number problem for partial cubes described include poset dimension and hitting sets for interiors of curves in the plane. To obtain the above results, we investigate convexity in partial cubes and characterize these graphs in terms of their lattice of convex subgraphs, improving a theorem of Handa. Furthermore we provide a topological representation theorem for planar partial cubes, generalizing a result of Fukuda and Handa about rank three oriented matroids.Comment: 19 pages, 4 figure

Height representation of XOR-Ising loops via bipartite dimers

The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop configurations of the XOR-Ising model and those of a dimer model living on a decorated, bipartite version of the Ising graph. This result is proved for graphs embedded in compact surfaces of genus g. Using this fact, we then prove that XOR-Ising loops have the same law as level lines of the height function of this bipartite dimer model. At criticality, the height function is known to converge weakly in distribution to a Gaussian free field. As a consequence, results of this paper shed a light on the occurrence of the Gaussian free field in the XOR-Ising model. In particular, they prove a discrete analogue of Wilson's conjecture, stating that the scaling limit of XOR-Ising loops are "contour lines" of the Gaussian free field.Comment: 41 pages, 10 figure