English
Related papers

Related papers: Bowties and Hourglasses: Intersections of Double-W…

200 papers

Given a set $S$ of $n$ line segments in the plane, we say that a region $\mathcal{R}\subseteq \mathbb{R}^2$ is a {\em stabber} for $S$ if $\mathcal{R}$ contains exactly one endpoint of each segment of $S$. In this paper we provide optimal…

Computational Geometry · Computer Science 2017-03-14 Mercè Claverol , Delia Garijo , Matias Korman , Carlos Seara , Rodrigo I. Silveira

We consider 5d supersymmetric gauge theories with unitary groups in the $\Omega$-background and study codim-2/4 BPS defects supported on orthogonal planes intersecting at the origin along a circle. The intersecting defects arise upon…

High Energy Physics - Theory · Physics 2021-09-22 Taro Kimura , Fabrizio Nieri

We study a system of intersecting NS and D-branes in type IIA string theory in R^{9,1}. We show that the 3+1 dimensional non-supersymmetric theory at the intersection has unstable vacua which are long-lived in some regions of the parameter…

High Energy Physics - Theory · Physics 2008-11-26 Amit Giveon , David Kutasov

We present a near-linear-time algorithm that, given a bridgeless cubic graph, finds a perfect matching intersecting every 3-edge-cut in exactly one edge. This improves over a cubic algorithm of Boyd et al. for the same problem, and over our…

Data Structures and Algorithms · Computer Science 2026-05-04 Babak Ghanbari , Robert Šámal

We propose a method for constructing pairs of nonsupersymmetric gauge theories related by S-duality. Starting from a known S-duality of supersymmetric theories realized on the worldvolume of D3 branes in type IIB string theory, a new…

High Energy Physics - Theory · Physics 2014-01-22 Anson Hook , Gonzalo Torroba

An algorithm is demonstrated that finds an ordinary intersection in an arrangement of $n$ lines in $\mathbb{R}^2$, not all parallel and not all passing through a common point, in time $O(n \log{n})$. The algorithm is then extended to find…

Computational Geometry · Computer Science 2009-10-05 George B. Purdy , Justin W. Smith

We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…

Data Structures and Algorithms · Computer Science 2021-01-01 Katarzyna Paluch , Mateusz Wasylkiewicz

We discuss the worldvolume description of intersecting D-branes, including the metric on the moduli space of deformations. We impose a choice of static gauge that treats all the branes on an equal footing and describes the intersection of…

High Energy Physics - Theory · Physics 2010-12-03 N. D. Lambert

Let $S$ and $D$ each be a set of orthogonal line segments in the plane. A line segment $s\in S$ \emph{stabs} a line segment $s'\in D$ if $s\cap s'\neq\emptyset$. It is known that the problem of stabbing the line segments in $D$ with the…

Computational Geometry · Computer Science 2019-06-25 Sayan Bandyapadhyay , Saeed Mehrabi

In the paper "Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares", TCS Volume 769 (2019), pages 63--74, the LHIT problem is proposed as follows: For a given set of non-intersecting line…

Computational Geometry · Computer Science 2019-09-25 Sanjib Sadhu , Xiaozhou He , Sasanka Roy , Subhas C. Nandy , Suchismita Roy

In this paper we analyze various half-BPS defects in a general three dimensional N=2 supersymmetric gauge theory T. They correspond to closed paths in SUSY parameter space and their tension is computed by evaluating period integrals along…

High Energy Physics - Theory · Physics 2015-06-12 Abhijit Gadde , Sergei Gukov , Pavel Putrov

Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For…

Computational Geometry · Computer Science 2016-02-17 Marko Savić , Miloš Stojaković

We initiate the study of diameter computation in geometric intersection graphs from the fine-grained complexity perspective. A geometric intersection graph is a graph whose vertices correspond to some shapes in $d$-dimensional Euclidean…

Computational Geometry · Computer Science 2022-03-11 Karl Bringmann , Sándor Kisfaludi-Bak , Marvin Künnemann , André Nusser , Zahra Parsaeian

The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a variant that is motivated by an application to genomics, where…

Data Structures and Algorithms · Computer Science 2013-07-23 Ross M. McConnell , Yahav Nussbaum

We study graphs that are formed by independently-positioned needles (i.e., line segments) in the unit square. To mathematically characterize the graph structure, we derive the probability that two line segments intersect and determine…

Soft Condensed Matter · Physics 2020-10-29 Lucas Böttcher

In this note we extend our work in a previous paper hep-th/9801038. We show here that various intersecting brane-like configurations can be found in the vacuum of $D=4, N=4$ supergravity with gauged R-symmetry group $SU(2)\times SU(2)$.…

High Energy Physics - Theory · Physics 2009-10-31 Harvendra Singh

We construct intersecting D-brane configurations that encode the gauge groups and field content of dual N=4 supersymmetric gauge theories in three dimensions. The duality which exchanges the Coulomb and Higgs branches and the…

High Energy Physics - Theory · Physics 2009-09-17 Jan de Boer , Kentaro Hori , Hirosi Ooguri , Yaron Oz , Zheng Yin

We consider the following geometric optimization problem: Given $ n $ axis-aligned rectangles in the plane, the goal is to find a set of horizontal segments of minimum total length such that each rectangle is stabbed. A segment stabs a…

Computational Geometry · Computer Science 2021-07-15 Friedrich Eisenbrand , Martina Gallato , Ola Svensson , Moritz Venzin

Bow-tie or hourglass structure is a common architectural feature found in biological and technological networks. A bow-tie in a multi-layered structure occurs when intermediate layers have much fewer components than the input and output…

Molecular Networks · Quantitative Biology 2015-03-26 Tamar Friedlander , Avraham E. Mayo , Tsvi Tlusty , Uri Alon

We discuss dual formulations of D-brane intersections. The duality is between world volume field theories of different dimensionalities which both describe the same D-brane configuration but are valid in complementary regions of parameter…

High Energy Physics - Theory · Physics 2016-09-06 Neil R. Constable , Robert C. Myers , Oyvind Tafjord
‹ Prev 1 2 3 10 Next ›