Update README.md

README.md

@@ -16,9 +16,9 @@ representations are themselves uniquely determined by the value of the trace, \\
 where \\(g\\) ranges over subsets of \\(G\\) called conjugacy classes. These values are called *characters*. 
 
 The representation theory of symmetric groups has rich combinatorial interpretations. Both 
-irreducible representations of \\(S\_n\\) and the conjugacy classes of \\(S\_n\\) are indexed by 
-partitions of \\(n\\) and thus the characters of irreducible representations of \\(S\_n\\) are indexed
-by pairs of partitions of \\(n\\). For \\(\lambda,\mu \vdash n\\) we write \\(\chi^\lambda\_\mu\\) for the 
+irreducible representations of \\(S_n\\) and the conjugacy classes of \\(S_n\\) are indexed by 
+partitions of \\(n\\) and thus the characters of irreducible representations of \\(S_n\\) are indexed
+by pairs of partitions of \\(n\\). For \\(\lambda,\mu \vdash n\\) we write \\(\chi^\lambda_\mu\\) for the 
 associated character. This combinatorial connection is not superficial, some of the most famous 
 algorithms for computation of irreducible characters (e.g., the 
 [Murnaghan-Nakayama rule](https://en.wikipedia.org/wiki/Murnaghan–Nakayama_rule)) are completely