\relax 
\providecommand\hyper@newdestlabel[2]{}
\providecommand\HyperFirstAtBeginDocument{\AtBeginDocument}
\HyperFirstAtBeginDocument{\ifx\hyper@anchor\@undefined
\global\let\oldcontentsline\contentsline
\gdef\contentsline#1#2#3#4{\oldcontentsline{#1}{#2}{#3}}
\global\let\oldnewlabel\newlabel
\gdef\newlabel#1#2{\newlabelxx{#1}#2}
\gdef\newlabelxx#1#2#3#4#5#6{\oldnewlabel{#1}{{#2}{#3}}}
\AtEndDocument{\ifx\hyper@anchor\@undefined
\let\contentsline\oldcontentsline
\let\newlabel\oldnewlabel
\fi}
\fi}
\global\let\hyper@last\relax 
\gdef\HyperFirstAtBeginDocument#1{#1}
\providecommand*\HyPL@Entry[1]{}
\citation{JiPropp}
\HyPL@Entry{0<</S/D>>}
\@writefile{toc}{\contentsline {section}{\numberline {1}Planted Brussels Sprouts and factorizations of the long cycle}{1}{section.1}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.1}Planted Brussels Sprouts}{1}{subsection.1.1}}
\citation{goulden2002tree}
\@writefile{lof}{\contentsline {figure}{\numberline {1}{\ignorespaces A game of Planted Brussels Sprouts for $n+1=5$. The corresponding sequence of stripped labels is $(13)(35)(12)(34)$.}}{2}{figure.1}}
\newlabel{fig:game}{{1}{2}{A game of Planted Brussels Sprouts for $n+1=5$. The corresponding sequence of stripped labels is $(13)(35)(12)(34)$}{figure.1}{}}
\newlabel{fig:game@cref}{{[figure][1][]1}{2}}
\@writefile{lof}{\contentsline {figure}{\numberline {2}{\ignorespaces Visualizing the factorization $(12345)=(13)(35)(12)(34)$. In accordance with\nobreakspace  {}\Cref  {thm:gouldenyong}, reading the labels of the edges incident to the vertex 3 clockwise gives the decreasing sequence 4,2,1.}}{2}{figure.2}}
\newlabel{fig:fact}{{2}{2}{Visualizing the factorization $(12345)=(13)(35)(12)(34)$. In accordance with~\Cref {thm:gouldenyong}, reading the labels of the edges incident to the vertex 3 clockwise gives the decreasing sequence 4,2,1}{figure.2}{}}
\newlabel{fig:fact@cref}{{[figure][2][]2}{2}}
\@writefile{toc}{\contentsline {subsection}{\numberline {1.2}Factorizations of the long cycle}{2}{subsection.1.2}}
\@writefile{loe}{\contentsline {theorem}{\numberline {1}Theorem\thmtformatoptarg {\cite  [Theorem 2.2]{goulden2002tree}}}{2}{theorem.1}}
\newlabel{thm:gouldenyong}{{1}{3}{\cite [Theorem 2.2]{goulden2002tree}}{theorem.1}{}}
\newlabel{thm:gouldenyong@cref}{{[theorem][1][]1}{3}}
\@writefile{toc}{\contentsline {section}{\numberline {2}Recursion, counting, and bijection}{3}{section.2}}
\newlabel{eq:recurrencep}{{2}{3}{Recursion, counting, and bijection}{equation.2.2}{}}
\newlabel{eq:recurrencep@cref}{{[equation][2][]2}{3}}
\@writefile{loe}{\contentsline {example}{\numberline {2}Example}{3}{example.2}}
\citation{JiPropp}
\citation{deligne1974letter}
\citation{reading2008chains}
\citation{reading2008chains}
\citation{JiPropp}
\@writefile{loe}{\contentsline {proposition}{\numberline {3}Proposition\thmtformatoptarg {\cite  [Theorem 3]{JiPropp}}}{4}{proposition.3}}
\newlabel{prop:count}{{3}{4}{\cite [Theorem 3]{JiPropp}}{proposition.3}{}}
\newlabel{prop:count@cref}{{[proposition][3][]3}{4}}
\newlabel{eq:rec}{{3}{4}{Recursion, counting, and bijection}{equation.2.3}{}}
\newlabel{eq:rec@cref}{{[equation][3][]3}{4}}
\@writefile{loe}{\contentsline {proposition}{\numberline {4}Proposition\thmtformatoptarg {\cite  [Theorem 5]{JiPropp}}}{4}{proposition.4}}
\newlabel{thm:main}{{4}{4}{\cite [Theorem 5]{JiPropp}}{proposition.4}{}}
\newlabel{thm:main@cref}{{[proposition][4][]4}{4}}
\citation{JiPropp}
\citation{goulden2002tree}
\citation{JiPropp}
\citation{stanley1997parking}
\citation{JiPropp}
\@writefile{toc}{\contentsline {section}{\numberline {3}Corollaries}{5}{section.3}}
\@writefile{loe}{\contentsline {corollary}{\numberline {5}Corollary\thmtformatoptarg {\cite  [Theorem 1]{JiPropp}}}{5}{corollary.5}}
\@writefile{loe}{\contentsline {corollary}{\numberline {6}Corollary\thmtformatoptarg {\cite  [Theorem 4]{JiPropp}}}{5}{corollary.6}}
\newlabel{cor:park}{{6}{5}{\cite [Theorem 4]{JiPropp}}{corollary.6}{}}
\newlabel{cor:park@cref}{{[corollary][6][]6}{5}}
\citation{eidswick1989short}
\citation{deutsch2002diagonally}
\citation{deutsch2002statistics}
\citation{noy1998enumeration}
\citation{panholzer2002bijections}
\citation{deligne1974letter}
\@writefile{lof}{\contentsline {figure}{\numberline {3}{\ignorespaces An illustration of\nobreakspace  {}\Cref  {thm:main} (compare with\nobreakspace  {}\Cref  {fig:game}). The top line is the modified game of Planted Brussels Sprouts, which replaces the transverse line segments with topologically equivalent boundary segments. The bottom line is the inverse bijection.}}{6}{figure.3}}
\newlabel{fig:bij}{{3}{6}{An illustration of~\Cref {thm:main} (compare with~\Cref {fig:game}). The top line is the modified game of Planted Brussels Sprouts, which replaces the transverse line segments with topologically equivalent boundary segments. The bottom line is the inverse bijection}{figure.3}{}}
\newlabel{fig:bij@cref}{{[figure][3][]3}{6}}
\@writefile{loe}{\contentsline {corollary}{\numberline {7}Corollary\thmtformatoptarg {\cite  [Theorem 2]{JiPropp}}}{6}{corollary.7}}
\newlabel{cor:commute}{{7}{6}{\cite [Theorem 2]{JiPropp}}{corollary.7}{}}
\newlabel{cor:commute@cref}{{[corollary][7][]7}{6}}
\@writefile{toc}{\contentsline {section}{\numberline {4}Factorizations of Coxeter elements}{6}{section.4}}
\newlabel{sec:history}{{4}{6}{Factorizations of Coxeter elements}{section.4}{}}
\newlabel{sec:history@cref}{{[section][4][]4}{6}}
\citation{reading2008chains}
\citation{chapuy2014counting}
\citation{michel2014case}
\@writefile{lof}{\contentsline {figure}{\numberline {4}{\ignorespaces Ignoring the labels in a visualization of a factorization of the long cycle gives factorizations \emph  {up to commutation}---for example, the unlabelled factorization on the left could have come from any of the three factorizations $(13)(35)(12)(34)$, $(13)(12)(35)(34)$, or $(13)(35)(34)(12)$.}}{7}{figure.4}}
\newlabel{fig:commutation}{{4}{7}{Ignoring the labels in a visualization of a factorization of the long cycle gives factorizations \emph {up to commutation}---for example, the unlabelled factorization on the left could have come from any of the three factorizations $(13)(35)(12)(34)$, $(13)(12)(35)(34)$, or $(13)(35)(34)(12)$}{figure.4}{}}
\newlabel{fig:commutation@cref}{{[figure][4][]4}{7}}
\newlabel{eq:fact}{{4}{7}{Factorizations of Coxeter elements}{equation.4.4}{}}
\newlabel{eq:fact@cref}{{[equation][4][]4}{7}}
\@writefile{toc}{\contentsline {section}{\numberline {5}Centrally symmetric Brussels Sprouts}{7}{section.5}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.1}Centrally symmetric Brussels Sprouts}{8}{subsection.5.1}}
\@writefile{lof}{\contentsline {figure}{\numberline {5}{\ignorespaces A game of Centrally Symmetric Planted Brussels Sprouts for $n=3$. The corresponding sequence of stripped labels is $(\tmspace  -\thinmuskip {.1667em}(12)\tmspace  -\thinmuskip {.1667em})(\tmspace  -\thinmuskip {.1667em}(2\overline  {3})\tmspace  -\thinmuskip {.1667em})(2\overline  {2})$.}}{8}{figure.5}}
\newlabel{fig:typebgame}{{5}{8}{A game of Centrally Symmetric Planted Brussels Sprouts for $n=3$. The corresponding sequence of stripped labels is $(\!(12)\!)(\!(2\overline {3})\!)(2\overline {2})$}{figure.5}{}}
\newlabel{fig:typebgame@cref}{{[figure][5][]5}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.2}Factorizations of a Coxeter element}{8}{subsection.5.2}}
\newlabel{sec:typebfact}{{5.2}{8}{Factorizations of a Coxeter element}{subsection.5.2}{}}
\newlabel{sec:typebfact@cref}{{[subsection][2][5]5.2}{8}}
\@writefile{toc}{\contentsline {subsection}{\numberline {5.3}Bijection and corollaries}{8}{subsection.5.3}}
\citation{deligne1974letter}
\citation{reading2008chains}
\citation{obaid2013number}
\@writefile{lof}{\contentsline {figure}{\numberline {6}{\ignorespaces Visualizing the factorization $(123\overline  {123})=(\tmspace  -\thinmuskip {.1667em}(12)\tmspace  -\thinmuskip {.1667em})(\tmspace  -\thinmuskip {.1667em}(2\overline  {3})\tmspace  -\thinmuskip {.1667em})(2\overline  {2})$.}}{9}{figure.6}}
\newlabel{fig:typebfact}{{6}{9}{Visualizing the factorization $(123\overline {123})=(\!(12)\!)(\!(2\overline {3})\!)(2\overline {2})$}{figure.6}{}}
\newlabel{fig:typebfact@cref}{{[figure][6][]6}{9}}
\@writefile{loe}{\contentsline {corollary}{\numberline {8}Corollary}{9}{corollary.8}}
\@writefile{loe}{\contentsline {proposition}{\numberline {9}Proposition\thmtformatoptarg {\cite  {deligne1974letter,reading2008chains}}}{9}{proposition.9}}
\newlabel{eq:hurw}{{5}{9}{Bijection and corollaries}{equation.5.5}{}}
\newlabel{eq:hurw@cref}{{[equation][5][]5}{9}}
\citation{biane2002parking}
\citation{biane2002parking}
\citation{guo2011cyclic}
\citation{chapoton}
\citation{guo2011cyclic}
\citation{reiner2004cyclic}
\@writefile{loe}{\contentsline {corollary}{\numberline {10}Corollary\thmtformatoptarg {\cite  [Theorem 3.2]{biane2002parking}}}{10}{corollary.10}}
\@writefile{loe}{\contentsline {corollary}{\numberline {11}Corollary\thmtformatoptarg {\cite  [Theorem 1]{guo2011cyclic}}}{10}{corollary.11}}
\bibcite{biane2002parking}{1}
\bibcite{chapoton}{2}
\bibcite{chapuy2014counting}{3}
\bibcite{deligne1974letter}{4}
\bibcite{deutsch2002diagonally}{5}
\bibcite{deutsch2002statistics}{6}
\bibcite{eidswick1989short}{7}
\bibcite{goulden2002tree}{8}
\bibcite{guo2011cyclic}{9}
\bibcite{JiPropp}{10}
\bibcite{michel2014case}{11}
\bibcite{noy1998enumeration}{12}
\bibcite{obaid2013number}{13}
\bibcite{panholzer2002bijections}{14}
\bibcite{reading2008chains}{15}
\bibcite{reiner2004cyclic}{16}
\bibcite{stanley1997parking}{17}