X-Git-Url: https://bilbo.iut-bm.univ-fcomte.fr/and/gitweb/16dcc.git/blobdiff_plain/e944a6e5c1d0ba117954365dfedad16f183cf681..3147e770da18dc984025737bc802ba0e0bff6977:/hamilton.tex

diff --git a/hamilton.tex b/hamilton.tex
index 17d9380..dc19f08 100644
--- a/hamilton.tex
+++ b/hamilton.tex
@@ -23,7 +23,7 @@ $\mathsf{N}$ cube.
 Obviously, the number of iterations $b$ has to be sufficiently large 
 to provide a uniform output distribution.
 To reduce the number of iterations, the provided Gray code
-should ideally possess the both balanced and locally balanced properties.
+should ideally possess both balanced and locally balanced properties.
 However, none of the two algorithms is compatible with the second one:
 balanced Gray codes that are generated by state of the art works~\cite{ZanSup04,DBLP:journals/combinatorics/BhatS96} are not locally balanced. Conversely,
 locally balanced Gray codes yielded by Igor Bykov approach~\cite{Bykov2016}
@@ -328,3 +328,9 @@ Notice that all such choices lead to a hamiltonian path.
 
 
 
+%%% Local Variables:
+%%% mode: latex
+%%% TeX-master: "main"
+%%% ispell-dictionary: "american"
+%%% mode: flyspell
+%%% End: