diff --git a/hadamard_order_six_fourier_v2.txt b/hadamard_order_six_fourier_v2.txt
index f0944cb..cc96437 100644
--- a/hadamard_order_six_fourier_v2.txt
+++ b/hadamard_order_six_fourier_v2.txt
@@ -1,6 +1,6 @@
 HADAMARD MATRICES OF ORDER SIX AND MUTUALLY UNBIASED BASES
 ==========================================================
-Two exact theorems, written for a curious reader
+Two exact theorems
 
 
 ABSTRACT
@@ -528,7 +528,7 @@ respective values x != 1 and y != 1. Because |S| = |U| = 3 and both
 lie in the five noninitial columns, |S cap U| = k with k in {1, 2}.
 The cubed row ratio (of the two rows of H) evaluated at each of the
 six coordinates takes the following four values with the following
-multiplicities (checking on S\U, U\S, S cap U, and the common
+multiplicities (checking on S∖U, U∖S, S cap U, and the common
 complement of S union U in {1,...,5}):
 
     value         multiplicity
@@ -942,7 +942,7 @@ Assume seven MUBs exist. Choose:
 
     - reference index r uniform on {1, ..., 7};
     - uniform coordinate permutation sigma of {0, ..., 5};
-    - uniform bijection pi from {1, ..., 6} to {1, ..., 7}\{r}.
+    - uniform bijection pi from {1, ..., 6} to {1, ..., 7}∖{r}.
 
 The reduced transition matrices are
 
@@ -1038,7 +1038,7 @@ Under assumption (M) on all transitions, the mixed moments M satisfy:
     s_j occurs only once among the factors. Let l = |S| be the number
     of distinct labels used. Then
 
-        M(s ; a) = -(1/(7-l)) sum_{t in S\{s_j}}
+        M(s ; a) = -(1/(7-l)) sum_{t in S∖{s_j}}
                        M( s[ s_j -> t ] ; a ),
 
     where s[s_j -> t] means: replace that one label s_j by t.
@@ -1205,7 +1205,7 @@ clearing denominators), and we want a rational matrix P satisfying
 
     P_{*,J} = 0,   P_{F,F} = I,   W P = 0,
 
-where J is a chosen pivot set of r columns and F = {1,...,N} \ J is
+where J is a chosen pivot set of r columns and F = {1,...,N} ∖ J is
 the complementary free set.
 
 EXACT SUBSTITUTION LEMMA. If the r x r submatrix W_J is invertible (it