some typos

Author: fchapoton

src/sage/combinat/rsk.py

@@ -1887,7 +1887,7 @@ class RuleSuperRSK(RuleRSK):
 
     * The output still consists of two tableaux `(P, Q)` of equal
       shapes, but rather than both of them being semistandard, now
-      they are semistandard super tableax.
+      they are semistandard super tableaux.
 
     * The main difference is in the way bumping works. Instead of having 
       only row bumping super RSK uses `\epsilon`-insertion, a combination

src/sage/geometry/newton_polygon.py

@@ -11,7 +11,7 @@
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
 #
-#                  http://www.gnu.org/licenses/
+#                  https://www.gnu.org/licenses/
 #############################################################################
 from __future__ import division
 
@@ -246,7 +246,7 @@ def _mul_(self, other):
             sage: NP = NP1 * NP2; NP
             Infinite Newton polygon with 3 vertices: (0, 0), (1, 1), (2, 5/2) ending by an infinite line of slope 2
 
-        The slopes of ``NP`` is the union of thos of ``NP1`` and those of ``NP2``
+        The slopes of ``NP`` is the union of those of ``NP1`` and those of ``NP2``
         which are less than the last slope::
 
             sage: NP1.slopes()

src/sage/matrix/matrix_space.py

@@ -1810,7 +1810,7 @@ def matrix(self, x=None, **kwds):
     def matrix_space(self, nrows=None, ncols=None, sparse=False):
         """
         Return the matrix space with given number of rows, columns and
-        sparcity over the same base ring as self, and defaults the same as
+        sparsity over the same base ring as self, and defaults the same as
         self.
 
         EXAMPLES::

src/sage/rings/invariants/reconstruction.py

@@ -10,16 +10,14 @@
 - Jesper Noordsij (2018-06): initial version
 """
 
-#*****************************************************************************
+# ****************************************************************************
 #     Copyright (C) 2018 Jesper Noordsij <[email protected]>
 #
 #  Distributed under the terms of the GNU General Public License (GPL)
 #  as published by the Free Software Foundation; either version 3 of
 #  the License, or (at your option) any later version.
-#                  http://www.gnu.org/licenses/
-#*****************************************************************************
-
-
+#                  https://www.gnu.org/licenses/
+# ****************************************************************************
 
 
 def binary_quadratic_coefficients_from_invariants(discriminant, invariant_choice='default'):
@@ -28,7 +26,7 @@ def binary_quadratic_coefficients_from_invariants(discriminant, invariant_choice
 
     INPUT:
 
-    - ``discriminant`` -- The value of the the discriminant of the
+    - ``discriminant`` -- The value of the discriminant of the
       binary quadratic.
 
     - ``invariant_choice`` -- The type of invariants provided. The accepted
@@ -69,7 +67,7 @@ def binary_cubic_coefficients_from_invariants(discriminant, invariant_choice='de
 
     INPUT:
 
-    - ``discriminant`` -- The value of the the discriminant of the
+    - ``discriminant`` -- The value of the discriminant of the
       binary cubic.
 
     - ``invariant_choice`` -- The type of invariants provided. The accepted

src/sage/stats/intlist.pyx

@@ -61,10 +61,10 @@ cdef class IntList:
 
         INPUT:
 
-            - values -- int, long, Integer, list of integers, or a TimeSeries
+        - values -- int, long, Integer, list of integers, or a TimeSeries
 
         If the input is a time series or list of floats, then the
-        integer parts of the intries are taken (not the floor).
+        integer parts of the entries are taken (not the floor).
 
         EXAMPLES::