The Cullis' determinant as Pfaffian
Alexander Guterman, Andrey Yurkov

TL;DR
This paper introduces a novel expression of the Cullis' determinant as a Pfaffian and presents an efficient polynomial-time algorithm for its computation.
Contribution
It expresses the Cullis' determinant as a Pfaffian and develops a new polynomial-time algorithm for calculating it.
Findings
Cullis' determinant expressed as a Pfaffian.
Efficient polynomial-time algorithm for calculation.
Generalizes determinant concept for rectangular matrices.
Abstract
The Cullis' determinant is a generalization of the ordinary determinant for rectangular matrices. It is defined as the alternating sum of maximal minors of given matrix. In this paper we express the Cullis' determinant of a matrix as the Pfaffian of the matrix obtained from by matrix multiplication and transposition. Relying on this result, we present an efficient polynomial-time algorithm for calculating the Cullis' determinant of given matrix.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
