replace $...$ with ...

src/sage/groups/perm_gps/permgroup.py

@@ -1773,9 +1773,9 @@ def base(self, seed=None):
         r"""
         Return a (minimum) base of this permutation group.
 
-        A base $B$ of a permutation group is a subset of the domain
+        A base `B` of a permutation group is a subset of the domain
         of the group such that the only group element stabilizing all
-        of $B$ is the identity.
+        of `B` is the identity.
 
         INPUT:
 
@@ -2250,7 +2250,7 @@ def socle(self):
         r"""
         Return the socle of ``self``.
 
-        The socle of a group $G$ is the subgroup generated by all
+        The socle of a group `G` is the subgroup generated by all
         minimal normal subgroups.
 
         EXAMPLES::
@@ -2267,7 +2267,7 @@ def frattini_subgroup(self):
         r"""
         Return the Frattini subgroup of ``self``.
 
-        The Frattini subgroup of a group $G$ is the intersection of all maximal
+        The Frattini subgroup of a group `G` is the intersection of all maximal
         subgroups of `G`.
 
         EXAMPLES::
@@ -2286,7 +2286,7 @@ def fitting_subgroup(self):
         r"""
         Return the Fitting subgroup of ``self``.
 
-        The Fitting subgroup of a group $G$ is the largest nilpotent normal
+        The Fitting subgroup of a group `G` is the largest nilpotent normal
         subgroup of `G`.
 
         EXAMPLES::
@@ -2305,8 +2305,8 @@ def solvable_radical(self):
         r"""
         Return the solvable radical of ``self``.
 
-        The solvable radical (or just radical) of a group $G$ is the
-        largest solvable normal subgroup of $G$.
+        The solvable radical (or just radical) of a group `G` is the
+        largest solvable normal subgroup of `G`.
 
         EXAMPLES::
 
@@ -2632,9 +2632,9 @@ def semidirect_product(self, N, mapping, check=True):
 
         Perhaps the most common example of a semidirect product comes
         from the family of dihedral groups. Each dihedral group is the
-        semidirect product of $C_2$ with $C_n$, where, by convention,
-        $3 \leq n$. In this case, the nontrivial element of $C_2$ acts
-        on $C_n$ so as to send each element to its inverse. ::
+        semidirect product of `C_2` with `C_n`, where, by convention,
+        `3 \leq n`. In this case, the nontrivial element of `C_2` acts
+        on `C_n` so as to send each element to its inverse. ::
 
             sage: C2 = CyclicPermutationGroup(2)
             sage: C8 = CyclicPermutationGroup(8)
@@ -2648,8 +2648,8 @@ def semidirect_product(self, N, mapping, check=True):
             ((3,4,5,6,7,8,9,10), (1,2)(4,10)(5,9)(6,8))
 
         A more complicated example can be drawn from [TW1980]_.
-        It is there given that a semidirect product of $D_4$ and $C_3$
-        is isomorphic to one of $C_2$ and the dicyclic group of order
+        It is there given that a semidirect product of `D_4` and `C_3`
+        is isomorphic to one of `C_2` and the dicyclic group of order
         12. This nonabelian group of order 24 has very similar
         structure to the dicyclic and dihedral groups of order 24, the
         three being the only groups of order 24 with a two-element
@@ -3018,14 +3018,14 @@ def commutator(self, other=None):
 
         OUTPUT:
 
-        Let $G$ denote ``self``.  If ``other`` is ``None`` then this method
-        returns the subgroup of $G$ generated by the set of commutators,
+        Let `G` denote ``self``.  If ``other`` is ``None`` then this method
+        returns the subgroup of `G` generated by the set of commutators,
 
         .. MATH::
 
             \{[g_1,g_2]\vert g_1, g_2\in G\} = \{g_1^{-1}g_2^{-1}g_1g_2\vert g_1, g_2\in G\}
 
-        Let $H$ denote ``other``, in the case that it is not ``None``.  Then
+        Let `H` denote ``other``, in the case that it is not ``None``.  Then
         this method returns the group generated by the set of commutators,
 
         .. MATH::
@@ -4295,7 +4295,7 @@ def is_transitive(self, domain=None):
         r"""
         Return ``True`` if ``self`` acts transitively on ``domain``.
 
-        A group $G$ acts transitively on set $S$ if for all `x,y\in S`
+        A group `G` acts transitively on set `S` if for all `x,y\in S`
         there is some `g\in G` such that `x^g=y`.
 
         EXAMPLES::
@@ -4345,11 +4345,11 @@ def is_primitive(self, domain=None):
         r"""
         Return ``True`` if ``self`` acts primitively on ``domain``.
 
-        A group $G$ acts primitively on a set $S$ if
+        A group `G` acts primitively on a set `S` if
 
-        1. $G$ acts transitively on $S$ and
+        1. `G` acts transitively on `S` and
 
-        2. the action induces no non-trivial block system on $S$.
+        2. the action induces no non-trivial block system on `S`.
 
         INPUT:
 
@@ -4395,8 +4395,8 @@ def is_semi_regular(self, domain=None):
         r"""
         Return ``True`` if ``self`` acts semi-regularly on ``domain``.
 
-        A group $G$ acts semi-regularly on a set $S$ if the point
-        stabilizers of $S$ in $G$ are trivial.
+        A group `G` acts semi-regularly on a set `S` if the point
+        stabilizers of `S` in `G` are trivial.
 
         ``domain`` is optional and may take several forms. See examples.
 
@@ -4428,10 +4428,10 @@ def is_regular(self, domain=None):
         r"""
         Return ``True`` if ``self`` acts regularly on ``domain``.
 
-        A group $G$ acts regularly on a set $S$ if
+        A group `G` acts regularly on a set `S` if
 
-        1. $G$ acts transitively on $S$ and
-        2. $G$ acts semi-regularly on $S$.
+        1. `G` acts transitively on `S` and
+        2. `G` acts semi-regularly on `S`.
 
         EXAMPLES::