Other Mathematics Commons^™

Can Addressing Language Skills For Fifth Grade Ells In A Multiplication Curriculum Help Address The Achievement Gap In Math? A Multiplication Workbook For Big Kids, Michelle Douglas

Master's Projects and Capstones

Currently, the state of California has 1,332,405 students from grades k-12 who speak a language other than English at home (Caledfacts, 2016). When I started my first year teaching fifth grade with 95% of my students being English language learners (ELLs), I was surprised to see an achievement gap of two to three years in my student’s reading and math skills. I found that my student’s developmental language and math skills contributed to a lack of engagement during math time. Upon further research, I found that these three factors play a role in the wide achievement gaps between ELLs and …

The Calculus War: The Ultimate Clash Of Genius, Walker Briles Bussey-Spencer

Chancellor’s Honors Program Projects

No abstract provided.

Making Models With Bayes, Pilar Olid

Electronic Theses, Projects, and Dissertations

Bayesian statistics is an important approach to modern statistical analyses. It allows us to use our prior knowledge of the unknown parameters to construct a model for our data set. The foundation of Bayesian analysis is Bayes' Rule, which in its proportional form indicates that the posterior is proportional to the prior times the likelihood. We will demonstrate how we can apply Bayesian statistical techniques to fit a linear regression model and a hierarchical linear regression model to a data set. We will show how to apply different distributions to Bayesian analyses and how the use of a prior affects …

Splittings Of Relatively Hyperbolic Groups And Classifications Of 1-Dimensional Boundaries, Matthew Haulmark

Theses and Dissertations

In the first part of this dissertation, we show that the existence of non-parabolic local cut point in the relative (or Bowditch) boundary, $\relbndry$, of a relatively hyperbolic group $(\Gamma,\bbp)$ implies that $\Gamma$ splits over a $2$-ended subgroup. As a consequence we classify the homeomorphism type of the Bowditch boundary for the special case when the Bowditch boundary $\relbndry$ is one-dimensional and has no global cut points.

In the second part of this dissertation, We study local cut points in the boundary of CAT(0) groups with isolated flats. In particular the relationship between local cut points in $\bndry X$ and …

Efficiently Representing The Integer Factorization Problem Using Binary Decision Diagrams, David Skidmore

All Graduate Plan B and other Reports, Spring 1920 to Spring 2023

Let p be a prime positive integer and let α be a positive integer greater than 1. A method is given to reduce the problem of finding a nontrivial factorization of α to the problem of finding a solution to a system of modulo p polynomial congruences where each variable in the system is constrained to the set {0,...,p − 1}. In the case that p = 2 it is shown that each polynomial in the system can be represented by an ordered binary decision diagram with size less than 20.25log₂(α)³ + 16.5log₂(α)² + …

Π-Operators In Clifford Analysis And Its Applications, Wanqing Cheng

Graduate Theses and Dissertations

In this dissertation, we studies Π-operators in different spaces using Clifford algebras. This approach generalizes the Π-operator theory on the complex plane to higher dimensional spaces. It also allows us to investigate the existence of the solutions to Beltrami equations in different spaces.

Motivated by the form of the Π-operator on the complex plane, we first construct a Π-operator on a general Clifford-Hilbert module. It is shown that this operator is an L^2 isometry. Further, this can also be used for solving certain Beltrami equations when the Hilbert space is the L^2 space of a measure space. This idea is …

Cayley Graphs Of Groups And Their Applications, Anna Tripi

MSU Graduate Theses

Cayley graphs are graphs associated to a group and a set of generators for that group (there is also an associated directed graph). The purpose of this study was to examine multiple examples of Cayley graphs through group theory, graph theory, and applications. We gave background material on groups and graphs and gave numerous examples of Cayley graphs and digraphs. This helped investigate the conjecture that the Cayley graph of any group (except Z_2) is hamiltonian. We found the conjecture to still be open. We found Cayley graphs and hamiltonian cycles could be applied to campanology (in particular, to the …

Dependence Structures In Lévy-Type Markov Processes, Eddie Brendan Tu

Doctoral Dissertations

In this dissertation, we examine the positive and negative dependence of infinitely divisible distributions and Lévy-type Markov processes. Examples of infinitely divisible distributions include Poissonian distributions like compound Poisson and α-stable distributions. Examples of Lévy-type Markov processes include Lévy processes and Feller processes, which include a class of jump-diffusions, certain stochastic differential equations with Lévy noise, and subordinated Markov processes. Other examples of Lévy-type Markov processes are time-inhomogeneous Feller evolution systems (FES), which include additive processes. We will provide a tour of various forms of positive dependence, which include association, positive supermodular association (PSA), positive supermodular dependence (PSD), and positive …

Residuated Maps, The Way-Below Relation, And Contractions On Probabilistic Metric Spaces., M. Ryan Luke

Electronic Theses and Dissertations

In this dissertation, we will examine residuated mappings on a function lattice and how they behave with respect to the way-below relation. In particular, which residuated $\phi$ has the property that $F$ is way-below $\phi(F)$ for $F$ in appropriate sets. We show the way-below relation describes the separation of two functions and how this corresponds to contraction mappings on probabilistic metric spaces. A new definition for contractions is considered using the way-below relation.

Extending Difference Of Votes Rules On Three Voting Models., Sarah Schulz King

Electronic Theses and Dissertations

In a voting situation where there are only two competing alternatives, simple majority rule outputs the alternatives with the most votes or declares a tie if both alternatives receive the same number of votes. For any non-negative integer k, the difference of votes rule M_k outputs the alternative that beats the competing alternative by more than k votes. Llamazares (2006) gives a characterization of the difference of votes rules in terms of five axioms. In this thesis, we extend Llamazares' result by completely describing the class of voting rules that satisfy only two out of his five axioms. …

Vertex Weighted Spectral Clustering, Mohammad Masum

Electronic Theses and Dissertations

Spectral clustering is often used to partition a data set into a specified number of clusters. Both the unweighted and the vertex-weighted approaches use eigenvectors of the Laplacian matrix of a graph. Our focus is on using vertex-weighted methods to refine clustering of observations. An eigenvector corresponding with the second smallest eigenvalue of the Laplacian matrix of a graph is called a Fiedler vector. Coefficients of a Fiedler vector are used to partition vertices of a given graph into two clusters. A vertex of a graph is classified as unassociated if the Fiedler coefficient of the vertex is close to …

The Loewner Equation And Weierstrass' Function, Gavin Ainsley Glenn

Chancellor’s Honors Program Projects

No abstract provided.

Krylov Subspace Spectral Methods For Pdes In Polar And Cylindrical Geometries, Megan Richardson

Dissertations

As a result of stiff systems of ODEs, difficulties arise when using time stepping methods for PDEs. Krylov subspace spectral (KSS) methods get around the difficulties caused by stiffness by computing each component of the solution independently. In this dissertation, we extend the KSS method to a circular domain using polar coordinates. In addition to using these coordinates, we will approximate the solution using Legendre polynomials instead of Fourier basis functions. We will also compare KSS methods on a time-independent PDE to other iterative methods. Then we will shift our focus to three families of orthogonal polynomials on the interval …

On Some One-Complex Dimensional Slices Of The Boundedness Locus Of A Multi-Parameter Rational Family, Matthew Hoeppner

Theses and Dissertations

Complex dynamics involves the study of the behavior of complex-valued functions when they are composed with themselves repeatedly. We observe the orbits of a function by passing starting values through the function iteratively. Of particular interest are the orbits of any critical points of the function, called critical orbits. The behavior of a family of functions can be determined by examining the change in the critical orbit(s) of the functions as the values of the associated parameters vary. These behaviors are often separated into two categories: parameter values where one or more critical orbits remain bounded, and parameter values where …

Cocompact Cubulations Of Mixed 3-Manifolds, Joseph Dixon Tidmore

Theses and Dissertations

In this dissertation, we complete the classification of which compact 3-manifolds have a virtually compact special fundamental group by addressing the case of mixed 3-manifolds. A compact aspherical 3-manifold M is mixed if its JSJ decomposition has at least one JSJ torus and at least one hyperbolic block. We show the fundamental group of M is virtually compact special iff M is chargeless, i.e. each interior Seifert fibered block has a trivial Euler number relative to the fibers of adjacent blocks.

Asymptotic Expansion Of The L^2-Norm Of A Solution Of The Strongly Damped Wave Equation, Joseph Silvio Barrera

Theses and Dissertations

The Fourier transform, F, on R^N (N≥1) transforms the Cauchy problem for the strongly damped wave equation u_tt(t,x) - Δu_t(t,x) - Δu(t,x) = 0 to an ordinary differential equation in time t. We let u(t,x) be the solution of the problem given by the Fourier transform, and v(t,ƺ) be the asymptotic profile of F(u)(t,ƺ) = û(t,ƺ) found by Ikehata in [4].

In this thesis we study the asymptotic expansions of the squared L^2-norms of u(t,x), û(t,ƺ) - v(t,ƺ), and v(t,ƺ) as t → ∞. With suitable initial data u(0,x) and u_t(0,x), we establish the rate of growth or decay of …

Student-Created Test Sheets, Samuel Laderach

Honors Projects

Assessment plays a necessary role in the high school mathematics classroom, and testing is a major part of assessment. Students often struggle with mathematics tests and examinations due to math and test anxiety, a lack of student learning, and insufficient and inefficient student preparation. Practice tests, teacher-created review sheets, and student-created test sheets are ways in which teachers can help increase student performance, while ridding these detrimental factors. Student-created test sheets appear to be the most efficient strategy, and this research study examines the effects of their use in a high school mathematics classroom.

Sum-Defined Colorings In Graphs, James Hallas

Honors Theses

There have been numerous studies using a variety of methods for the purpose of uniquely distinguishing every two adjacent vertices of a graph. Many of these methods have involved graph colorings. The most studied colorings are proper colorings. A proper coloring of a graph G is an assignment of colors to the vertices of G such that adjacent vertices are assigned distinct colors. The minimum number of colors required in a proper coloring of G is the chromatic number of G. In our work, we introduce a new coloring that induces a (nearly) proper coloring. Two vertices u and …

Sensitivity Analysis Of Wolf Restoration In Yellowstone Nation Park Using Omnivory Models, Derek Fields

Theses, Dissertations and Capstones

In the ever-changing world of ecology, species survival often depends on approximations and measurements taken by biologists. These approximations help to ensure and predict the future of that given species. Our ecological community of interest involves wolves, elk, and berry producing shrubs within Yellowstone National Park. We use two different systems of ordinary differential equations, each increasing in complexity to model our community. In each model the predator (wolves) and consumers (elk) compete for a common resource, berry producing shrubs. We call this consumption of resources, from more than one trophic level, omnivory. We approximate each system with parameter values …

Neural Network Predictions Of A Simulation-Based Statistical And Graph Theoretic Study Of The Board Game Risk, Jacob Munson

Murray State Theses and Dissertations

We translate the RISK board into a graph which undergoes updates as the game advances. The dissection of the game into a network model in discrete time is a novel approach to examining RISK. A review of the existing statistical findings of skirmishes in RISK is provided. The graphical changes are accompanied by an examination of the statistical properties of RISK. The game is modeled as a discrete time dynamic network graph, with the various features of the game modeled as properties of the network at a given time. As the network is computationally intensive to implement, results are produced …

An Improved Imaging Method For Extended Targets, Sui Zhang

Doctoral Dissertations

The dissertation presents an improved method for the inverse scattering problem to obtain better numerical results. There are two main methods for solving the inverse problem: the direct imaging method and the iterative method. For the direct imaging method, we introduce the MUSIC (MUltiple SIgnal Classification) algorithm, the multi-tone method and the linear sampling method with different boundary conditions in different cases, which are the smooth case, the one corner case, and the multiple corners case. The dissertation introduces the relations between the far field data and the near field data.

When we use direct imaging methods for solving inverse …

Emergence And Complexity In Music, Zoe Tucker

HMC Senior Theses

How can we apply mathematical notions of complexity and emergence to music, and how can these mathematical ideas then inspire new musical works? Using Steve Reich's Clapping Music as a starting point, we look for emergent patterns in music by considering cases where a piece's complexity is significantly different from the total complexity of each of the individual parts. Definitions of complexity inspired by information theory, data compression, and musical practice are considered. We also consider the number of distinct musical pieces that could be composed in the same manner as Clapping Music. Finally, we present a new musical …

Sudoku Variants On The Torus, Kira A. Wyld

HMC Senior Theses

This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.

The Document Similarity Network: A Novel Technique For Visualizing Relationships In Text Corpora, Dylan Baker

HMC Senior Theses

With the abundance of written information available online, it is useful to be able to automatically synthesize and extract meaningful information from text corpora. We present a unique method for visualizing relationships between documents in a text corpus. By using Latent Dirichlet Allocation to extract topics from the corpus, we create a graph whose nodes represent individual documents and whose edge weights indicate the distance between topic distributions in documents. These edge lengths are then scaled using multidimensional scaling techniques, such that more similar documents are clustered together. Applying this method to several datasets, we demonstrate that these graphs are …

Combinatorial Polynomial Hirsch Conjecture, Sam Miller

HMC Senior Theses

The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …

Triple Non-Negative Matrix Factorization Technique For Sentiment Analysis And Topic Modeling, Alexander A. Waggoner

CMC Senior Theses

Topic modeling refers to the process of algorithmically sorting documents into categories based on some common relationship between the documents. This common relationship between the documents is considered the “topic” of the documents. Sentiment analysis refers to the process of algorithmically sorting a document into a positive or negative category depending whether this document expresses a positive or negative opinion on its respective topic. In this paper, I consider the open problem of document classification into a topic category, as well as a sentiment category. This has a direct application to the retail industry where companies may want to scour …

Optimization Methods For Tabular Data Protection, Iryna Petrenko

Electronic Theses and Dissertations

In this thesis we consider a minimum distance Controlled Tabular Adjustment (CTA) model for statistical disclosure limitation (control) of tabular data. The goal of the CTA model is to find the closest safe table to some original tabular data set that contains sensitive information. The measure of closeness is usually measured using l₁ or l₂ norm; with each measure having its advantages and disadvantages. According to the given norm CTA can be formulated as an optimization problem: Liner Programing (LP) for l₁, Quadratic Programing (QP) for l₂. In this thesis we present an alternative …