On the Pólya permanent problem over finite fields
From MaRDI portal
Publication:607375
DOI10.1016/j.ejc.2010.07.001zbMath1209.15011arXiv1003.1984OpenAlexW1976669345MaRDI QIDQ607375
Marko Orel, Bojan Kuzma, Gregor Dolinar, Alexander E. Guterman
Publication date: 22 November 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.1984
Determinants, permanents, traces, other special matrix functions (15A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33)
Related Items
Unnamed Item ⋮ The number of matrices with nonzero permanent over a finite field ⋮ Permanent Polya problem for additive surjective maps ⋮ Permanent versus determinant over a finite field ⋮ Pólya convertibility problem for symmetric matrices ⋮ A relation between the determinant and the permanent on singular matrices ⋮ On the Pólya conversion problem for permanents and determinants ⋮ The sufficient condition of sign conversion for matrices over a finite field ⋮ Converting immanants on skew-symmetric matrices ⋮ Linear immanant converters on skew-symmetric matrices of order 4 ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of computing the permanent
- On the relation between the determinant and the permanent
- Immanant preserving and immanant converting maps
- Pfaffian orientations, 0-1 permanents, and even cycles in directed graphs
- Permanent and determinant
- The asymptotic number of (0,1)-matrices with zero permanent
- A note on the determinant and permanent problem
- Permanents, Pfaffian orientations, and even directed circuits
- A note on immanant preservers
- On the Conversion of the Determinant into the Permanent
- The complexity of theorem-proving procedures