English
Related papers

Related papers: Pi/2-Angle Yao Graphs are Spanners

200 papers

We compute the index of BPS states for two stacks of D4-branes wrapped on ample divisors and overlapping over a compact Riemann surface inside non-compact Calabi-Yau 3-fold. This index is given in terms of U(N) x U(M) q-deformed Yang Mills…

High Energy Physics - Theory · Physics 2007-10-04 Daniel L. Jafferis , Natalia Saulina

We determine the partition dimension of the incidence graph $G(\Pi_q)$ of the projective plane $\Pi_q$ up to a constant factor $2$ as $(2+o(1))\log_2{q}\leq \mathrm{pd}(G(\Pi_q))\leq (4+o(1))\log_2{q}.$

Combinatorics · Mathematics 2016-11-30 Zoltán Blázsik , Zoltán Lóránt Nagy

A \emph{spanner} of a graph $G$ is a subgraph $H$ that approximately preserves shortest path distances in $G$. Spanners are commonly applied to compress computation on metric spaces corresponding to weighted input graphs. Classic spanner…

Discrete Mathematics · Computer Science 2021-06-30 Reyan Ahmed , Greg Bodwin , Faryad Darabi Sahneh , Stephen Kobourov , Richard Spence

We show that every planar, 4-connected, K2;5-minor- free graph is the square of a cycle of even length at least six.

Combinatorics · Mathematics 2015-08-24 Emily Abernethy Marshall , Liana Yepremyan , Zach Gaslowitz

An emanation graph of grade $k$ on a set of points is a plane spanner made by shooting $2^{k+1}$ equally spaced rays from each point, where the shorter rays stop the longer ones upon collision. The collision points are the Steiner points of…

Computational Geometry · Computer Science 2022-11-16 Bardia Hamedmohseni , Zahed Rahmati , Debajyoti Mondal

A spanner is a sparse subgraph that approximately preserves the pairwise distances of the original graph. It is well known that there is a smooth tradeoff between the sparsity of a spanner and the quality of its approximation, so long as…

Data Structures and Algorithms · Computer Science 2020-05-12 Amir Abboud , Greg Bodwin

We study structure constants of gauge invariant operators in planar N=4 Yang-Mills at one loop with the motivation of determining features of the string dual of weak coupling Yang-Mills. We derive a simple renormalization group invariant…

High Energy Physics - Theory · Physics 2010-02-03 Luis F. Alday , Justin R. David , Edi Gava , K. S. Narain

We study the problem of embedding graphs in the plane as good geometric spanners. That is, for a graph $G$, the goal is to construct a straight-line drawing $\Gamma$ of $G$ in the plane such that, for any two vertices $u$ and $v$ of $G$,…

Data Structures and Algorithms · Computer Science 2020-02-14 Oswin Aichholzer , Manuel Borrazzo , Prosenjit Bose , Jean Cardinal , Fabrizio Frati , Pat Morin , Birgit Vogtenhuber

We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.

Group Theory · Mathematics 2015-03-18 Agelos Georgakopoulos

We present sweeping line graphs, a generalization of $\Theta$-graphs. We show that these graphs are spanners of the complete graph, as well as of the visibility graph when line segment constraints or polygonal obstacles are considered. Our…

Computational Geometry · Computer Science 2024-01-09 Keenan Lee , André van Renssen

We consider the Peano curve separating a spanning tree from its dual spanning tree on an embedded planar graph, where the tree and dual tree are weighted by $y$ to the number of active edges, and "active" is in the sense of the Tutte…

Statistical Mechanics · Physics 2019-03-15 Adrien Kassel , David B. Wilson

We use microprobe Angle-Resolved Photoemission Spectroscopy (muARPES) to separately investigate the electronic properties of CuO2 planes and CuO chains in the high temperature superconductor, YBa2Cu4O8. In the CuO2 planes, a two dimensional…

We explicitly construct pseudo-Anosov maps on the closed surface of genus $g$ with orientable foliations whose stretch factor $\lambda$ is a Salem number with algebraic degree $2g$. Using this result, we show that there is a pseudo-Anosov…

Geometric Topology · Mathematics 2016-07-20 Hyunshik Shin

In this paper we determine the stretch factor of the $L_1$-Delaunay and $L_\infty$-Delaunay triangulations, and we show that this stretch is $\sqrt{4+2\sqrt{2}} \approx 2.61$. Between any two points $x,y$ of such triangulations, we…

Computational Geometry · Computer Science 2012-02-28 Nicolas Bonichon , Cyril Gavoille , Nicolas Hanusse , Ljubomir Perkovic

The unit disk graph (UDG) is a widely employed model for the study of wireless networks. In this model, wireless nodes are represented by points in the plane and there is an edge between two points if and only if their Euclidean distance is…

Computational Geometry · Computer Science 2019-02-27 Ahmad Biniaz

A proof that every outerplanar graph is \Delta+2 colorable. This is slightly stronger then an unpublished result of Wang Shudong, Ma Fangfang, Xu Jin, and Yan Lijun proving the same for 2-connected outerplanar graphs.

Combinatorics · Mathematics 2008-06-19 Maksim Maydanskiy

We show that every planar graph $G$ has a 2-fold 9-coloring. In particular, this implies that $G$ has fractional chromatic number at most $\frac92$. This is the first proof (independent of the 4 Color Theorem) that there exists a constant…

Combinatorics · Mathematics 2019-11-18 Daniel W. Cranston , Landon Rabern

For every infinite sequence of simple groups of Lie type of growing rank we exhibit connected Cayley graphs of degree at most 10 such that the isoperimetric number of these graphs converges to 0. This proves that these graphs do not form a…

Combinatorics · Mathematics 2013-02-12 Gabor Somlai

We show that there is an infinite set of primes $\mathcal{P}$ of density one, such that the family of \textit{all} Cayley graphs of $\mathrm{SL}(2,p)$%, $p\in \mathcal{P}$, is a family of expanders.

Group Theory · Mathematics 2009-11-17 Emmanuel Breuillard , Alex Gamburd

Let $P$ be a finite set of points in the plane and $S$ a set of non-crossing line segments with endpoints in $P$. The visibility graph of $P$ with respect to $S$, denoted $Vis(P,S)$, has vertex set $P$ and an edge for each pair of vertices…

Computational Geometry · Computer Science 2018-06-25 Prosenjit Bose , Rolf Fagerberg , André van Renssen , Sander Verdonschot