English

The Iris function and the matrix permanent

Combinatorics 2019-02-25 v2

Abstract

This paper defines the Iris function and provides two formulations of the matrix permanent. The first formulation, valid for arbitrary complex matrices, expresses the permanent of a complex matrix as a contour integral of a second order Iris function over the unit circle around zero. The second formulation is defined for the restricted set of matrices with complex or "Gaussian" integer elements. Using the second formulation, the paper shows that the computation of the permanent of an arbitrary n×nn\times n 0-1 matrix is bounded by o(n27(log(n3))6(log2(n))2)o\left( n^{27} \left( \log \left( {{n^3}} \right) \right)^6 \left( \log_2 \left( {{n}} \right) \right)^2\right) binary operations.

Keywords

Cite

@article{arxiv.1902.04152,
  title  = {The Iris function and the matrix permanent},
  author = {Ali Onder Bozdogan},
  journal= {arXiv preprint arXiv:1902.04152},
  year   = {2019}
}

Comments

Second version. Differences from the first version: The typo in Theorem 2 is corrected. An important reference due to Prof. Valiant is inserted, and the importance of the result in Section 3 with regards to the problems in the complexity class #P is stated

R2 v1 2026-06-23T07:38:11.399Z