2000 character limit reached
The common-submatrix Laplace expansion
Published 20 May 2015 in math.AC | (1505.05486v1)
Abstract: We state and prove a classical version of the Laplace expansion theorem where all submatrices in the expansion are restricted to contain a specified common submatrix (CSM). The result states that (accounting for signs) this restricted expansion equals the determinant of the original matrix times the determinant of the CSM.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.