QuillenSuslin : Table of Contents

• QuillenSuslin -- computes a free basis of a projective module over a polynomial ring
• changeVar -- computes a change of variables which make the first entry of a unimodular row monic in a specified variable
• CheckProjective -- optional input which gives the user the option to check whether the given module is projective
• CheckUnimodular -- optional input which gives the user the option to check whether the given matrix is unimodular
• completeMatrix -- completes a unimodular matrix over a polynomial ring or Laurent polynomial ring to a square invertible matrix
• computeFreeBasis -- computes a free basis of a projective module
• getMaxIdeal -- computes a maximal ideal containing a given ideal in a polynomial ring
• horrocks -- computes a local solution to the unimodular row problem over a localization at a maximal ideal
• isProjective -- determines if a given module is projective with constant rank over a Noetherian ring
• isUnimodular -- determines if a given matrix is unimodular
• maxMinors -- computes the ideal generated by the maximal non-vanishing minors of a given matrix
• patch -- patch together local solutions to eliminate a variable
• qsAlgorithm -- computes a solution to the unimodular matrix problem
• qsIsomorphism -- computes an isomorphism between a free module and a given projective module