\BOOKMARK [1][-]{section.1}{Introduction}{}% 1
\BOOKMARK [1][-]{section.2}{Background}{}% 2
\BOOKMARK [2][-]{subsection.2.1}{The subshift and tiling space}{section.2}% 3
\BOOKMARK [1][-]{section.3}{Combinatorics and geometry}{}% 4
\BOOKMARK [2][-]{subsection.3.1}{Substitution matrices and their properties}{section.3}% 5
\BOOKMARK [2][-]{subsection.3.2}{Enumerating n-letter words}{section.3}% 6
\BOOKMARK [2][-]{subsection.3.3}{Barge-Diamond and Anderson-Putnam complexes}{section.3}% 7
\BOOKMARK [2][-]{subsection.3.4}{Recognizability}{section.3}% 8
\BOOKMARK [1][-]{section.4}{Cohomology of tiling spaces}{}% 9
\BOOKMARK [2][-]{subsection.4.1}{Via Barge-Diamond}{section.4}% 10
\BOOKMARK [2][-]{subsection.4.2}{Via Anderson-Putnam}{section.4}% 11
\BOOKMARK [2][-]{subsection.4.3}{Via properization}{section.4}% 12
\BOOKMARK [1][-]{section.5}{Pisot substitutions}{}% 13
\BOOKMARK [2][-]{subsection.5.1}{Computational search for counterexamples}{section.5}% 14
\BOOKMARK [1][-]{section.6}{Supplementary resources}{}% 15
\BOOKMARK [1][-]{section.7}{Acknowledgments}{}% 16