Browsing CERCA by Author "Davis, Christopher"

Now showing items 1-9 of 9

    • Bayesian Inferential Statistics Implemented in R 

      Davis, Christopher; McQuestion, Jack (2017-12-11)
      Conventional frequentist statistics taught in undergraduate courses are obviously better than nothing, yet suffer from systematic failures that allow for easy p-hacking and consistent over-estimation of significance and ...

    • Can Computers Weave a More Perfect Web? 

      Davis, Christopher; Otto, Carolyn; Wellnitz, Todd; Leitzke, Taren J.; Billman, Kayla D.M.; Reukema, Sarah E. (2017-11-16)
      We designed a rule-based computer model that used genetic algorithms to create spider webs that closely matched those found in nature. We recreated the classic, 2-dimensional orb web, which is typical of Araneus spiders ...

    • Colored Triple Linking Number 

      Gallagher, Ryan; Olerich, Ethan (2022-04)
      In an important work, Cimasoni and Florens introduced the notion of a colored link (literally a link whose components have been grouped together by colors). These allow one to define new link invariants by treating components ...

    • Distinguishing Colored Links 

      Roth, Grant (2014-04)
      A colored link is a link where all of the components are colored. The purpose of this study was to determine whether changing the color changes the link, and how much information is gained by changing the colors of the ...

    • Higher Order Invariants via Quandles 

      Odegaard, Grace; Stickney, Benjamin; Vaughan, Michael; Yim, Kee Shen; Davis, Christopher (2018-05)
      The goal of this poster is to discuss a relationship between quandle theoretic invariants of links, linking number and a higher order analogue of linking number, called the triple linking number. More precisely, we present ...

    • Minimal Complexity C-complexes for Colored Links 

      Roth, Grant (2015-04)
      In this project, we study the analogous measure of complexity given by a generalization of a surface called a C-complex.

    • Minimal Complexity of C-Complexes 

      Amundsen, Jonah; Guyer, Daniel; Anderson, Eric; Davis, Christopher (2019-05)
      In knot theory, a link is a disjoint union of circles (i.e. components) in 3-dimensional space. A goal of knot theory is to measure the interaction between the various components of a link. One measure of the complexity of ...

    • On the Indeterminacy of the Triple Linking Number 

      Amundsen, Jonah; Anderson, Eric; Davis, Christopher (2019-05)
      In the 1950’s Milnor defined a new family of tools of link theory generalizing the classical linking number. When the classical linking numbers vanish, the first of these new invariants μ123(L) gives new interesting ...

    • When Do Links Admit Homeomorphic C-complexes? 

      Roth, Grant; Davis, Christopher (2017-04-07)
      The goal of this poster is to ask when the same is true of C-complexes. Given two links L and J, when do there exist C-complexes F and G for these links which are topologically equivalent? To what extent is the homeomorphism ...