The Permanent Rank of a Matrix (Part Two)
Abstract
Define the perrank of an m×n matrix M to be the size of a largest square submatrix with nonzero permanent; if this is equal to m or n, then we say M has full perrank. We derive numerous results on the perrank of a matrix by methods of commutative algebra.
Fields of Study & Subjects
Advanced Combinatorial Mathematics
Matrix Theory and Algorithms
Rings
Modules
and Algebras
Publication details
- Journal / source
- Preprints.org
- Publication date
- 2 March 2026
- Language
- EN
- Document type
- Preprint