Fix a number of typos in packages

Now caught after upgrading codespell to version in Ubuntu 24.04 repositories.
Macaulay2 · Oct 15, 2024 · 3ac6122 · 3ac6122
1 parent 7b588c8
commit 3ac6122
Show file tree

Hide file tree

Showing 21 changed files with 48 additions and 48 deletions.
diff --git a/M2/Macaulay2/packages/Bertini/TST/importMainDataFile.tst.m2 b/M2/Macaulay2/packages/Bertini/TST/importMainDataFile.tst.m2
@@ -35,7 +35,7 @@ witnessPoints=importMainDataFile(storeBM2Files)
 assert(#witnessPoints==2)
 
 ------
----Bertini has a positive dimensional solve option. When this option is envoked Bertini will not produce files that have coordinates of witness points, or in otherwords we cannot use the importSolutionsFile command to get information from a positive dimensional run.
+---Bertini has a positive dimensional solve option. When this option is invoked Bertini will not produce files that have coordinates of witness points, or in otherwords we cannot use the importSolutionsFile command to get information from a positive dimensional run.
 --For positive dimensional runs we must use the importMainDataFile command. 
 --Positive dimensional runs automatically use regeneration. Unlike the Zero-dimensional regeneration solver singular solutions are classified in the pos dim case.
 

diff --git a/M2/Macaulay2/packages/Complexes/Tor.m2 b/M2/Macaulay2/packages/Complexes/Tor.m2
@@ -185,7 +185,7 @@ TEST ///
   restart
   needsPackage "Complexes"
 *-
-  -- for quotient rings, some methods reuqire LengthLimit.
+  -- for quotient rings, some methods require LengthLimit.
   S = ZZ/101[a..e]/(e^2);
   I = ideal(c^3-b*d^2, b*c-a*d)
   J = ideal(a*c^2-b^2*d, b^3-a^2*c)

diff --git a/M2/Macaulay2/packages/GKMVarieties/Documentation_GKMVarieties.m2 b/M2/Macaulay2/packages/GKMVarieties/Documentation_GKMVarieties.m2
@@ -208,7 +208,7 @@ doc ///
 
 		Text
 			Similarly as in type $B$, Spin groups are not implemented, so the two connected components of 
-			$SOGr(4,8)$ need be separatedly created in the following way.
+			$SOGr(4,8)$ need be separately created in the following way.
 
 		Example
 			SOGr48odd = generalizedFlagVariety("D",4,{3,3})

diff --git a/M2/Macaulay2/packages/GeometricDecomposability.m2 b/M2/Macaulay2/packages/GeometricDecomposability.m2
@@ -191,7 +191,7 @@ initialYForms(Ideal, RingElement) := opts -> (I, y) -> (
                 return sub(ideal listOfInitYForms, givenRing);
                 );
 
-        -- if we don't have a universal Gröbner bais
+        -- if we don't have a universal Gröbner basis
         inyFormIdeal := ideal leadTerm(1,I);
         return sub(inyFormIdeal, givenRing);
         )

diff --git a/M2/Macaulay2/packages/MonodromySolver/paper-examples/cyclic.m2 b/M2/Macaulay2/packages/MonodromySolver/paper-examples/cyclic.m2
@@ -14,7 +14,7 @@ parametrizedCyclic = n -> (
 		apply(exponents polys#i, t->(i,t))
 		);
 	AR := CC[apply(ind,i->A_i)][gens R];
-	polysP := for i to #polys-1 list -- system with parameteric coefficients and same support 
+	polysP := for i to #polys-1 list -- system with parametric coefficients and same support 
 	sum(exponents polys#i, t->A_(i,t)*AR_(t));
 	polySystem transpose matrix {polysP}
 );

diff --git a/M2/Macaulay2/packages/MonodromySolver/paper-examples/katsura.m2 b/M2/Macaulay2/packages/MonodromySolver/paper-examples/katsura.m2
@@ -25,7 +25,7 @@ parametrizedKatsura = n -> (
 		apply(exponents polys#i, t->(i,t))
 		);
 	AR := CC[apply(ind,i->A_i)][gens R];
-	polysP := for i to #polys-1 list -- system with parameteric coefficients and same support 
+	polysP := for i to #polys-1 list -- system with parametric coefficients and same support 
 	sum(exponents polys#i, t->A_(i,t)*AR_(t));
 	polySystem transpose matrix {polysP}
 );

diff --git a/M2/Macaulay2/packages/MonodromySolver/paper-examples/large-examples/noon10.m2 b/M2/Macaulay2/packages/MonodromySolver/paper-examples/large-examples/noon10.m2
@@ -18,7 +18,7 @@ x_10*x_1^2+x_10*x_2^2+x_10*x_3^2+x_10*x_4^2+x_10*x_5^2+x_10*x_6^2+x_10*x_7^2+x_1
     	apply(exponents polys#i, t->(i,t))
     	);
     AR := CC[apply(ind,i->A_i)][gens R];
-    polysP := for i to #polys-1 list -- system with parameteric coefficients and same support 
+    polysP := for i to #polys-1 list -- system with parametric coefficients and same support 
     sum(exponents polys#i, t->A_(i,t)*AR_(t));
     polySystem transpose matrix {polysP}
     )

diff --git a/M2/Macaulay2/packages/MonodromySolver/solveViaMonodromy.m2 b/M2/Macaulay2/packages/MonodromySolver/solveViaMonodromy.m2
@@ -223,7 +223,7 @@ sparseMonodromySolve PolySystem := o ->  PS -> (
     if numgens coefficientRing R > 0 then error "expected parameter-less system";
     W := symbol W;
     AR := CC[apply(ind,i->W_i)][gens R];
-    polysP := transpose matrix{for i to #polys-1 list -- system with parameteric coefficients and same support 
+    polysP := transpose matrix{for i to #polys-1 list -- system with parametric coefficients and same support 
         sum(exponents polys#i, t->W_(i,t)*AR_(t))};
     P := if o#"new tracking routine" then gateSystem polysP else polySystem polysP;
     targetParam := point sub(fold(polys/coefficients/last,(a,b)->a||b),CC);

diff --git a/...ages/MonodromySolver/under-construction-examples/deprecated-examples/dynamicFlowerTest.m2 b/...ages/MonodromySolver/under-construction-examples/deprecated-examples/dynamicFlowerTest.m2
@@ -7,11 +7,11 @@ n= 7;
 S = gens cyclicRoots(n,CC)
 R = ring S
 polys = flatten entries S
-ind = flatten apply(#polys,i-> -- parameteric coefficients 
+ind = flatten apply(#polys,i-> -- parametric coefficients 
     apply(exponents polys#i, t->(i,t))
     )
 AR = CC[apply(ind,i->A_i)][gens R] 
-polysP = for i to #polys-1 list -- parameteric coefficients 
+polysP = for i to #polys-1 list -- parametric coefficients 
          sum(exponents polys#i, t->A_(i,t)*AR_(t))
 SP = matrix{polysP}
 c0 = point{ 

diff --git a/...y2/packages/NumericalAlgebraicGeometry/SYSTEMS/monodromy/sparse-system-via-polynomials.m2 b/...y2/packages/NumericalAlgebraicGeometry/SYSTEMS/monodromy/sparse-system-via-polynomials.m2
@@ -9,11 +9,11 @@ n = 6
 S = gens cyclicRoots(n,CC)
 R = ring S
 polys = flatten entries S
-ind = flatten apply(#polys,i-> -- parameteric coefficients 
+ind = flatten apply(#polys,i-> -- parametric coefficients 
     apply(exponents polys#i, t->(i,t))
     )
 AR = CC[apply(ind,i->A_i)][gens R] 
-polysP = for i to #polys-1 list -- parameteric coefficients 
+polysP = for i to #polys-1 list -- parametric coefficients 
          sum(exponents polys#i, t->A_(i,t)*AR_(t))
 SP = matrix{polysP}
 

diff --git a/M2/Macaulay2/packages/NumericalAlgebraicGeometry/SYSTEMS/monodromy/sparse-system.m2 b/M2/Macaulay2/packages/NumericalAlgebraicGeometry/SYSTEMS/monodromy/sparse-system.m2
@@ -12,7 +12,7 @@ monoms = flatten entries monomials F
 toGate = m -> product apply(X,first first listForm m,(x,a)->x^a)
 M = hashTable apply(monoms, m->m=>toGate m) -- monomials
 polys = flatten entries F
-C = apply(#polys,i-> -- parameteric coefficients 
+C = apply(#polys,i-> -- parametric coefficients 
     apply(flatten entries monomials polys#i, m->inputGate (symbol c)_(i,m))
     )
 S = transpose matrix{

diff --git a/M2/Macaulay2/packages/NumericalAlgebraicGeometry/doc.m2 b/M2/Macaulay2/packages/NumericalAlgebraicGeometry/doc.m2
@@ -878,7 +878,7 @@ document {
 	"valuesP" => {" contains (possibly several sets of) values of the parameters"}  
 	},
     Outputs => { "sols"=>" lists of lists of solutions for each set of the parameters" },
-    "Solves a parameteric polynomial system for several values of parameters.", 
+    "Solves a parametric polynomial system for several values of parameters.", 
     EXAMPLE lines ///
     R = CC[u1,u2,u3,x,y]
     f1 = u1*(y-1)+u2*(y-2)+u3*(y-3)

diff --git a/M2/Macaulay2/packages/OldPolyhedra.m2 b/M2/Macaulay2/packages/OldPolyhedra.m2
@@ -5,7 +5,7 @@
 --
 -- PURPOSE: Computations with convex polyhedra 
 -- PROGRAMMER : René Birkner 
--- UPDATE HISTORY : April 2008, December 2008, March 2009, Juli 2009,
+-- UPDATE HISTORY : April 2008, December 2008, March 2009, July 2009,
 --     	    	    September 2009, October 2009, January 2010
 ---------------------------------------------------------------------------
 newPackage("OldPolyhedra",

diff --git a/M2/Macaulay2/packages/Polyhedra.m2 b/M2/Macaulay2/packages/Polyhedra.m2
@@ -3,7 +3,7 @@
 --
 -- PURPOSE: Computations with convex polyhedra 
 -- PROGRAMMER : René Birkner 
--- UPDATE HISTORY : April 2008, December 2008, March 2009, Juli 2009,
+-- UPDATE HISTORY : April 2008, December 2008, March 2009, July 2009,
 --     	    	    September 2009, October 2009, January 2010
 ---------------------------------------------------------------------------
 newPackage("Polyhedra",

diff --git a/M2/Macaulay2/packages/RandomCurves.m2 b/M2/Macaulay2/packages/RandomCurves.m2
@@ -1,7 +1,7 @@
 newPackage(
 	"RandomCurves",
     	Version => "0.6",
-    	Date => "Juli 5, 2011",
+    	Date => "July 5, 2011",
     	Authors => {{Name => "Frank-Olaf Schreyer",
 		     Email => "schreyer@math.uni-sb.de",
 		     HomePage => "http://www.math.uni-sb.de/ag/schreyer/"},

diff --git a/M2/Macaulay2/packages/SpechtModule.m2 b/M2/Macaulay2/packages/SpechtModule.m2
@@ -2244,7 +2244,7 @@ multidoc ///
     	    y:YoungTableau
     	Outputs
     	    :List
-		a dubly nested list with the permutations in the row stabilizer
+		a doubly nested list with the permutations in the row stabilizer
     	Description
 	    Text
     	    	The row stabilizer of a tableau is the group of the permutations that fixes the rows of