Allison Henrich

A SEQUENCE OF DEGREE ONE VASSILIEV INVARIANTS FOR VIRTUAL KNOTS

For ordinary knots in R3, there are no degree one Vassiliev invariants. For virtual knots, however, the space of degree one Vassiliev invariants is infinite-dimensional. We introduce a sequence of three degree one Vassiliev invariants of virtual knots of increasing strength. We demonstrate that the strongest invariant is a universal Vassiliev invariant of degree one for virtual knots in the sense that any other degree one Vassiliev invariant can be recovered from it by a certain natural construction. To prove these results, we extend the based matrix invariant introduced by Turaev for virtual strings to the class of singular flat virtual knots with one double-point.

CLASSICAL AND VIRTUAL PSEUDODIAGRAM THEORY AND NEW BOUNDS ON UNKNOTTING NUMBERS AND GENUS

A pseudodiagram is a diagram of a knot with some crossing information missing. We review and expand the theory of pseudodiagrams introduced by Hanaki. We then extend this theory to the realm of virtual knots, a generalization of knots. In particular, we analyze the trivializing number of a pseudodiagram, i.e. the minimum number of crossings that must be resolved to produce the unknot. We consider how much crossing information is needed in a virtual pseudodiagram to identify a non-trivial knot, a classical knot, or a non-classical knot. We then apply pseudodiagram theory to develop new upper bounds on unknotting number, virtual unknotting number, and genus.

THE THEORY OF PSEUDOKNOTS

Classical knots in ℝ3 can be represented by diagrams in the plane. These diagrams are formed by curves with a finite number of transverse crossings, where each crossing is decorated to indicate which strand of the knot passes over at that point. A pseudodiagram is a knot diagram that may be missing crossing information at some of its crossings. At these crossings, it is undetermined which strand passes over. Pseudodiagrams were first introduced by Ryo Hanaki in 2010. Here, we introduce the notion of a pseudoknot, i.e. an equivalence class of pseudodiagrams under an appropriate choice of Reidemeister moves. In order to begin a classification of pseudoknots, we introduce the concept of a weighted resolution set, or WeRe-set, an invariant of pseudoknots. We compute the WeRe-set for several pseudoknot families and discuss extensions of crossing number, homotopy, and chirality for pseudoknots.

On the coloring of pseudoknots

Pseudodiagrams are diagrams of knots where some information about which strand goes over/under at certain crossings may be missing. Pseudoknots are equivalence classes of pseudodiagrams, with equivalence defined by a class of Reidemeister-type moves. In this paper, we introduce two natural extensions of classical knot colorability to this broader class of knot-like objects. We use these definitions to define the determinant of a pseudoknot (i.e. the pseudodeterminant) that agrees with the classical determinant for classical knots. Moreover, we extend Conway notation to pseudoknots to facilitate the investigation of families of pseudoknots and links. The general formulae for pseudodeterminants of pseudoknot families may then be used as a criterion for p-colorability of pseudoknots.

Polynomial knot and link invariants from the virtual biquandle

The Alexander biquandle of a virtual knot or link is a module over a 2-variable Laurent polynomial ring which is an invariant of virtual knots and links. The elementary ideals of this module are then invariants of virtual isotopy which determine both the generalized Alexander polynomial (also known as the Sawollek polynomial) for virtual knots and the classical Alexander polynomial for classical knots. For a fixed monomial ordering <, the Grobner bases for these ideals are computable, comparable invariants which fully determine the elementary ideals and which generalize and unify the classical and generalized Alexander polynomials. We provide examples to illustrate the usefulness of these invariants and propose questions for future work.

Reducing Math Anxiety: Findings from Incorporating Service Learning into a Quantitative Reasoning Course at Seattle University

How might one teach mathematics to math-anxious students and at the same time reduce their math anxiety? This paper describes what we found when we incorporated a service learning component into a quantitative reasoning course at Seattle University in Fall 2010 (20 students) and Spring 2011 (28 students). The course is taken primarily by humanities majors, many of whom would not take a course in math if they didn’t need to satisfy the university’s core requirement. For the service learning component, each student met with and tutored children at local schools for 1-2 hours per week (total about 15 service hours), kept a weekly journal reflecting on the experience, and wrote a five-page final paper on the importance and reasonable expectations of mathematics literacy. The autobiographies, self-description at the beginning of the class, focus group interviews at the end of the term, journal entries, final essays, and student evaluations indicated that the students gained confidence in their mathematical abilities, a greater interest in mathematics, and a broader sense of the importance of math literacy in modern society. One notable finding was that students discovered that the act of manufacturing enthusiasm about math as a tool for tutoring the children made them more enthusiastic about math in their own courses.

Semiquandles and flat virtual knots

We introduce an algebraic structure we call semiquandles whose axioms are derived from flat Reidemeister moves. Finite semiquandles have associated counting invariants and enhanced invariants defined for flat virtual knots and links. We also introduce singular semiquandles and virtual singular semiquandles which define invariants of flat singular virtual knots and links. As an application, we use semiquandle invariants to compare two Vassiliev invariants.

A Midsummer Knot's Dream.

Summary We introduce playing games on the shadows of knots and demonstrate two novel games, namely, “To Knot or Not to Knot” and “Much Ado about Knotting.” We discuss winning strategies for these games on certain families of knot shadows and go on to suggest variations of these games for further study.

Isotopy and homotopy invariants of classical and virtual pseudoknots

Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we introduce a Gauss-diagrammatic theory for pseudoknots which gives rise to the notion of a virtual pseudoknot. We provide new, easily computable isotopy and homotopy invariants for classical and virtual pseudodiagrams. We also give tables of unknotting numbers for homotopically trivial pseudoknots and homotopy classes of homotopically nontrivial pseudoknots. Since pseudoknots are closely related to singular knots, this work also has implications for the classification of classical and virtual singular knots.

The signed weighted resolution set is not a complete pseudoknot invariant

When the signed weighted resolution set was defined as an invariant of pseudoknots, it was unknown whether this invariant was complete. Using the Gauss-diagrammatic invariants of pseudoknots introduced by Dorais et al, we show that the signed were-set cannot distinguish all non-equivalent pseudoknots. This goal is achieved through studying the effects of a flype-like local move on a pseudodiagram.