%PDF-1.4 % 1 0 obj << /S /GoTo /D (10section.1) >> endobj 4 0 obj (1. Introduction) endobj 5 0 obj << /S /GoTo /D (10section.7) >> endobj 8 0 obj (2. Counting minimally intersecting filling pairs) endobj 9 0 obj << /S /GoTo /D (10subsection.9) >> endobj 12 0 obj (2.1. Filling permutations) endobj 13 0 obj << /S /GoTo /D (10subsection.14) >> endobj 16 0 obj (2.2. Proof of the lower bound) endobj 17 0 obj << /S /GoTo /D (10subsection.36) >> endobj 20 0 obj (2.3. Proof of the upper bound) endobj 21 0 obj << /S /GoTo /D (10subsection.38) >> endobj 24 0 obj (2.4. Genus 2) endobj 25 0 obj << /S /GoTo /D (10section.46) >> endobj 28 0 obj (3. Minimally intersecting filling pairs as combinatorial optimizers) endobj 29 0 obj << /S /GoTo /D (10section.51) >> endobj 32 0 obj (4. Minimal length filling pairs on hyperbolic surfaces) endobj 33 0 obj << /S /GoTo /D (10section*.62) >> endobj 36 0 obj (References) endobj 37 0 obj << /S /GoTo /D [38 0 R /FitBH] >> endobj 44 0 obj << /Length 2865 /Filter /FlateDecode >> stream xZ[۶~?BOj7;}p&㦶t<