Kyler Siegel Kyler Siegel

Office: 380-S, 450 Serra Mall, Stanford CA, 94305







  • A Geometric proof of a faithful linear-categorial surface mapping class group action, arXiv:1108.3676v1.

      Abstract: We give completely combinatorial proofs of the main results of [3] using polygons. Namely, we prove that the mapping class group of a surface with boundary acts faithfully on a finitely-generated linear category. Along the way we prove some foundational results regarding the relevant objects from bordered Heegaard Floer homology,

  • Stick index of knots and links in the cubic lattice, with Colin Adams, Michelle Chu, Thomas Crawford, Stephanie Jensen, and Liyang Zhang. Journal of Knot Theory and its Ramifications, Vol. 10, No. 2 (2015).

      Abstract: The cubic lattice stick index of a knot type is the least number of sticks necessary to construct the knot type in the 3-dimensional cubic lattice. We present the cubic lattice stick index of various knots and links, including all (p, p + 1)-torus knots, and show how composing and taking satellites can be used to obtain the cubic lattice stick index for a relatively large infinite class of knots. We present several bounds relating cubic lattice stick index to other known invariants. Finally, we define and consider lattice torsion index.

  • Applying Poincare's polyhedron theorem to groups of hyperbolic isometries.

      Abstract: We present a computer algorithm which confirms that an approximately discete subgroup of PSL(2,C) is in fact discrete. The algorithm proceeds by constructing the Dirichlet domain of the subgroup in H3 , and then checks that the hypotheses of Poincares Theorem for Fundametal Polyhedra are satisfied. In order to check that the hypotheses are exactly satisfied, we rely on group theoretical properties resulting from certain geometric conditions of the Dirichlet domain. We begin in Section 1 with a review of relevant background material. In Section 2 we provide a formal statement of the problem, including the restrictions we impose upon the subgroup of PSL(2,C). In Section 3 we introduce the geometric conditions which must apply for our algorithm to hold, and we prove that these are generically satisfied. We then show in Section 4 that these conditions are in fact sufficient to verify the hypotheses of Poincare's Theorem. In Section 5 we look at the field containing our matrix entries.


Last updated: September 2015