diff --git a/theory-minimizer_selection.md b/theory-minimizer_selection.md
index 87f5500..06fda08 100644
--- a/theory-minimizer_selection.md
+++ b/theory-minimizer_selection.md
@@ -46,6 +46,8 @@ The choice of $s$ is not arbitrary. Low-complexity m-mers (homopolymers, short t
 | 13 | 33759044 | `GAAATACTTCACA` | 13 |
 | 15 | 29869313 | `AACTACTTACCAAAC` | 15 |
 
+If the minimum period length is found to be $m$ as observed in the above table, then the sequence is aperiodic, as no shorter period can be identified.
+
 ## Partition routing is independent of minimizer selection
 
 The hash used to select a minimizer within a window (the minimum of several hash values) and the hash used to route a super-kmer to a storage partition are computed separately: