Common transversals and tangents to two lines and two quadrics in P^3

We solve the following geometric problem, which arises in several three-dimensional applications in computational geometry: For which arrangements of two lines and two spheres in R^3 are there infinitely many lines simultaneously transversal to the two lines and tangent to the two spheres? We also treat a generalization of this problem to projective quadrics: Replacing the spheres in R^3 by quadrics in projective space P^3, and fixing the lines and one general quadric, we give the following complete geometric description of the set of (second) quadrics for which the 2 lines and 2 quadrics have infinitely many transversals and tangents: In the nine-dimensional projective space P^9 of quadrics, this is a curve of degree 24 consisting of 12 plane conics, a remarkably reducible variety.Comment: 26 pages, 9 .eps figures, web page with more pictures and and archive of computations: http://www.math.umass.edu/~sottile/pages/2l2s

A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing

Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line sets, for both halfplanes delimited by l, there are n^{1/2} lines which pairwise intersect in that halfplane, and this bound is tight; a centerpoint theorem: for any set of n lines there is a point such that for any halfplane containing that point there are (n/3)^{1/2} of the lines which pairwise intersect in that halfplane. We generalize those results in higher dimension and obtain a center transversal theorem, a same-type lemma, and a positive portion Erdos-Szekeres theorem for hyperplane arrangements. This is done by formulating a generalization of the center transversal theorem which applies to set functions that are much more general than measures. Back to Graph Drawing (and in the plane), we completely solve the open problem that motivated our search: there is no set of n labelled lines that are universal for all n-vertex labelled planar graphs. As a side note, we prove that every set of n (unlabelled) lines is universal for all n-vertex (unlabelled) planar graphs

Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks

We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes for error correction. Color codes have a set of transversal gates which coincides with the set of topologically protected gates in Majorana-based systems, namely the Clifford gates. In this way, we establish color codes as providing a natural setting in which advantages offered by topological hardware can be combined with those arising from topological error-correcting software for full-fledged fault-tolerant quantum computing. We provide a complete description of our architecture including the underlying physical ingredients. We start by showing that in topological superconductor networks, hexagonal cells can be employed to serve as physical qubits for universal quantum computation, and present protocols for realizing topologically protected Clifford gates. These hexagonal cell qubits allow for a direct implementation of open-boundary color codes with ancilla-free syndrome readout and logical $T$-gates via magic state distillation. For concreteness, we describe how the necessary operations can be implemented using networks of Majorana Cooper pair boxes, and give a feasibility estimate for error correction in this architecture. Our approach is motivated by nanowire-based networks of topological superconductors, but could also be realized in alternative settings such as quantum Hall-superconductor hybrids.Comment: 24 pages, 24 figure

New Invariants for surfaces

We take the fundamental group of the complement of the branch curve of a generic projection induced from canonical embedding of a surface. This group is stable on connected components of moduli spaces of surfaces. Since for many classes of surfaces it is expected that the fundamental group has a polycyclic structure, we define a new invariant that comes from this structure. We compute this invariant for a few examples. Braid monodromy factorizations related to curves is a first step in computing the fundamental group of the complement of the curve, and thus we also indicate the possibility of using braid monodromy factorizations of branch curves as an invariant of a surface.Comment: 15 pages. To appear in Con. Math, AMS-TE

Line transversals to disjoint balls

We prove that the set of directions of lines intersecting three disjoint balls in $R^3$ in a given order is a strictly convex subset of $S^2$. We then generalize this result to $n$ disjoint balls in $R^d$. As a consequence, we can improve upon several old and new results on line transversals to disjoint balls in arbitrary dimension, such as bounds on the number of connected components and Helly-type theorems.Comment: 21 pages, includes figure

New results on stabbing segments with a polygon

We consider a natural variation of the concept of stabbing a set of segments with a simple polygon: a segment s is stabbed by a simple polygon P if at least one endpoint of s is contained in P, and a segment set S is stabbed by P if P stabs every element of S. Given a segment set S, we study the problem of finding a simple polygon P stabbing S in a way that some measure of P (such as area or perimeter) is optimized. We show that if the elements of S are pairwise disjoint, the problem can be solved in polynomial time. In particular, this solves an open problem posed by Loftier and van Kreveld [Algorithmica 56(2), 236-269 (2010)] [16] about finding a maximum perimeter convex hull for a set of imprecise points modeled as line segments. Our algorithm can also be extended to work for a more general problem, in which instead of segments, the set S consists of a collection of point sets with pairwise disjoint convex hulls. We also prove that for general segments our stabbing problem is NP-hard. (C) 2014 Elsevier B.V. All rights reserved.Peer ReviewedPostprint (author's final draft