English

A Modular-Form Framework for Global Optimality in the Asymmetric Traveling-Salesman Problem

Combinatorics 2025-11-18 v3 Optimization and Control

Abstract

In this paper, we develop an alternate formulation of Asymmetric Traveling Salesman Problem (ATSP). The equivalent problem is to find the zeros of a holomorphic cusp form on the principal congruence subgroup, Γ(4)\Gamma(4) . The resultant Poincar{\'e} series gives a cusp form whose interior zeros are in bijection with the arc that constitute optimal Hamiltonian cycle. We show that for any weight, \ell and number of directed arcs, A|A| such that 47<2A4\ell-7<2|A| , the holomorphic cusp form vanishes at global optimum. Furthermore, a three step filter consisting of Fourier coefficients, Hecke recursions and completed LL-function parity test provides a scalar certificate for global optimality. The framework is a potential bridge between discrete optimization and number theory suggesting an alternate view on complexity theory.

Keywords

Cite

@article{arxiv.2404.15546,
  title  = {A Modular-Form Framework for Global Optimality in the Asymmetric Traveling-Salesman Problem},
  author = {Varsha Gupta},
  journal= {arXiv preprint arXiv:2404.15546},
  year   = {2025}
}
R2 v1 2026-06-28T16:04:34.323Z