Abstract
In this article, we consider the calculation of the permanent of a (0, 1)-matrix using determinants. We investigate when determinants of more than one signing of the original are used to calculate the permanent and we show that non-convertible matrices require at least four different signings. Then, we loosen the restriction that the matrices used to convert the permanent are signings of the original and use this to reduce the number of determinants necessary to convert the permanent of the all 1's matrix by considering a particular partition of the set S n of permutations of {1, … , n}. Finally, we construct a sequence of maximal convertible matrices with a small number of nonzero entries, thus lowering the possible upper bound for the number of nonzero entries of such a matrix, relative to the order.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
