diff --git a/docs/release-notes/v0.0.27.md b/docs/release-notes/v0.0.27.md
index fdd6713a3..14aee768a 100644
--- a/docs/release-notes/v0.0.27.md
+++ b/docs/release-notes/v0.0.27.md
@@ -32,7 +32,7 @@
     GF([127, 191,  69,  35, 221, 242, 193, 108,  72, 102,  80, 163,  13,  74,
         218, 159, 207,  12, 159, 129,  92,  71], order=3^5)
     ```
-- Implemented the Cooley-Tukey radix-2 `O(N*log(N))` algorithm for the NTT and JIT compiled it. ([#333](https://github.com/mhostetter/galois/pull/333))
+- Implemented the Cooley-Tukey radix-2 $O(N\ \textrm{log}(N))$ algorithm for the NTT and JIT compiled it. ([#333](https://github.com/mhostetter/galois/pull/333))
     ```ipython
     In [2]: x = list(range(1, 1024 + 1))
 
diff --git a/docs/release-notes/v0.0.28.md b/docs/release-notes/v0.0.28.md
index 8446ec3cc..9220cf89b 100644
--- a/docs/release-notes/v0.0.28.md
+++ b/docs/release-notes/v0.0.28.md
@@ -7,7 +7,7 @@
 - Modified JIT-compiled functions to use explicit calculation *or* lookup tables. Previously, JIT functions only used explicit
   calculation routines. Now all ufuncs and functions are JIT-compiled once on first invocation, but use the current `ufunc_mode` to
   determine the arithmetic used. This provides a significant performance boost for fields which use lookup tables by default. The
-  greatest performance improvement can be seen in `GF(p^m)` fields. ([#354](https://github.com/mhostetter/galois/pull/354))
+  greatest performance improvement can be seen in $\mathrm{GF}(p^m)$ fields. ([#354](https://github.com/mhostetter/galois/pull/354))
   - Polynomial multiplication is **210% faster**.
     ```ipython
     In [2]: GF = galois.GF(7**5)
diff --git a/docs/release-notes/v0.0.29.md b/docs/release-notes/v0.0.29.md
index 174c6c37b..a70e23006 100644
--- a/docs/release-notes/v0.0.29.md
+++ b/docs/release-notes/v0.0.29.md
@@ -35,7 +35,7 @@
 - Added `galois.printoptions()` context manager to modify printing options inside of a `with` statement. This is the equivalent of `np.printoptions()`. ([#363](https://github.com/mhostetter/galois/pull/363))
 - Added a separate `Poly.factors()` method, in addition to the polymorphic `galois.factors()`. ([#362](https://github.com/mhostetter/galois/pull/362))
 - Added a separate `Poly.is_square_free()` method, in addition to the polymorphic `galois.is_square_free()`. This is a method, not property, to indicate it is a computationally-expensive operation. ([#362](https://github.com/mhostetter/galois/pull/362))
-- Fixed a bug (believed to be introduced in v0.0.26) where `Poly.degree` occasionally returned `np.int64` instead of `int`. This could cause overflow in certain large integer operations (e.g., computing `q**m` when determining if a degree-`m` polynomial over `GF(q)` is irreducible). When the integer overflowed, this created erroneous results. ([#360](https://github.com/mhostetter/galois/issues/360), [#361](https://github.com/mhostetter/galois/pull/361))
+- Fixed a bug (believed to be introduced in v0.0.26) where `Poly.degree` occasionally returned `np.int64` instead of `int`. This could cause overflow in certain large integer operations (e.g., computing $q^m$ when determining if a degree-$m$ polynomial over $\mathrm{GF}(q)$ is irreducible). When the integer overflowed, this created erroneous results. ([#360](https://github.com/mhostetter/galois/issues/360), [#361](https://github.com/mhostetter/galois/pull/361))
 - Increased code coverage.
 
 ## Contributors