相关论文: Remarks on d-Dimensional TSP Optimal Tour Length B…
It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…
We resolve a conjecture of De Palma and Trevisan by proving the triangle inequality for a quantum 2-Wasserstein distance. The proof relies on complex analysis methods to establish a new integral representation of the cost in the optimal…
In this work, we mainly study the one-loop effective action for real scalar theories in non-homogeneous backgrounds in odd dimensions. It is shown that through the method studied in Ref. [1], it is possible to obtain a unified result for…
Motivated by the construction of confidence intervals in statistics, we study optimal configurations of $2^d-1$ lines in real projective space $RP^{d-1}$. For small $d$, we determine line sets that numerically minimize a wide variety of…
Let $P$ be a collection of $n$ points in the plane, each moving along some straight line at unit speed. We obtain an almost tight upper bound of $O(n^{2+\epsilon})$, for any $\epsilon>0$, on the maximum number of discrete changes that the…
Given a set of $n$ points in the Euclidean plane, such that just $k$ points are strictly inside the convex hull of the whole set, we want to find the shortest tour visiting every point. The fastest known algorithm for the version when $k$…
As an extension of Polya's classical result on random walks on the square grids ($\Z^d$), we consider a random walk where the steps, while still have unit length, point to different directions. We show that in dimensions at least 4, the…
Finding the exact integrality gap $\alpha$ for the LP relaxation of the metric Travelling Salesman Problem (TSP) has been an open problem for over thirty years, with little progress made. It is known that $4/3 \leq \alpha \leq 3/2$, and a…
The traveling salesman problem (TSP) famously asks for a shortest tour that a salesperson can take to visit a given set of cities in any order. In this paper, we ask how much faster $k \ge 2$ salespeople can visit the cities if they divide…
Transport equations can be derived from quantum field theory assuming a loss of information about the details of the initial state and a gradient expansion. While the latter can be systematically improved, the assumption about a memory loss…
We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of $n$ disks in the plane, a TSP tour whose length is at most $O(1)$ times the…
We study the lift-and-project procedures of Lov{\'a}sz-Schrijver and Sherali-Adams applied to the standard linear programming relaxation of the traveling salesperson problem with triangle inequality. For the asymmetric TSP tour problem,…
After a sequence of improvements Boyd, Sitters, van der Ster, and Stougie proved that any 2-connected graph whose n vertices have degree 3, i.e., a cubic 2-connected graph, has a Hamiltonian tour of length at most (4/3)n, establishing in…
Pach showed that every $d+1$ sets of points $Q_1,\dotsc,Q_{d+1} \subset \mathbb{R}^d$ contain linearly-sized subsets $P_i\subset Q_i$ such that all the transversal simplices that they span intersect. We show, by means of an example, that a…
We study the constraints of crossing symmetry and unitarity in general 3D Conformal Field Theories. In doing so we derive new results for conformal blocks appearing in four-point functions of scalars and present an efficient method for…
How efficiently can a closed curve of unit length in $\mathbb{R}^d$ be covered by $k$ closed curves so as to minimize the maximum length of the $k$ curves? We show that the maximum length is at most $2k^{-1} - \frac{1}{4} k^{-4}$ for all…
The Traveling Tournament Problem (TTP) is a hard but interesting sports scheduling problem inspired by Major League Baseball, which is to design a double round-robin schedule such that each pair of teams plays one game in each other's home…
We prove an inequality of Hardy type for functions in Triebel-Lizorkin spaces. The distance involved is being measured to a given Ahlfors d-regular set in R^n, with n-1<d<n. As an application of the Hardy inequality, we consider boundedness…
Triadic percolation turns bond percolation into a dynamical problem governed by an effective one-dimensional unimodal map. We show that the geometry of superstable cycles provides a direct, map-agnostic probe of local nonlinearity:…
In the Tricolored Euclidean Traveling Salesperson problem, we are given~$k=3$ sets of points in the plane and are looking for disjoint tours, each covering one of the sets. Arora (1998) famously gave a PTAS based on ``patching'' for the…