Description
FastLinAlg is a for computing (applications of) function field linear algebra more quickly in certain settings.
This package is still experimental. It provides functionality for doing certain linear algebra operations in function fields quickly. There is some multithreaded capability which is disabled by default.
Useful functions:
-
chooseGoodMinors Tries to find interesting minors of a matrix.
-
isRankAtLeast Tries to show that a matrix has rank at least a given number by looking at submatrices
-
regularInCodimension checks whether a ring is regular in codimension n only in the affirmative.
-
projDim checks the projective dimension of a module and may give better answers than pdim in the case that R is not homogeneous
-
recursiveMinors provides a different strategy for computing minors of a matrix. It is a cofactor strategy where the determinants of smaller minors are stored.
-
isCodimAtLeast provides a way for finding lower bounds for the codimension of an ideal, without actually computing the codimension.
Many of these functions have extensive options for fine tuning their behavior, for instance by controlling how submatrices are chosen. See the documentation for
StrategyDefaultAcknowledgements:The authors would like to thank David Eisenbud, Eloisa Grifo, and Srikanth Iyengar for useful conversations and comments on the development of this package.
Boyana Martinova received funding from the University of Utah Mathematics Department REU program and from the ACCESS program at the University of Utah, while developing this package.
Marcus Robinson received funding from the NSF RTG grant 1246989 while developing this package.
Karl Schwede received funding from NSF grant 1801849 while developing this package.
Yuhui (Wei) Yao received funding from the University of Utah Mathematics Department REU program, while developing this package