Exact recursive calculation of circulant permanents: A band of different diagonals inside a uniform matrix
arXiv:2109.01740 · doi:10.3390/e23111423
Abstract
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence relations which is based on the permanents of the matrices with defects. The proposed system of linear recurrence equations with variable coefficients provides a powerful tool for the analysis of the circulant permanents, their fast, linear time computing and finding their asymptotics in a large-matrix-size limit. The latter problem is an open fundamental problem. Its solution would be tremendously important for a unified analysis of a wide range of the nature's #P-hard problems, including problems in the physics of many-body systems, critical phenomena, quantum computing, quantum field theory, theory of chaos, fractals, theory of graphs, number theory, combinatorics, cryptography, etc.
arXiv comment20 pages
References in corpus (9)
- Quantum Computational Supremacy
- A Linear-Optical Proof that the Permanent is #P-Hard
- Universality of Generalized Bunching and Efficient Assessment of Boson Sampling
- An efficient tree decomposition method for permanents and mixed discriminants
- Quantum software for linear photonic simulations
- Simulating and assessing boson sampling experiments with phase-space representations
- A simple formula for Bose-Einstein corrections
- Microscopic theory of phase transitions in a critical region
- Weighted de Bruijn Graphs for the Menage Problem and Its Generalizations