Trac #25115: more https links and some typos

* https links to www.win.nl

* 2 typos in the word "lattice"

URL: https://trac.sagemath.org/25115
Reported by: chapoton
Ticket author(s): Frédéric Chapoton
Reviewer(s): Travis Scrimshaw

build/pkgs/graphs/SPKG.txt

@@ -14,7 +14,7 @@ Grout. Since April 2012 it also contains the ISGCI graph database.
  * For Andries Brouwer's database:
 
    The data is taken from from Andries E. Brouwer's website
-   (http://www.win.tue.nl/~aeb/). Anything related to the data should be
+   (https://www.win.tue.nl/~aeb/). Anything related to the data should be
    reported to him directly (aeb@cwi.nl)
 
    The code used to parse the data and create the .json file is available at

src/doc/en/reference/references/index.rst

@@ -667,7 +667,7 @@ REFERENCES:
 .. [CMT2003] \A. M. Cohen, S. H. Murray, D. E. Talyor.
              *Computing in groups of Lie type*.
              Mathematics of Computation. **73** (2003), no 247. pp. 1477--1498.
-             http://www.win.tue.nl/~amc/pub/papers/cmt.pdf
+             https://www.win.tue.nl/~amc/pub/papers/cmt.pdf
 
 .. [Co1984] \J. Conway, Hexacode and tetracode - MINIMOG and
             MOG. *Computational group theory*, ed. M. Atkinson,

src/sage/coding/delsarte_bounds.py

@@ -207,7 +207,7 @@ def delsarte_bound_hamming_space(n, d, q, return_data=False, solver="PPL", isint
        sage: codes.bounds.delsarte_bound_hamming_space(11,3,4)
        327680/3
 
-    An improvement of a known upper bound (150) from http://www.win.tue.nl/~aeb/codes/binary-1.html ::
+    An improvement of a known upper bound (150) from https://www.win.tue.nl/~aeb/codes/binary-1.html ::
 
        sage: a,p,x = codes.bounds.delsarte_bound_hamming_space(23,10,2,return_data=True,isinteger=True); x # long time
        148

src/sage/combinat/posets/lattices.py

@@ -758,7 +758,7 @@ def join_primes(self):
         implies `x \le a` or `x \le b` for every `a, b \in L`.
 
         These are also called *coprime* in some books. Every join-prime
-        is join-irreducible; converse holds if and only if the lattise
+        is join-irreducible; converse holds if and only if the lattice
         is distributive.
 
         EXAMPLES::
@@ -795,7 +795,7 @@ def meet_primes(self):
         implies `x \ge a` or `x \ge b` for every `a, b \in L`.
 
         These are also called just *prime* in some books. Every meet-prime
-        is meet-irreducible; converse holds if and only if the lattise
+        is meet-irreducible; converse holds if and only if the lattice
         is distributive.
 
         EXAMPLES::

src/sage/graphs/generators/classical_geometries.py

@@ -34,7 +34,7 @@ def SymplecticPolarGraph(d, q, algorithm=None):
     made adjacent if `f(u,v)=0`.
 
     See the page `on symplectic graphs on Andries Brouwer's website
-    <http://www.win.tue.nl/~aeb/graphs/Sp.html>`_.
+    <https://www.win.tue.nl/~aeb/graphs/Sp.html>`_.
 
     INPUT:
 
@@ -124,7 +124,7 @@ def AffineOrthogonalPolarGraph(d,q,sign="+"):
 
     For more information on Affine Polar graphs, see `Affine Polar
     Graphs page of Andries Brouwer's website
-    <http://www.win.tue.nl/~aeb/graphs/VO.html>`_.
+    <https://www.win.tue.nl/~aeb/graphs/VO.html>`_.
 
     INPUT:
 
@@ -153,7 +153,7 @@ def AffineOrthogonalPolarGraph(d,q,sign="+"):
         True
 
     Some examples from `Brouwer's table or strongly regular graphs
-    <http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`_::
+    <https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`_::
 
         sage: g = graphs.AffineOrthogonalPolarGraph(6,2,"-"); g
         Affine Polar Graph VO^-(6,2): Graph on 64 vertices
@@ -209,7 +209,7 @@ def _orthogonal_polar_graph(m, q, sign="+", point_type=[0]):
     A helper function to build ``OrthogonalPolarGraph`` and ``NO2,3,5`` graphs.
 
     See the `page of
-    Andries Brouwer's website <http://www.win.tue.nl/~aeb/graphs/srghub.html>`_.
+    Andries Brouwer's website <https://www.win.tue.nl/~aeb/graphs/srghub.html>`_.
 
     INPUT:
 
@@ -330,7 +330,7 @@ def OrthogonalPolarGraph(m, q, sign="+"):
     Returns the Orthogonal Polar Graph `O^{\epsilon}(m,q)`.
 
     For more information on Orthogonal Polar graphs, see the `page of
-    Andries Brouwer's website <http://www.win.tue.nl/~aeb/graphs/srghub.html>`_.
+    Andries Brouwer's website <https://www.win.tue.nl/~aeb/graphs/srghub.html>`_.
 
     INPUT:
 
@@ -401,7 +401,7 @@ def NonisotropicOrthogonalPolarGraph(m, q, sign="+", perp=None):
       Note that for `q=2` one will get a complete graph.
 
     For more information, see Sect. 9.9 of [BH12]_ and [BvL84]_. Note that the `page of
-    Andries Brouwer's website <http://www.win.tue.nl/~aeb/graphs/srghub.html>`_
+    Andries Brouwer's website <https://www.win.tue.nl/~aeb/graphs/srghub.html>`_
     uses different notation.
 
     INPUT:
@@ -592,7 +592,7 @@ def UnitaryPolarGraph(m, q, algorithm="gap"):
     Returns the Unitary Polar Graph `U(m,q)`.
 
     For more information on Unitary Polar graphs, see the `page of
-    Andries Brouwer's website <http://www.win.tue.nl/~aeb/graphs/srghub.html>`_.
+    Andries Brouwer's website <https://www.win.tue.nl/~aeb/graphs/srghub.html>`_.
 
     INPUT:
 

src/sage/graphs/generators/families.py

@@ -689,7 +689,7 @@ def chang_graphs():
     Three of the four strongly regular graphs of parameters `(28,12,6,4)` are
     called the Chang graphs. The fourth is the line graph of `K_8`. For more
     information about the Chang graphs, see :wikipedia:`Chang_graphs` or
-    http://www.win.tue.nl/~aeb/graphs/Chang.html.
+    https://www.win.tue.nl/~aeb/graphs/Chang.html.
 
     EXAMPLES: check that we get 4 non-isomorphic s.r.g.'s with the
     same parameters::
@@ -933,7 +933,7 @@ def GoethalsSeidelGraph(k,r):
     vertices with degree `k=(n+r-1)/2`.
 
     It appears under this name in Andries Brouwer's `database of strongly
-    regular graphs <http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__.
+    regular graphs <https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__.
 
     INPUT:
 

src/sage/graphs/generators/intersection.py

@@ -385,7 +385,7 @@ def OrthogonalArrayBlockGraph(k,n,OA=None):
     of them being adjacent if one of their coordinates match.
 
     For more information on these graphs, see `Andries Brouwer's page
-    on Orthogonal Array graphs <www.win.tue.nl/~aeb/graphs/OA.html>`_.
+    on Orthogonal Array graphs <https://www.win.tue.nl/~aeb/graphs/OA.html>`_.
 
     .. WARNING::
 

src/sage/graphs/generators/smallgraphs.py

@@ -314,7 +314,7 @@ def WellsGraph():
     Returns the Wells graph.
 
     For more information on the Wells graph (also called Armanios-Wells graph),
-    see `this page <http://www.win.tue.nl/~aeb/graphs/Wells.html>`_.
+    see `this page <https://www.win.tue.nl/~aeb/graphs/Wells.html>`_.
 
     The implementation follows the construction given on page 266 of
     [BCN89]_. This requires to create intermediate graphs and run a small
@@ -1399,7 +1399,7 @@ def BrouwerHaemersGraph():
     `(81,20,1,6)`. It is build in Sage as the Affine Orthogonal graph
     `VO^-(6,3)`. For more information on this graph, see its `corresponding page
     on Andries Brouwer's website
-    <http://www.win.tue.nl/~aeb/graphs/Brouwer-Haemers.html>`_.
+    <https://www.win.tue.nl/~aeb/graphs/Brouwer-Haemers.html>`_.
 
     EXAMPLES::
 
@@ -1768,7 +1768,7 @@ def CameronGraph():
     \lambda = 9, \mu = 3`.
 
     For more information on the Cameron graph, see
-    `<http://www.win.tue.nl/~aeb/graphs/Cameron.html>`_.
+    `<https://www.win.tue.nl/~aeb/graphs/Cameron.html>`_.
 
     EXAMPLES::
 
@@ -3077,7 +3077,7 @@ def HigmanSimsGraph(relabel=True):
     REFERENCES:
 
         .. [BROUWER-HS-2009] `Higman-Sims graph
-           <http://www.win.tue.nl/~aeb/graphs/Higman-Sims.html>`_.
+           <https://www.win.tue.nl/~aeb/graphs/Higman-Sims.html>`_.
            Andries E. Brouwer, accessed 24 October 2009.
         .. [HIGMAN1968] A simple group of order 44,352,000,
            Math.Z. 105 (1968) 110-113. D.G. Higman & C. Sims.
@@ -3616,7 +3616,7 @@ def M22Graph():
     `v = 77, k = 16, \lambda = 0, \mu = 4`.
 
     For more information on the `M_{22}` graph, see
-    `<http://www.win.tue.nl/~aeb/graphs/M22.html>`_.
+    `<https://www.win.tue.nl/~aeb/graphs/M22.html>`_.
 
     EXAMPLES::
 
@@ -3757,7 +3757,7 @@ def McLaughlinGraph():
     `(275, 112, 30, 56)`.
 
     For more information on the McLaughlin Graph, see its web page on `Andries
-    Brouwer's website <http://www.win.tue.nl/~aeb/graphs/McL.html>`_ which gives
+    Brouwer's website <https://www.win.tue.nl/~aeb/graphs/McL.html>`_ which gives
     the definition that this method implements.
 
     .. NOTE::
@@ -4038,7 +4038,7 @@ def PerkelGraph():
     The Perkel Graph is a 6-regular graph with `57` vertices and `171` edges. It
     is the unique distance-regular graph with intersection array
     `(6,5,2;1,1,3)`. For more information, see the :wikipedia:`Perkel_graph` or
-    http://www.win.tue.nl/~aeb/graphs/Perkel.html.
+    https://www.win.tue.nl/~aeb/graphs/Perkel.html.
 
     EXAMPLES::
 
@@ -4242,7 +4242,7 @@ def SylvesterGraph():
     edge.
 
     For more information on the Sylvester graph, see
-    `<http://www.win.tue.nl/~aeb/graphs/Sylvester.html>`_.
+    `<https://www.win.tue.nl/~aeb/graphs/Sylvester.html>`_.
 
     .. SEEALSO::
 
@@ -4280,7 +4280,7 @@ def SimsGewirtzGraph():
     \lambda = 0, \mu = 2`
 
     For more information on the Sylvester graph, see
-    `<http://www.win.tue.nl/~aeb/graphs/Sims-Gewirtz.html>`_ or its
+    `<https://www.win.tue.nl/~aeb/graphs/Sims-Gewirtz.html>`_ or its
     :wikipedia:`Wikipedia page <Gewirtz graph>`.
 
     .. SEEALSO::

src/sage/graphs/strongly_regular_db.pyx

@@ -7,7 +7,7 @@ This module manages a database associating to a set of four integers
 exists.
 
 Using Andries Brouwer's `database of strongly regular graphs
-<http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__, it can also return
+<https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__, it can also return
 non-existence results. Note that some constructions are missing, and that some
 strongly regular graphs that exist in the database cannot be automatically built
 by Sage. Help us if you know any.
@@ -16,7 +16,7 @@ An outline of the implementation can be found in [CP16]_.
 .. NOTE::
 
     Any missing/incorrect information in the database must be reported to
-    `Andries E. Brouwer <http://www.win.tue.nl/~aeb/>`__ directly, in order to
+    `Andries E. Brouwer <https://www.win.tue.nl/~aeb/>`__ directly, in order to
     have a unique and updated source of information.
 
 REFERENCES:
@@ -232,7 +232,7 @@ def is_orthogonal_array_block_graph(int v,int k,int l,int mu):
       Acta Applicandaie Math. 29(1992), 129-138
     """
     # notations from
-    # http://www.win.tue.nl/~aeb/graphs/OA.html
+    # https://www.win.tue.nl/~aeb/graphs/OA.html
     from sage.combinat.matrices.hadamard_matrix import skew_hadamard_matrix
     try:
         m, n = latin_squares_graph_parameters(v,k,l,mu)
@@ -277,7 +277,7 @@ def is_johnson(int v,int k,int l,int mu):
 
         sage: t = is_johnson(5,5,5,5); t
     """
-    # Using notations of http://www.win.tue.nl/~aeb/graphs/Johnson.html
+    # Using notations of https://www.win.tue.nl/~aeb/graphs/Johnson.html
     #
     # J(n,m) has parameters v = m(m – 1)/2, k = 2(m – 2), λ = m – 2, μ = 4.
     m = l + 2
@@ -293,7 +293,7 @@ def is_steiner(int v,int k,int l,int mu):
     Test whether some Steiner graph is `(v,k,\lambda,\mu)`-strongly regular.
 
     A Steiner graph is the intersection graph of a Steiner set system. For more
-    information, see http://www.win.tue.nl/~aeb/graphs/S.html.
+    information, see https://www.win.tue.nl/~aeb/graphs/S.html.
 
     INPUT:
 
@@ -316,7 +316,7 @@ def is_steiner(int v,int k,int l,int mu):
 
         sage: t = is_steiner(5,5,5,5); t
     """
-    # Using notations from http://www.win.tue.nl/~aeb/graphs/S.html
+    # Using notations from https://www.win.tue.nl/~aeb/graphs/S.html
     #
     # The block graph of a Steiner 2-design S(2,m,n) has parameters:
     # v = n(n-1)/m(m-1), k = m(n-m)/(m-1), λ = (m-1)^2 + (n-1)/(m–1)–2, μ = m^2.
@@ -336,7 +336,7 @@ def is_affine_polar(int v,int k,int l,int mu):
     r"""
     Test whether some Affine Polar graph is `(v,k,\lambda,\mu)`-strongly regular.
 
-    For more information, see http://www.win.tue.nl/~aeb/graphs/VO.html.
+    For more information, see https://www.win.tue.nl/~aeb/graphs/VO.html.
 
     INPUT:
 
@@ -359,7 +359,7 @@ def is_affine_polar(int v,int k,int l,int mu):
 
         sage: t = is_affine_polar(5,5,5,5); t
     """
-    # Using notations from http://www.win.tue.nl/~aeb/graphs/VO.html
+    # Using notations from https://www.win.tue.nl/~aeb/graphs/VO.html
     #
     # VO+(2e,q) has parameters: v = q^(2e), k = (q^(e−1) + 1)(q^e − 1), λ =
     # q(q^(e−2) + 1)(q^(e−1) − 1) + q − 2, μ = q^(e−1)(q^(e−1) + 1)
@@ -391,7 +391,7 @@ def is_orthogonal_polar(int v,int k,int l,int mu):
     r"""
     Test whether some Orthogonal Polar graph is `(v,k,\lambda,\mu)`-strongly regular.
 
-    For more information, see http://www.win.tue.nl/~aeb/graphs/srghub.html.
+    For more information, see https://www.win.tue.nl/~aeb/graphs/srghub.html.
 
     INPUT:
 
@@ -1241,7 +1241,7 @@ def is_unitary_polar(int v,int k,int l,int mu):
     r"""
     Test whether some Unitary Polar graph is `(v,k,\lambda,\mu)`-strongly regular.
 
-    For more information, see http://www.win.tue.nl/~aeb/graphs/srghub.html.
+    For more information, see https://www.win.tue.nl/~aeb/graphs/srghub.html.
 
     INPUT:
 
@@ -1316,7 +1316,7 @@ def is_unitary_dual_polar(int v,int k,int l,int mu):
     Test whether some Unitary Dual Polar graph is `(v,k,\lambda,\mu)`-strongly regular.
 
     This must be the U_5(q) on totally isotropic lines.
-    For more information, see http://www.win.tue.nl/~aeb/graphs/srghub.html.
+    For more information, see https://www.win.tue.nl/~aeb/graphs/srghub.html.
 
     INPUT:
 
@@ -1455,7 +1455,7 @@ def is_twograph_descendant_of_srg(int v, int k0, int l, int mu):
 
     If we can construct such `G` then we return a function to build a
     `(v,k_0,\lambda,\mu)`-s.r.g.  For more information,
-    see 10.3 in http://www.win.tue.nl/~aeb/2WF02/spectra.pdf
+    see 10.3 in https://www.win.tue.nl/~aeb/2WF02/spectra.pdf
 
     INPUT:
 
@@ -1554,7 +1554,7 @@ def is_switch_skewhad(int v, int k, int l, int mu):
     Test whether some ``switch skewhad^2+*`` is `(v,k,\lambda,\mu)`-strongly regular.
 
     The ``switch skewhad^2+*`` graphs appear on `Andries Brouwer's database
-    <http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__ and are built by
+    <https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__ and are built by
     adding an isolated vertex to the complement of
     :func:`~sage.graphs.graph_generators.GraphGenerators.SquaredSkewHadamardMatrixGraph`,
     and a :meth:`Seidel switching <Graph.seidel_switching>` a set of disjoint
@@ -1600,7 +1600,7 @@ def is_switch_OA_srg(int v, int k, int l, int mu):
     Test whether some *switch* `OA(k,n)+*` is `(v,k,\lambda,\mu)`-strongly regular.
 
     The "switch* `OA(k,n)+*` graphs appear on `Andries Brouwer's database
-    <http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__ and are built by
+    <https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__ and are built by
     adding an isolated vertex to a
     :meth:`~sage.graphs.graph_generators.GraphGenerators.OrthogonalArrayBlockGraph`,
     and a :meth:`Seidel switching <Graph.seidel_switching>` a set of disjoint
@@ -2584,7 +2584,7 @@ def SRG_175_72_20_36():
     :meth:`~sage.graphs.graph_generators.GraphGenerators.HoffmanSingletonGraph`. Setting
     two vertices to be adjacent if their distance in the line graph is exactly
     2 yields the graph. For more information, see 10.B.(iv) in [BvL84]_ and
-    http://www.win.tue.nl/~aeb/graphs/McL.html.
+    https://www.win.tue.nl/~aeb/graphs/McL.html.
 
     EXAMPLES::
 
@@ -2811,7 +2811,7 @@ def strongly_regular_graph(int v,int k,int l,int mu=-1,bint existence=False,bint
     Return a `(v,k,\lambda,\mu)`-strongly regular graph.
 
     This function relies partly on Andries Brouwer's `database of strongly
-    regular graphs <http://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__. See
+    regular graphs <https://www.win.tue.nl/~aeb/graphs/srg/srgtab.html>`__. See
     the documentation of :mod:`sage.graphs.strongly_regular_db` for more
     information.