English
Related papers

Related papers: The Analyst's traveling salesman theorem in graph …

200 papers

A systematic geometric theory for the ultradifferentiable (non-quasianalytic and quasianalytic) wavefront set similar to the well-known theory in the classic smooth and analytic setting is developed. In particular an analogue of Bony's…

Analysis of PDEs · Mathematics 2020-09-09 Stefan Fürdös

Starting with M(a), an n X n asymmetric cost matrix, Jonker and Volgenannt transformed it into a 2n X 2n symmetric cost matrix, M(s)where M(s) has unusual properties. One such property is that an optimal tour in M(s) yields an optimal tour…

General Mathematics · Mathematics 2007-05-23 Howard Kleiman

In this paper, we establish a quenched invariance principle for the random walk on a certain class of infinite, aperiodic, oriented random planar graphs called "T-graphs" [Kenyon-Sheffield04]. These graphs appear, together with the…

Probability · Mathematics 2014-01-15 Benoit Laslier

The theory of monotone operators plays a major role in modern optimization and many areas of nonlinera analysis. The central classes of monotone operators are matrices with a positive semidefinite symmetric part and subsifferential…

Functional Analysis · Mathematics 2024-05-24 Salihah Thabet Alwadani

We construct counterexamples to classical calculus facts such as the Inverse and Implicit Function Theorems in Scale Calculus -- a generalization of Multivariable Calculus to infinite dimensional vector spaces in which the…

Symplectic Geometry · Mathematics 2022-07-06 Benjamin Filippenko , Zhengyi Zhou , Katrin Wehrheim

Erd\H{o}s introduced the noncommuting graph, in order to study the number of commuting elements in a finite group. Despite the use of combinatorial ideas, his methods involved several techniques of classical analysis. The interest for this…

Combinatorics · Mathematics 2018-12-14 Stefano Nardulli , Francesco G. Russo

Let $P$ be a set of points in $\mathbb{R}^d$, and let $\alpha \ge 1$ be a real number. We define the distance between two points $p,q\in P$ as $|pq|^{\alpha}$, where $|pq|$ denotes the standard Euclidean distance between $p$ and $q$. We…

Computational Geometry · Computer Science 2010-02-03 Mark de Berg , Fred van Nijnatten , René Sitters , Gerhard J. Woeginger , Alexander Wolff

A notion of Paley-Wiener spaces is introduced on combinatorial graphs. It is shown that functions from some of these spaces are uniquely determined by their values on some sets of vertices which are called the uniqueness sets. Such…

Spectral Theory · Mathematics 2011-11-28 Isaac Pesenson

The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…

Operator Algebras · Mathematics 2007-05-23 Alan L. T. Paterson , Amy E. Welch

We present a very simple family of traveling salesman instances with $n$ cities where the nearest neighbor rule may produce a tour that is $\Theta(\log n)$ times longer than an optimum solution. Our family works for the graphic, the…

Data Structures and Algorithms · Computer Science 2014-01-10 Stefan Hougardy , Mirko Wilde

Royden proved that any isometry of Teichmuller space in the Teichmuller metric must be an element of the extended mapping class group M(S). He also proved that the Teichmuller metric is not symmetric at any point. In this paper we give…

Geometric Topology · Mathematics 2019-12-19 Benson Farb , Shmuel Weinberger

For a convex body B in a vector space V, we construct its approximation P_k, k=1, 2, . . . using an intersection of a cone of positive semidefinite quadratic forms with an affine subspace. We show that P_k is contained in B for each k. When…

Combinatorics · Mathematics 2007-05-23 Ellen Veomett

A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. Based on this new characterization, a new exact polynomial time algorithm for the traveling salesman problem (TSP) is developed. We then define the so-called…

General Mathematics · Mathematics 2025-02-26 Dhananjay P. Mehendale

We introduce a set of multi-way dual Cheeger constants and prove universal higher-order dual Cheeger inequalities for eigenvalues of normalized Laplace operators on weighted finite graphs. Our proof proposes a new spectral clustering…

Spectral Theory · Mathematics 2014-10-14 Shiping Liu

In this paper, we consider differential approximability of the traveling salesman problem (TSP). We show that TSP is $3/4$-differential approximable, which improves the currently best known bound $3/4 -O(1/n)$ due to Escoffier and Monnot in…

Data Structures and Algorithms · Computer Science 2020-12-29 Yuki Amano , Kazuhisa Makino

Invariant curves are generally closed curves in the Poincare's surface of section. Here we study an interesting dynamical phenomenon, first discovered by Binney et al. (1985) in a rotating Kepler potential, where an invariant curve of the…

Chaotic Dynamics · Physics 2021-11-17 Tian-Ye Xia , Juntai Shen

We prove a global uniqueness result for the Calder\'{o}n inverse problem for a general quasilinear isotropic conductivity equation on a bounded open set with smooth boundary in dimension $n\ge 3$. Performing higher order linearizations of…

Analysis of PDEs · Mathematics 2023-05-10 Cătălin I. Cârstea , Ali Feizmohammadi , Yavar Kian , Katya Krupchyk , Gunther Uhlmann

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

Dynamical Systems · Mathematics 2012-02-23 Nikos Frantzikinakis

In this short communication, we observe that the Graphical Traveling Salesman Polyhedron is the intersection of the positive orthant with the Minkowski sum of the Symmetric Traveling Salesman Polytope and the polar of the metric cone. This…

Combinatorics · Mathematics 2011-08-02 Dirk Oliver Theis

We find a necessary and sufficient condition for a doubling metric space to carry a (1,p)-Poincare inequality. The condition involves discretizations of the metric space and Poincare inequalities on graphs.

Metric Geometry · Mathematics 2015-05-12 James T. Gill , Marcos Lopez
‹ Prev 1 3 4 5 6 7 10 Next ›