中文
相关论文

相关论文: Pi/2-Angle Yao Graphs are Spanners

200 篇论文

Let $K_4$ be the complete graph on four vertices. Let $f$ be a continuous map of $K_4$ to the plane such that $f$-images of non-adjacent edges are disjoint. For any vertex $v \in K_4$ take the winding number of the $f$-image of the cycle…

几何拓扑 · 数学 2025-05-07 Emil Alkin , Alexander Miroshnikov

Yang-Baxter (YB) map systems (or set-theoretic analoga of entwining YB structures) are presented. They admit zero curvature representations with spectral parameter depended Lax triples L1, L2, L3 derived from symplectic leaves of 2 x 2…

数学物理 · 物理学 2010-06-14 Theodoros E. Kouloukas , Vassilios G. Papageorgiou

Generalizing our recent joint paper with Vasily Pestun (arXiv:2001.04929), we construct a family of $SO(2r),Sp(2r),SO(2r+1)$ rational Lax matrices, polynomial in the spectral parameter, parametrized by the divisors on the projective line…

表示论 · 数学 2022-04-25 Rouven Frassek , Alexander Tsymbaliuk

We prove that the two-colouring number of any planar graph is at most 8. This resolves a question of Kierstead et al. [SIAM J. Discrete Math.~23 (2009), 1548--1560]. The result is optimal.

组合数学 · 数学 2019-10-18 Zdeněk Dvořák , Adam Kabela , Tomáš Kaiser

Planar N=4 Super Yang-Mills theory appears to be a quantum integrable four-dimensional conformal theory. This has been used to find equations believed to describe its exact spectrum of anomalous dimensions. Integrability seemingly also…

高能物理 - 理论 · 物理学 2015-06-16 Livia Ferro , Tomasz Lukowski , Carlo Meneghelli , Jan Plefka , Matthias Staudacher

A graph is $1$-$planar$ if it can be drawn in the plane so that each edge is crossed by at most one other edge. Moreover, a 1-planar graph $G$ is $optimal$ if it satisfies $|E(G)|=4|V(G)|-8$. J. Fujisawa et al. [16] first considered…

组合数学 · 数学 2022-05-25 Jiangyue Zhang , Yan Wu , Heping Zhang

The octagon function is the fundamental building block yielding correlation functions of four large BPS operators in N=4 super Yang-Mills theory at any value of the 't Hooft coupling and at any genus order. Here we compute the octagon at…

高能物理 - 理论 · 物理学 2019-09-11 Till Bargheer , Frank Coronado , Pedro Vieira

A 2-tree is a graph that can be formed by starting with a triangle and iterating the operation of making a new vertex adjacent to two adjacent vertices of the existing graph. Leizhen Cai asked in 1995 whether every maximal planar graph…

组合数学 · 数学 2022-03-22 Allan Bickle

A $t$-spanner of an undirected $n$-vertex graph $G$ is a sparse subgraph $H$ of $G$ that preserves all pairwise distances between its vertices to within multiplicative factor $t$, also called the \emph{stretch}. We investigate the problem…

数据结构与算法 · 计算机科学 2026-01-29 Julia Chuzhoy , Merav Parter

In this paper, we present a canonical quantization of Lie bialgebra structures on the formal power series $\mathfrak{d}[\![t]\!]$ with coefficients in the cotangent Lie algebra $\mathfrak{d} = T^*\mathfrak{g} = \mathfrak{g} \ltimes…

量子代数 · 数学 2024-10-21 Raschid Abedin , Wenjun Niu

We calculate the fourth-order cumulant ratio (proposed by Binder) for the two-dimensional Ising model in a strip geometry L x oo. The Density Matrix Renormalization Group method enables us to consider typical open boundary conditions up to…

凝聚态物理 · 物理学 2009-10-31 Andrzej Drzewinski , Jacek Wojtkiewicz

We study short operators in planar $\mathcal{N}=4$ SYM at strong coupling, for general spin and $SO(6)$ symmetric traceless representations. At strong coupling their dimension grows like $\Delta \sim 2\sqrt{\delta} \lambda^{1/4}$ and their…

高能物理 - 理论 · 物理学 2023-09-01 Luis F. Alday , Tobias Hansen , Joao A. Silva

Wang and Lih in 2002 conjectured that every planar graph without adjacent triangles is 4-choosable. In this paper, we prove that every planar graph without any 4-cycle adjacent to two triangles is DP-4-colorable, which improves the results…

组合数学 · 数学 2018-04-25 Runrun Liu , Xiangwen Li

Highly connected and yet sparse graphs (such as expanders or graphs of high treewidth) are fundamental, widely applicable and extensively studied combinatorial objects. We initiate the study of such highly connected graphs that are, in…

计算几何 · 计算机科学 2013-06-17 Prosenjit Bose , Vida Dujmovic , Pat Morin , Michiel Smid

In this paper we study smooth, complex Fano 4-folds X with large Picard number rho(X), with techniques from birational geometry. Our main result is that if X is isomorphic in codimension one to the blow-up of a smooth projective 4-fold Y at…

代数几何 · 数学 2017-04-06 Cinzia Casagrande

Recently, the maximally-helicity-violating four-point form factor for the chiral stress-energy tensor in planar $\mathcal{N}=4$ super Yang-Mills was computed to three loops at the level of the symbol associated with multiple polylogarithms.…

高能物理 - 理论 · 物理学 2026-01-23 Lance J. Dixon , Shuo Xin

A graph $X$ is 2-spanning cyclable if for any pair of distinct vertices $u$ and $v$ there is a 2-factor of $X$ consisting of two cycles such that $u$ and $v$ belong to distinct cycles. In this paper we examine the 2-spanning cyclability of…

组合数学 · 数学 2023-09-12 Brian Alspach , Aditya Joshi

We compute the non-planar contribution to the anomalous dimension of the eight moment of the twist-2 operators in N=4 supersymmetric Yang-Mills theory at four loops. This result was obtained from the calculations of some elements of the…

高能物理 - 理论 · 物理学 2015-06-19 V. N. Velizhanin

We obtain a determinant expression for the tree-level structure constant of three non-extremal single-trace operators in the SU(2) sector of planar N=4 supersymmetric Yang-Mills theory.

数学物理 · 物理学 2015-10-21 Omar Foda

A graph is 1-planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1-planar drawing is called 1-plane. Brandenburg et al. showed that there are maximal 1-planar graphs with only…

组合数学 · 数学 2015-09-21 János Barát , Géza Tóth