Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0704.3672

Hamiltonian Graphs and the Traveling Salesman Problem

Dhananjay P. Mehendale
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 ordered weighted adjacency list for given weighted complete graph and proceed to the paper's main result, namely, the exact algorithm based on the utilization of the ordered weighted adjacency list and the simple properties that any path or circuit must satisfy. This algorithm performs checking of sub-lists, containing (p-1) entries (edge pairs) for paths and p entries (edge pairs) for circuits, chosen from ordered adjacency list in a well defined sequence to determine exactly the shortest Hamiltonian path and shortest Hamiltonian circuit in a weighted complete graph of p vertices. The procedure has intrinsic advantage of landing on the desired solution in quickest possible time and even in worst case in polynomial time. A new characterization of the shortest Hamiltonian tour for a weighted complete graph satisfying triangle inequality (i.e. for tours passing through every city on a realistic map of cities where cities can be taken as points on a Euclidean plane) is also proposed. Finally, we propose a classical algorithm for unstructured search, three new quantum algorithms for unstructured search, which exponentially speed up the searching ability in the unstructured database, and one quantum algorithm for solving a K-SAT problem and indicate its effect on traveling salesman problem and other NP-complete problems.

Explore related subjects

math.GM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dhananjay P. Mehendale. 2025-02-25. Hamiltonian Graphs and the Traveling Salesman Problem. https://arxiv.org/abs/0704.3672

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A Numerical Realization of Suzuki's Weil-Quadratic-Form Operator: The Archimedean Spectral Law, its Universality, and an Operator Form of Weil's Positivity Criterion

This paper presents the first numerical realization of Suzuki's Weil-Quadratic-Form operator, a candidate for the Hilbert--Pólya program linking spectral positivity to the Riemann Hypothesis (RH). Suzuki's 2026 construction was purely theoretical; here, the operator is instantiated via P1 finite-element discretization and Richardson extrapolation. Key results include: (R1) In the prime-free regime, the spectrum follows a closed Archimedean law $A_k(a) = \log(1/a) + \log(k-2) + B_0 + O(a)$, with $B_0 = \log q - 2\log 2$, confirmed to 30-digit precision. (R2) A Mellin double-pole argument proves the head coefficient $B(ν)$ and shows $B_0$ depends only on the conductor $q$, independent of the Archimedean parameter. (R2b) The degree $d$ of an L-function appears directly as the logarithmic slope of the spectrum. (R3) Total spectral intensity follows the prime number theorem, $S(a) \sim (2a)^3/6$. (R4) Nontrivial zeros are not eigenvalues but occur in the explicit-formula error term of the prime symbol. (R5) The best-match line $σ^*(a)$ descends toward the critical line. (R6) Weil's positivity criterion is realized in operator form: bounded residual growth corresponds to all zeros on the line, while an injected off-line zero causes exponential blow-up. (R7) The lowest eigenvalue $λ_1(a)$ is strictly positive, decays superexponentially, and passes smoothly through the first prime threshold. (R8) The characteristic function $W(a,0;z)$ is computed for the first time, with all zeros confirmed real. (R9) Indirect traces of GUE statistics appear in the moment structure, even where direct detection is blocked. The authors emphasize that this work does not prove RH. All results are Archimedean and universal, with significance lying in the faithful numerical realization of classical identities rather than new arithmetic.

math.GM↗
arXiv2026

An exotic $S^2\times S^2$ and an exotic $\mathbb{CP}^2\#\overline{\mathbb{CP}}^2$

We prove that a specified Lidman-Piccirillo piece $V$, a symplectic $4$-manifold with the homology of $S^2\times D^2$ built from a genus-$2$ surface bundle over a once-punctured torus by two Luttinger surgeries, is simply connected, for an explicit permitted choice of the two surgery parametrizations. Three consequences follow. The symplectic double $Z=V\cup_σV$ is homeomorphic but not diffeomorphic to $S^2\times S^2$. The Lidman-Piccirillo manifolds $B$ and $W$ are homeomorphic. Since the figure-eight knot is slice in $B$ and not in $W$, they are the first pair of homeomorphic closed $4$-manifolds distinguished by unconstrained knot slicing, that is, by sliceness with no constraint on the homology class of the slice disk; detecting smooth structure this way goes back to Casson. Finally, the regluing of Lidman and Piccirillo's Theorem~2 applied to $Z$ yields a closed simply connected $4$-manifold homeomorphic but not diffeomorphic to $\mathbb{CP}^2\#\overline{\mathbb{CP}}^2$. The consequences follow from the simple-connectivity statement by the classifications of Freedman and of Hambleton-Kreck, together with a rigidity analysis of the surgery parameters. The fundamental group is computed in the style of Baldridge and Kirk, from explicit based representatives of every meridian and Lagrangian push off, and the resulting relation system is decided by coset enumeration, after calibration on two configurations whose answers are known independently. The development calculations and finite-presentation decisions can be reproduced from the ancillary files.

math.GM↗
arXiv2026

A proof of the irreducibility conjecture for Legendre polynomials

We prove the irreducibility conjecture for Legendre polynomials proposed by Stieltjes: for every integer $j\geq 1$, both $P_{2j}(x)$ and $P_{2j+1}(x)/x$ are irreducible over the rational numbers. The proof proceeds by contradiction. Starting from a hypothetical nontrivial factorization, we remove the zero root from $P_n$ when present, multiply by a suitable constant, and express the resulting polynomial as a product of two integral polynomials $A(x^2)$ and $B(x^2)$. We then construct the resultant and its odd part, $R=\operatorname{Res}_t(A,B), \mathcal{R}=\frac{|R|}{2^{v_2(R)}}.$ Put $k=\operatorname{deg} A\leq\operatorname{deg} B$ and $m=\lfloor n/2\rfloor$. Using the classical auxiliary polynomial $U_n$ and the differential identity $(1-x^2)(P_n'U_n-P_nU_n')=1-P_n^2,$ together with orthogonality, divisibility properties of the coefficients, and a least-common-multiple estimate, we obtain an upper bound for $\mathcal{R}$. On the other hand, the Legendre differential equation gives a lower bound for the absolute value of the derivative of $AB$ at each root of $A$. We use Chebyshev polynomials and Hadamard's inequality to bound the product of the squared pairwise differences of these roots, and combine this with estimates for the leading coefficients and the power of $2$ in $R$ to obtain a lower bound for $\mathcal{R}$. These estimates yield $m\log4-\log\frac{4(m+1)^2}{\sqrt m} <\frac{\log\mathcal R}{k} <(m+\sqrt{2n-1})\log3 (n\ge64).$ For every $n\ge256$, the lower bound strictly exceeds the upper bound, giving a contradiction. Combining this with established irreducibility results and explicit integer comparisons for the remaining degrees proves irreducibility in every degree.

math.GM↗