Now showing items 1-7 of 7

    • Resolutions and Semidualizing Modules 

      Feickert, Aaron James (North Dakota State University, 2014)
      Projective and injective modules are of key importance in algebra, in part because of their useful homological properties. The notion of C-projective and C-injective modules generalizes these constructions. In particular, ...
    • Colorings of Zero-Divisor Graphs of Commutative Rings 

      Ramos, Rebecca Elizabeth (North Dakota State University, 2015)
      We will focus on Beck’s conjecture that the chromatic number of a zero-divisor graph of a ring R is equal to the clique number of the ring R. We begin by calculating the chromatic number of the zero-divisor graphs for some ...
    • Understanding Students’ Perceptions of Difficulty and the Effect Difficulty Has on Mathematical Anxiety 

      Larson, Caleb Bridger (North Dakota State University, 2018)
      There exists a growing atmosphere surrounding mathematics that allows individuals to exclaim their belief they are deficient in math without any societal judgement. Compared to a state like being illiterate, we have reached ...
    • Hook Formula For Skew Shapes 

      Jensen, Megan Lisa (North Dakota State University, 2019)
      The number of standard Young tableaux is given by the hook-length formula of Frame, Robinson, and Thrall. Recently, Naruse found a hook-length formula for the number of skew shaped standard Young tableaux. In a series of ...
    • Stochastic Processes, and Development of the Barndorff-Nielsen and Shephard Model for Financial Markets 

      Uden, Austin (North Dakota State University, 2022)
      In this paper, we introduce Brownian motion, and some of its drawbacks in connection to the financial modeling. We then introduce geometric Brownian motion as the basis for European call option pricing as we navigate our ...
    • Enumeration of Reduced Words of Length N for Coxeter Groups via BrinkHowlett Automaton 

      Allen, Brandon James (North Dakota State University, 2022)
      The overall goal of this paper is to give a method of computing out how many words of length n there are for any Coxeter group via its Brink-Howlett automaton. [6] [7] To build our automaton, we focus on Coxeter systems ...
    • New Perspectives on Promotion and Rowmotion: Generalizations and Translations 

      Bernstein, Joseph (North Dakota State University, 2022)
      We define P-strict labelings for a finite poset P as a generalization of semistandard Young tableaux and show that promotion on these objects is in equivariant bijection with a toggle action on B-bounded Q-partitions of ...