Abstract
We develop a Tutte decomposition theory for matrices and their combinatorial abstractions, bimatroids. As in the graph or matroid case, this theory is based on a deletion–contraction decomposition. The contribution from the deletion, derived by an inclusion–exclusion argument, consists of three terms. With one more term contributed from the contraction, the decomposition has four terms in general. There are universal decomposition invariants, one of them being a corank–nullity polynomial. Under a simple change of variables, the corank–nullity polynomial equals a weighted characteristic polynomial. This gives an analog of an identity of Tutte. Applications to counting and critical problems on matrices and graphs are given.
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.
