Fixed typo and added proper reference to Bruin-DisneyHogg-Gao

Author: sw0rl

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

@@ -1108,6 +1108,12 @@ REFERENCES:
         J. Pure Appl. Algebra 223 (2019), no. 9, 4065–4088.
         :arxiv:`1805.05736`.
 
+.. [BDHG2024] Nils Bruin, Linden Disney-Hogg, and Wuqian Effie Gao,
+             *Rigorous numerical integration of algebraic functions*,
+             Journal of Software for Algebra and Geometry, Vol. 14 (2024), 117-132,
+             https://msp.org/jsag/2024/14-1/p13.xhtml
+             :doi:`10.2140/jsag.2024.14.117`
+
 .. [BM2004] John M. Boyer and Wendy J. Myrvold, *On the Cutting Edge:
             *Simplified `O(n)` Planarity by Edge Addition*. Journal of Graph
             Algorithms and Applications, Vol. 8, No. 3, pp. 241-273,

src/sage/schemes/riemann_surfaces/riemann_surface.py

@@ -554,8 +554,8 @@ class RiemannSurface:
     result is seemingly converging to estimate the error. The ``'rigorous'``
     method uses results from [Neu2018]_, and bounds the algebraic integrands on
     circular domains using Cauchy's form of the remainder in Taylor approximation
-    coupled to Fujiwara's bound on polynomial roots (see Bruin-DisneyHogg-Gao,
-    in preparation). Note this method of bounding on circular domains is also
+    coupled to Fujiwara's bound on polynomial roots [BDHG2024]_. Note this method
+    of bounding on circular domains is also
     implemented in :meth:`_compute_delta`. The net result of this bounding is
     that one can know (an upper bound on) the number of nodes required to achieve
     a certain error. This means that for any given integral, assuming that the
@@ -2049,9 +2049,9 @@ def rigorous_line_integral(self, upstairs_edge, differentials, bounding_data):
         Using the error bounds for Gauss-Legendre integration found in [Neu2018]_
         and a method for bounding an algebraic integrand on a circular domains
         using Cauchy's form of the remainder in Taylor approximation coupled to
-        Fujiwara's bound on polynomial roots (see Bruin-DisneyHogg-Gao, in
-        preparation), this method calculates (semi-)rigorously the integral of a
-        list of differentials along an edge of the upstairs graph.
+        Fujiwara's bound on polynomial roots [BDHG2024]_, this method calculates
+        (semi-)rigorously the integral of a list of differentials along an edge
+        of the upstairs graph.
 
         INPUT:
 
@@ -3921,7 +3921,7 @@ def integer_matrix_relations(M1, M2, b=None, r=None):
 
     Given two square matrices with complex entries of size `g`, `h` respectively,
     numerically determine an (approximate) `\ZZ`-basis for the `2g \times 2h` matrices
-    with integer entries of the shape `(D, B; C, A)` such that `B+M_1*A=(D+M_1*C)*M2`.
+    with integer entries of the shape `(D, B; C, A)` such that `B+M_1*A=(D+M_1*C)*M_2`.
     By considering real and imaginary parts separately we obtain `2gh` equations
     with real coefficients in `4gh` variables. We scale the coefficients by a
     constant `2^b` and round them to integers, in order to obtain an integer