A Note on Plus-Contacts, Rectangular Duals, and Box-Orthogonal Drawings

A plus-contact representation of a planar graph $G$ is called $c$-balanced if for every plus shape $+_v$, the number of other plus shapes incident to each arm of $+_v$ is at most $c \Delta +O(1)$, where $\Delta$ is the maximum degree of $G$. Although small values of $c$ have been achieved for a few subclasses of planar graphs (e.g., $2$- and $3$-trees), it is unknown whether $c$-balanced representations with $c<1$ exist for arbitrary planar graphs. In this paper we compute $(1/2)$-balanced plus-contact representations for all planar graphs that admit a rectangular dual. Our result implies that any graph with a rectangular dual has a 1-bend box-orthogonal drawings such that for each vertex $v$, the box representing $v$ is a square of side length $\frac{deg(v)}{2}+ O(1)$.Comment: A poster related to this research appeared at the 25th International Symposium on Graph Drawing & Network Visualization (GD 2017

Generic multiloop methods and application to N=4 super-Yang-Mills

We review some recent additions to the tool-chest of techniques for finding compact integrand representations of multiloop gauge-theory amplitudes - including non-planar contributions - applicable for N=4 super-Yang-Mills in four and higher dimensions, as well as for theories with less supersymmetry. We discuss a general organization of amplitudes in terms of purely cubic graphs, review the method of maximal cuts, as well as some special D-dimensional recursive cuts, and conclude by describing the efficient organization of amplitudes resulting from the conjectured duality between color and kinematic structures on constituent graphs.Comment: 42 pages, 18 figures, invited review for a special issue of Journal of Physics A devoted to "Scattering Amplitudes in Gauge Theories", v2 minor corrections, v3 added reference

Combinatorial and Geometric Properties of Planar Laman Graphs

Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer physics. We introduce three new combinatorial structures for planar Laman graphs: angular structures, angle labelings, and edge labelings. The latter two structures are related to Schnyder realizers for maximally planar graphs. We prove that planar Laman graphs are exactly the class of graphs that have an angular structure that is a tree, called angular tree, and that every angular tree has a corresponding angle labeling and edge labeling. Using a combination of these powerful combinatorial structures, we show that every planar Laman graph has an L-contact representation, that is, planar Laman graphs are contact graphs of axis-aligned L-shapes. Moreover, we show that planar Laman graphs and their subgraphs are the only graphs that can be represented this way. We present efficient algorithms that compute, for every planar Laman graph G, an angular tree, angle labeling, edge labeling, and finally an L-contact representation of G. The overall running time is O(n^2), where n is the number of vertices of G, and the L-contact representation is realized on the n x n grid.Comment: 17 pages, 11 figures, SODA 201

On Semantic Word Cloud Representation

We study the problem of computing semantic-preserving word clouds in which semantically related words are close to each other. While several heuristic approaches have been described in the literature, we formalize the underlying geometric algorithm problem: Word Rectangle Adjacency Contact (WRAC). In this model each word is associated with rectangle with fixed dimensions, and the goal is to represent semantically related words by ensuring that the two corresponding rectangles touch. We design and analyze efficient polynomial-time algorithms for some variants of the WRAC problem, show that several general variants are NP-hard, and describe a number of approximation algorithms. Finally, we experimentally demonstrate that our theoretically-sound algorithms outperform the early heuristics

Recognizing Weighted Disk Contact Graphs

Disk contact representations realize graphs by mapping vertices bijectively to interior-disjoint disks in the plane such that two disks touch each other if and only if the corresponding vertices are adjacent in the graph. Deciding whether a vertex-weighted planar graph can be realized such that the disks' radii coincide with the vertex weights is known to be NP-hard. In this work, we reduce the gap between hardness and tractability by analyzing the problem for special graph classes. We show that it remains NP-hard for outerplanar graphs with unit weights and for stars with arbitrary weights, strengthening the previous hardness results. On the positive side, we present constructive linear-time recognition algorithms for caterpillars with unit weights and for embedded stars with arbitrary weights.Comment: 24 pages, 21 figures, extended version of a paper to appear at the International Symposium on Graph Drawing and Network Visualization (GD) 201

Small deformations of supersymmetric Wilson loops and open spin-chains

We study insertions of composite operators into Wilson loops in N=4 supersymmetric Yang-Mills theory in four dimensions. The loops follow a circular or straight path and the composite insertions transform in the adjoint representation of the gauge group. This provides a gauge invariant way to define the correlator of non-singlet operators. Since the basic loop preserves an SL(2,R) subgroup of the conformal group, we can assign a conformal dimension to those insertions and calculate the corrections to the classical dimension in perturbation theory. The calculation turns out to be very similar to that of single-trace local operators and may also be expressed in terms of a spin-chain. In this case the spin-chain is open and at one-loop order has Neumann boundary conditions on the type of scalar insertions that we consider. This system is integrable and we write the Bethe ansatz describing it. We compare the spectrum in the limit of large angular momentum both in the dilute gas approximation and the thermodynamic limit to the relevant string solution in the BMN limit and in the full AdS_5 x S^5 metric and find agreement.Comment: 40 pages, amstex, 4 figures. V2: Corrected eqn (2.14) and some equations in section 5. Version to appear in JHE

Scattering in Mass-Deformed N>=4 Chern-Simons Models

We investigate the scattering matrix in mass-deformed N>=4 Chern-Simons models including as special cases the BLG and ABJM theories of multiple M2 branes. Curiously the structure of this scattering matrix in three spacetime dimensions is equivalent to (a) the two-dimensional worldsheet matrix found in the context of AdS/CFT integrability and (b) the R-matrix of the one-dimensional Hubbard model. The underlying reason is that all three models are based on an extension of the psu(2|2) superalgebra which constrains the matrix completely. We also compute scattering amplitudes in one-loop field theory and find perfect agreement with scattering unitarity.Comment: 63 pages, v2: minor corrections, v3: minor improvement