English

On the Polya permanent problem over finite fields

Combinatorics 2010-03-11 v1

Abstract

Let \FF\FF be a finite field of characteristics different from two. We show that no bijective map transforms permanent into determinant when the cardinality of \FF\FF is sufficiently large. We also give an example of non-bijective map when \FF\FF is arbitrary and an example of a bijective map when \FF\FF is infinite which do transform permanent into determinant. The developed technique allows us to estimate the probability of the permanent and the determinant of matrices over finite fields to have a given value. Our results are also true over finite rings without zero divisors.

Keywords

Cite

@article{arxiv.1003.1984,
  title  = {On the Polya permanent problem over finite fields},
  author = {Gregor Dolinar and Alexander E. Guterman and Bojan Kuzma and Marko Orel},
  journal= {arXiv preprint arXiv:1003.1984},
  year   = {2010}
}

Comments

25 pages

R2 v1 2026-06-21T14:55:45.317Z