Graph isomorphism and quantisation of longest cycles by means of determinants and spectra

点击翻译按钮获取中文摘要

A characterisation of the difficulty of the Hamiltonian cycle problem and the graphs isomorphism problem will be a significant conceptual advancement with repercussions in a number of fields including combinatorial optimisation and theoretical computer science, in particular, the Google PageRank. Applications of tensor networks technique will lead to a design of a quantum computer that enumerates all Hamiltonian cycles in a graph. Analysis of the determinant objective function in terms of the eigenvalues may lead to new spectral properties of stochastic matrices. Algorithmic advances exploiting such a characterisation will significantly contribute to existing technologies for solving problems in a wide range of applications.