diff -up src/sage/graphs/strongly_regular_db.pyx.orig src/sage/graphs/strongly_regular_db.pyx
--- src/sage/graphs/strongly_regular_db.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/graphs/strongly_regular_db.pyx	2023-03-13 08:43:22.143746071 -0600
@@ -2443,7 +2443,7 @@ def strongly_regular_from_two_intersecti
 
     A set of points in the projective geometry `PG(k,q)` is said to be a
     2-intersection set if it intersects every hyperplane in either `h_1` or
-    `h_2` points, where `h_1,h_2\in \\NN`.
+    `h_2` points, where `h_1,h_2\in \NN`.
 
     From a 2-intersection set `S` can be defined a strongly-regular graph in the
     following way:
diff -up src/sage/groups/group.pyx.orig src/sage/groups/group.pyx
--- src/sage/groups/group.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/groups/group.pyx	2023-03-13 08:43:22.143746071 -0600
@@ -51,7 +51,7 @@ def is_Group(x):
 
 
 cdef class Group(Parent):
-    """
+    r"""
     Base class for all groups
 
     TESTS::
diff -up src/sage/groups/perm_gps/partn_ref/refinement_binary.pyx.orig src/sage/groups/perm_gps/partn_ref/refinement_binary.pyx
--- src/sage/groups/perm_gps/partn_ref/refinement_binary.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/groups/perm_gps/partn_ref/refinement_binary.pyx	2023-03-13 08:43:22.144746053 -0600
@@ -105,7 +105,7 @@ cdef class LinearBinaryCodeStruct(Binary
         self.ith_word = &ith_word_linear
 
     def run(self, partition=None):
-        """
+        r"""
         Perform the canonical labeling and automorphism group computation,
         storing results to self.
 
diff -up src/sage/libs/ntl/ntl_mat_ZZ.pyx.orig src/sage/libs/ntl/ntl_mat_ZZ.pyx
--- src/sage/libs/ntl/ntl_mat_ZZ.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/libs/ntl/ntl_mat_ZZ.pyx	2023-03-13 08:43:33.262545927 -0600
@@ -129,7 +129,7 @@ cdef class ntl_mat_ZZ():
         return unpickle_class_args, (ntl_mat_ZZ, (self.__nrows, self.__ncols, self.list()))
 
     def __repr__(self):
-        """
+        r"""
         Return the string representation of self.
 
         EXAMPLES::
diff -up src/sage/libs/symmetrica/sc.pxi.orig src/sage/libs/symmetrica/sc.pxi
--- src/sage/libs/symmetrica/sc.pxi.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/libs/symmetrica/sc.pxi	2023-03-13 08:43:36.725482994 -0600
@@ -103,7 +103,7 @@ def charvalue_symmetrica(irred, cls, tab
 
 
 def kranztafel_symmetrica(a, b):
-    """
+    r"""
     you enter the INTEGER objects, say a and b, and res becomes a
     MATRIX object, the charactertable of S_b \wr S_a, co becomes a
     VECTOR object of classorders and cl becomes a VECTOR object of
diff -up src/sage/matrix/matrix_integer_dense.pyx.orig src/sage/matrix/matrix_integer_dense.pyx
--- src/sage/matrix/matrix_integer_dense.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/matrix/matrix_integer_dense.pyx	2023-03-13 08:43:36.727482958 -0600
@@ -757,7 +757,7 @@ cdef class Matrix_integer_dense(Matrix_d
         return ans
 
     def _multiply_classical(self, Matrix_integer_dense right):
-        """
+        r"""
         EXAMPLES::
 
             sage: n = 3
diff -up src/sage/matrix/matrix_modn_dense_template.pxi.orig src/sage/matrix/matrix_modn_dense_template.pxi
--- src/sage/matrix/matrix_modn_dense_template.pxi.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/matrix/matrix_modn_dense_template.pxi	2023-03-13 08:43:36.728482940 -0600
@@ -649,7 +649,7 @@ cdef class Matrix_modn_dense_template(Ma
         return (word_size, little_endian, s), 10
 
     def _unpickle(self, data, int version):
-        """
+        r"""
         TESTS:
 
         Test for char-sized modulus::
@@ -2261,7 +2261,7 @@ cdef class Matrix_modn_dense_template(Ma
             return Matrix_dense.determinant(self)
 
     cdef xgcd_eliminate(self, celement * row1, celement* row2, Py_ssize_t start_col):
-        """
+        r"""
         Reduces ``row1`` and ``row2`` by a unimodular transformation
         using the xgcd relation between their first coefficients ``a`` and
         ``b``.
diff -up src/sage/misc/cachefunc.pyx.orig src/sage/misc/cachefunc.pyx
--- src/sage/misc/cachefunc.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/misc/cachefunc.pyx	2023-03-13 08:43:39.550431661 -0600
@@ -834,7 +834,7 @@ cdef class CachedFunction():
     ## forward other questions to the cached function.
 
     def _instancedoc_(self):
-        """
+        r"""
         Provide documentation for the cached function.
 
         A cached function shall inherit the documentation
diff -up src/sage/misc/sageinspect.py.orig src/sage/misc/sageinspect.py
--- src/sage/misc/sageinspect.py.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/misc/sageinspect.py	2023-03-13 08:43:39.551431643 -0600
@@ -948,7 +948,7 @@ def _grep_first_pair_of_parentheses(s):
 
 
 def _split_syntactical_unit(s):
-    """
+    r"""
     Split off a sub-expression from the start of a given string.
 
     INPUT:
diff -up src/sage/numerical/backends/generic_backend.pyx.orig src/sage/numerical/backends/generic_backend.pyx
--- src/sage/numerical/backends/generic_backend.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/numerical/backends/generic_backend.pyx	2023-03-13 08:43:39.552431625 -0600
@@ -1388,7 +1388,7 @@ cdef class GenericBackend:
         raise NotImplementedError()
 
     cpdef bint is_variable_basic(self, int index):
-        """
+        r"""
         Test whether the given variable is basic.
 
         This assumes that the problem has been solved with the simplex method
@@ -1418,7 +1418,7 @@ cdef class GenericBackend:
         raise NotImplementedError()
 
     cpdef bint is_variable_nonbasic_at_lower_bound(self, int index):
-        """
+        r"""
         Test whether the given variable is nonbasic at lower bound.
 
         This assumes that the problem has been solved with the simplex method
@@ -1448,7 +1448,7 @@ cdef class GenericBackend:
         raise NotImplementedError()
 
     cpdef bint is_slack_variable_basic(self, int index):
-        """
+        r"""
         Test whether the slack variable of the given row is basic.
 
         This assumes that the problem has been solved with the simplex method
@@ -1478,7 +1478,7 @@ cdef class GenericBackend:
         raise NotImplementedError()
 
     cpdef bint is_slack_variable_nonbasic_at_lower_bound(self, int index):
-        """
+        r"""
         Test whether the given variable is nonbasic at lower bound.
 
         This assumes that the problem has been solved with the simplex method
diff -up src/sage/numerical/backends/glpk_backend.pyx.orig src/sage/numerical/backends/glpk_backend.pyx
--- src/sage/numerical/backends/glpk_backend.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/numerical/backends/glpk_backend.pyx	2023-03-13 08:43:39.553431607 -0600
@@ -2316,7 +2316,7 @@ cdef class GLPKBackend(GenericBackend):
             raise ValueError("This parameter is not available.")
 
     cpdef bint is_variable_basic(self, int index):
-        """
+        r"""
         Test whether the given variable is basic.
 
         This assumes that the problem has been solved with the simplex method
@@ -2347,7 +2347,7 @@ cdef class GLPKBackend(GenericBackend):
         return self.get_col_stat(index) == GLP_BS
 
     cpdef bint is_variable_nonbasic_at_lower_bound(self, int index):
-        """
+        r"""
         Test whether the given variable is nonbasic at lower bound.
         This assumes that the problem has been solved with the simplex method
         and a basis is available.  Otherwise an exception will be raised.
@@ -2377,7 +2377,7 @@ cdef class GLPKBackend(GenericBackend):
         return self.get_col_stat(index) == GLP_NL
 
     cpdef bint is_slack_variable_basic(self, int index):
-        """
+        r"""
         Test whether the slack variable of the given row is basic.
 
         This assumes that the problem has been solved with the simplex method
@@ -2408,7 +2408,7 @@ cdef class GLPKBackend(GenericBackend):
         return self.get_row_stat(index) == GLP_BS
 
     cpdef bint is_slack_variable_nonbasic_at_lower_bound(self, int index):
-        """
+        r"""
         Test whether the slack variable of the given row is nonbasic at lower bound.
 
         This assumes that the problem has been solved with the simplex method
diff -up src/sage/numerical/backends/interactivelp_backend.pyx.orig src/sage/numerical/backends/interactivelp_backend.pyx
--- src/sage/numerical/backends/interactivelp_backend.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/numerical/backends/interactivelp_backend.pyx	2023-03-13 08:43:39.553431607 -0600
@@ -1065,7 +1065,7 @@ cdef class InteractiveLPBackend:
                                                problem_type, ring, objective_constant_term=d)
 
     cpdef bint is_variable_basic(self, int index):
-        """
+        r"""
         Test whether the given variable is basic.
 
         This assumes that the problem has been solved with the simplex method
@@ -1095,7 +1095,7 @@ cdef class InteractiveLPBackend:
         return self.lp_std_form.decision_variables()[index] in self.final_dictionary.basic_variables()
 
     cpdef bint is_variable_nonbasic_at_lower_bound(self, int index):
-        """
+        r"""
         Test whether the given variable is nonbasic at lower bound.
 
         This assumes that the problem has been solved with the simplex method
@@ -1125,7 +1125,7 @@ cdef class InteractiveLPBackend:
         return self.lp_std_form.decision_variables()[index] in self.final_dictionary.nonbasic_variables()
 
     cpdef bint is_slack_variable_basic(self, int index):
-        """
+        r"""
         Test whether the slack variable of the given row is basic.
 
         This assumes that the problem has been solved with the simplex method
@@ -1155,7 +1155,7 @@ cdef class InteractiveLPBackend:
         return self.lp_std_form.slack_variables()[index] in self.final_dictionary.basic_variables()
 
     cpdef bint is_slack_variable_nonbasic_at_lower_bound(self, int index):
-        """
+        r"""
         Test whether the given variable is nonbasic at lower bound.
 
         This assumes that the problem has been solved with the simplex method
@@ -1187,7 +1187,7 @@ cdef class InteractiveLPBackend:
     cpdef dictionary(self):
         # Proposed addition to the general interface,
         # which would for other solvers return backend dictionaries (#18804)
-        """
+        r"""
         Return a dictionary representing the current basis.
 
         EXAMPLES::
@@ -1222,7 +1222,7 @@ cdef class InteractiveLPBackend:
 
     cpdef interactive_lp_problem(self):
 
-        """
+        r"""
         Return the :class:`InteractiveLPProblem` object associated with this backend.
 
         EXAMPLES::
diff -up src/sage/rings/complex_interval.pyx.orig src/sage/rings/complex_interval.pyx
--- src/sage/rings/complex_interval.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/complex_interval.pyx	2023-03-13 08:43:39.553431607 -0600
@@ -1114,7 +1114,7 @@ cdef class ComplexIntervalFieldElement(s
         return x
 
     def __invert__(self):
-        """
+        r"""
         Return the multiplicative inverse of ``self``.
 
         EXAMPLES::
diff -up src/sage/rings/finite_rings/hom_finite_field.pyx.orig src/sage/rings/finite_rings/hom_finite_field.pyx
--- src/sage/rings/finite_rings/hom_finite_field.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/finite_rings/hom_finite_field.pyx	2023-03-13 08:43:39.554431588 -0600
@@ -147,7 +147,7 @@ cdef class SectionFiniteFieldHomomorphis
 
 
     def _repr_(self):
-        """
+        r"""
         Return a string representation of this section.
 
         EXAMPLES::
diff -up src/sage/rings/finite_rings/integer_mod.pyx.orig src/sage/rings/finite_rings/integer_mod.pyx
--- src/sage/rings/finite_rings/integer_mod.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/finite_rings/integer_mod.pyx	2023-03-13 08:43:39.555431570 -0600
@@ -2243,7 +2243,7 @@ cdef class IntegerMod_gmp(IntegerMod_abs
         return int(self.lift())
 
     def __pow__(IntegerMod_gmp self, exp, m): # NOTE: m ignored, always use modulus of parent ring
-        """
+        r"""
         EXAMPLES::
 
             sage: R = Integers(10^10)
@@ -3540,7 +3540,7 @@ cdef class IntegerMod_int64(IntegerMod_a
             return self._new_c(self.ivalue >> (-k))
 
     def __pow__(IntegerMod_int64 self, exp, m): # NOTE: m ignored, always use modulus of parent ring
-        """
+        r"""
         EXAMPLES::
 
             sage: R = Integers(10)
diff -up src/sage/rings/polynomial/multi_polynomial_libsingular.pyx.orig src/sage/rings/polynomial/multi_polynomial_libsingular.pyx
--- src/sage/rings/polynomial/multi_polynomial_libsingular.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/polynomial/multi_polynomial_libsingular.pyx	2023-03-13 08:43:44.190347338 -0600
@@ -2487,7 +2487,7 @@ cdef class MPolynomial_libsingular(MPoly
         return char_to_str(s)
 
     def _latex_(self):
-        """
+        r"""
         Return a polynomial LaTeX representation of this polynomial.
 
         EXAMPLES::
diff -up src/sage/rings/polynomial/polynomial_element.pyx.orig src/sage/rings/polynomial/polynomial_element.pyx
--- src/sage/rings/polynomial/polynomial_element.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/polynomial/polynomial_element.pyx	2023-03-13 08:43:44.194347266 -0600
@@ -6832,8 +6832,8 @@ cdef class Polynomial(CommutativeAlgebra
         where the roots `a` and `b` are to be considered in the algebraic
         closure of the fraction field of the coefficients and counted with
         multiplicities. If the polynomials are not monic this quantity is
-        multiplied by `\\alpha_1^{deg(p_2)} \\alpha_2^{deg(p_1)}` where
-        `\\alpha_1` and `\\alpha_2` are the leading coefficients of `p_1` and
+        multiplied by `\alpha_1^{deg(p_2)} \alpha_2^{deg(p_1)}` where
+        `\alpha_1` and `\alpha_2` are the leading coefficients of `p_1` and
         `p_2` respectively.
 
         INPUT:
diff -up src/sage/rings/real_double_element_gsl.pyx.orig src/sage/rings/real_double_element_gsl.pyx
--- src/sage/rings/real_double_element_gsl.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/real_double_element_gsl.pyx	2023-03-13 08:43:45.742319138 -0600
@@ -227,7 +227,7 @@ cdef class RealDoubleElement_gsl(RealDou
         return a
 
     def log(self, base=None):
-        """
+        r"""
         Return the logarithm.
 
         INPUT:
diff -up src/sage/rings/real_mpfi.pyx.orig src/sage/rings/real_mpfi.pyx
--- src/sage/rings/real_mpfi.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/real_mpfi.pyx	2023-03-13 08:43:45.743319120 -0600
@@ -1309,7 +1309,7 @@ cdef class RealIntervalFieldElement(Ring
         return self.str(10)
 
     def _latex_(self):
-        """
+        r"""
         Return a latex representation of ``self``.
 
         EXAMPLES::
diff -up src/sage/rings/tate_algebra_element.pyx.orig src/sage/rings/tate_algebra_element.pyx
--- src/sage/rings/tate_algebra_element.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/rings/tate_algebra_element.pyx	2023-03-13 08:43:46.838299224 -0600
@@ -3448,7 +3448,7 @@ cdef class TateAlgebraElement(Commutativ
 
     @coerce_binop
     def Spoly(self, other):
-        """
+        r"""
         Return the S-polynomial of this series and ``other``.
 
         INPUT:
diff -up src/sage/symbolic/expression.pyx.orig src/sage/symbolic/expression.pyx
--- src/sage/symbolic/expression.pyx.orig	2023-02-11 06:25:15.000000000 -0700
+++ src/sage/symbolic/expression.pyx	2023-03-13 08:43:46.840299188 -0600
@@ -7,7 +7,7 @@
 # distutils: include_dirs = SINGULAR_INCDIR
 # pynac/basic.h includes
 #   factory/factory.h    so this ^ is needed to find it
-"""
+r"""
 Symbolic Expressions
 
 RELATIONAL EXPRESSIONS: