just a few typos

M2/Macaulay2/packages/BernsteinSato/DOC/annFs.m2

@@ -66,7 +66,7 @@ doc ///
     diffRatFun(m,g,f,a)
   Inputs
     f:RingElement
-      polynomial in a Weyl algebra $D$ in $n$ variables or ratinoal function in the fraction
+      polynomial in a Weyl algebra $D$ in $n$ variables or rational function in the fraction
       field of a polynomial ring in $n$ variables
     g:RingElement
       polynomial in a Weyl algebra $D$ in $n$ variables

M2/Macaulay2/packages/BernsteinSato/paramBpoly.m2

@@ -2,7 +2,7 @@
 
 -----------------------------------------------------------------------------
 -- paramBpoly attempts to compute the b-polys for a poly with parameters
--- IN>  f: RingElement (an element in a Weyl algebra with a palynomial ring for a coefficientRing)
+-- IN>  f: RingElement (an element in a Weyl algebra with a polynomial ring for a coefficientRing)
 -- IN>  file: File (e.g., stdio)
 -- OUT> list of all possible Bernstein-Sato polynomials (also write the tree of b-polys into file)
 -----------------------------------------------------------------------------

M2/Macaulay2/packages/Bertini/TST/_bPHSequence.tst.m2

@@ -64,7 +64,7 @@ assert(abs(   (importParameterFile(storeBM2Files,NameParameterFile=>"final_param
        setsOfParameters={{1,1},{1,2}}
        b'PHSequence(storeBM2Files, setsOfParameters, SaveData=>true)
 
---When we have the SaveData option set to true we can see the intermmediate solutions. 
+--When we have the SaveData option set to true we can see the intermediate solutions.
 assert(#importSolutionsFile(storeBM2Files)==3)
 
 assert(#importParameterFile(storeBM2Files,NameParameterFile=>"start_parameters1")==2)
@@ -89,5 +89,3 @@ assert(#importParameterFile(storeBM2Files,StorageFolder=>"StoreMyFiles",NamePara
 assert(#importSolutionsFile(storeBM2Files,StorageFolder=>"StoreMyFiles",NameSolutionsFile=>"nonsingular_solutions1")==2)
 assert(#importParameterFile(storeBM2Files,StorageFolder=>"StoreMyFiles",NameParameterFile=>"start_parameters2")==2)
 assert(#importSolutionsFile(storeBM2Files,StorageFolder=>"StoreMyFiles",NameSolutionsFile=>"nonsingular_solutions2")==2)
-
-

M2/Macaulay2/packages/CellularResolutions.m2

@@ -288,7 +288,7 @@ newCell(List,Ideal) := opt -> (boundary,label) -> (
     if not isCycle boundary then error "Expected the boundary to be a cycle";
     cd := if opt.CellDimension=!=null then opt.CellDimension else 0;
     c := makeCell(boundary,label,cd);
-    if opt.CellDimension=!=null and dim c > cd then error "Incorrect CellDimesion optional parameter";
+    if opt.CellDimension=!=null and dim c > cd then error "Incorrect CellDimension optional parameter";
     c
     )
 newCell(List) := opt -> cells -> newCell(cells,inferLabel cells,CellDimension=>opt.CellDimension);

M2/Macaulay2/packages/Chordal/ChordalDoc.m2

@@ -1279,7 +1279,7 @@ doc /// --reduceDimension
       Pre
     Caveat
         An arc is removed only if all the @TO2 {ChordalNetChain,"chains"}@ through it have small dimension.
-        If an arc belongs to a chain of large dimenson and a chain of small dimension, then the arc will not be removed.
+        If an arc belongs to a chain of large dimension and a chain of small dimension, then the arc will not be removed.
     SeeAlso
         codimCount
         topComponents

M2/Macaulay2/packages/K3Carpets.m2

@@ -1239,7 +1239,7 @@ doc ///
      a+1 is the degree of the strand
    Outputs
      L:List
-      the diagonal entries of the Smith normal form of a the cruital
+      the diagonal entries of the Smith normal form of a the crucial
       matrix
    Description
     Text

M2/Macaulay2/packages/Macaulay2Doc/changes.m2

@@ -84,7 +84,7 @@ document {
 	    },
 	LI { "functionality added or improved:",
 	    UL {
-		LI { "It is now possible to create a fraction field of an iterated polymial ring using ", TO frac, "."},
+		LI { "It is now possible to create a fraction field of an iterated polynomial ring using ", TO frac, "."},
 		LI { "A number of new operators have been added that may be used for defining methods.  See ", TO symbol ^!, ", ",
 		    TO symbol _!, ", ", TO symbol ^~, ", ", TO symbol _~, ", ", TO symbol ^>, ", ", TO symbol ^>=, ", ", TO symbol ^<, ", ",
 		    TO symbol ^<=, ", ", TO symbol _>, ", ", TO symbol _>=, ", ", TO symbol _<, ", ", TO symbol _<=, ", ", TO symbol |_, ", and ",

M2/Macaulay2/packages/MatrixSchubert/MatrixSchubertConstructionsDOC.m2

@@ -231,7 +231,7 @@ doc ///
 	    efficiently by computing the associated invariants for their antidiagonal initial ideals,
 	    which are known to be squarefree by [Wei17]. Therefore the extremal Betti numbers
 	    (which encode regularity, depth, and projective dimension) of ASM ideals coincide 
-	    with those of their antidiagonal initical ideals by [CV20].
+	    with those of their antidiagonal initial ideals by [CV20].
 	Example
 	    time schubertRegularity B
 	    time regularity comodule schubertDeterminantalIdeal B

M2/Macaulay2/packages/PHCpack/PHCpackDoc.m2

@@ -246,7 +246,7 @@ doc ///
   Headline
     Option to specify the dimension to begin searching for positive dimensional components
   Usage
-    numericalIrreducibleDecompositon(...,StartDimension=>ZZ)
+    numericalIrreducibleDecomposition(...,StartDimension=>ZZ)
 ///;
 
 doc ///

M2/Macaulay2/packages/PositivityToricBundles.m2

@@ -696,7 +696,7 @@ f << close;
 
 -- PURPOSE: ensures ascending entries in the filtration matrices of a toric vector bundle
 --   INPUT: 'tvb', toric vector bundle
---  OUTPUT: a toric vector bundle, whose filtation matrices have ascending entries
+--  OUTPUT: a toric vector bundle, whose filtration matrices have ascending entries
 
 wellformedBundleFiltrations = method ()
 wellformedBundleFiltrations (ToricVectorBundleKlyachko) := tvb -> (

M2/Macaulay2/packages/PseudomonomialPrimaryDecomposition.m2

@@ -106,7 +106,7 @@ fromBit2Poly = (B,allVariables) -> (
 
 ------------------------------------------------------------------------------
 -- subroutines for intermediate steps of primary decomposition ---------------
--- NOTE: In ALL subrutines here the polynomial inputs are in bitwise form ----
+-- NOTE: In ALL subroutines here the polynomial inputs are in bitwise form ---
 ------------------------------------------------------------------------------
 
 
@@ -230,7 +230,7 @@ getFactors = B -> (
 )
 
 
--- determines if a square free pseudomonomial ideal is generated by linear polynmomials
+-- determines if a square free pseudomonomial ideal is generated by linear polynomials
 -- Input:
 -- list of generators of a square free pseudomonomial ideal in bitwise form
 -- Output:

M2/Macaulay2/packages/SpectralSequences.m2

@@ -1830,7 +1830,7 @@ doc ///
 	       $H^i(X, \mathcal{F})$ can be realized as the degree zero piece of the multigraded
 	       module
 	       $Ext^i(B^{[l]}, F)$ for sufficiently large $l$; here $B^{[l]}$ denotes
-	       the $l$th Forbenius power of $B$ and $F$ is any multigraded module whose
+	       the $l$th Frobenius power of $B$ and $F$ is any multigraded module whose
 	       corresponding sheaf on $X$ is $\mathcal{F}$.  
 
 	       Given the fan of

M2/Macaulay2/packages/SubalgebraBases/documentation.m2

@@ -140,7 +140,7 @@ doc ///
     Description
         Text
             Computes a partial subalgebra basis for its input.
-            This command returns the computed generators and not a computaiton object.
+            This command returns the computed generators and not a computation object.
             If the input is @ ofClass Subring@,
             then the computation object is stored in the cache of the input.
         Example

M2/Macaulay2/packages/Valuations.m2

@@ -120,7 +120,7 @@ net Valuation := v -> (
 --------------------------- Ordered QQ-module Types ----------------------------
 --------------------------------------------------------------------------------
 
--- Ordered Module based on the monomial order of a polyomial ring
+-- Ordered Module based on the monomial order of a polynomial ring
 --
 -- given two elements a, b in QQ^n they are compared by using the
 -- the monomial order of the polynomial ring:
@@ -145,7 +145,7 @@ orderedQQn(ZZ, List) := (n, monOrder) -> (
     ordMod
 )
 
--- Two ordered modules are equal iff their cached rings are identitcal
+-- Two ordered modules are equal iff their cached rings are identical
 OrderedQQn == OrderedQQn := (N, M) -> (
     N.cache.Ring === M.cache.Ring
 )

M2/Macaulay2/packages/undistributed-packages/ExampleFreeResolutions.m2

@@ -705,7 +705,7 @@ doc ///
     (AGR, ZZ, ZZ, ZZ)
     (AGR, ZZ, ZZ, ZZ, ZZ)
   Headline
-    construct a random arithemtically Gorenstein ring (AGR)
+    construct a random arithmetically Gorenstein ring (AGR)
   Usage
     AGR(deg, n, deg, characteristic)
     AGR(deg, n, numpowers, characteristic)