Mathematics Commons^™

Interpolation Problems And The Characterization Of The Hilbert Function, Bryant Xie

Mathematical Sciences Undergraduate Honors Theses

In mathematics, it is often useful to approximate the values of functions that are either too awkward and difficult to evaluate or not readily differentiable or integrable. To approximate its values, we attempt to replace such functions with more well-behaving examples such as polynomials or trigonometric functions. Over the algebraically closed field C, a polynomial passing through r distinct points with multiplicities m1, ..., mr on the affine complex line in one variable is determined by its zeros and the vanishing conditions up to its mi − 1 derivative for each point. A natural question would then be to consider …

An Explicit Construction Of Sheaves In Context, Tyler A. Bryson

Dissertations, Theses, and Capstone Projects

This document details the body of theory necessary to explicitly construct sheaves of sets on a site together with the development of supporting material necessary to connect sheaf theory with the wider mathematical contexts in which it is applied. Of particular interest is a novel presentation of the plus construction suitable for direct application to a site without first passing to the generated grothendieck topology.

Pairings In A Ring Spectrum-Based Bousfield-Kan Spectral Sequence, Jonathan Toledo

Dissertations, Theses, and Capstone Projects

Bousfield and Kan traditionally formulated their homotopy spectral sequence over a simplicial set X resolved with respect to a ring R. By considering an adequate category of ring spectra, one can take a ring spectrum E, create from it a functor of a triple on the category of simplicial sets, and build a cosimplicial simplicial set EX. The homotopy spectral sequence can then be formed over such cosimplicial spaces by a similar construction to the original. Pairings can be established on these spectral sequences, and, for nice enough spaces, these pairings on the E₂-terms coincide with certain …

Asymptotic Stability Of Solitary Waves For The 1d Nls With An Attractive Delta Potential, Satoshi Masaki, Jason Murphy, Jun Ichi Segata

Mathematics and Statistics Faculty Research & Creative Works

We Consider the One-Dimensional Nonlinear Schrödinger Equation with an Attractive Delta Potential and Mass-Supercritical Nonlinearity. This Equation Admits a One-Parameter Family of Solitary Wave Solutions in Both the Focusing and Defocusing Cases. We Establish Asymptotic Stability for All Solitary Waves Satisfying a Suitable Spectral Condition, Namely, that the Linearized Operator Around the Solitary Wave Has a Two-Dimensional Generalized Kernel and No Other Eigenvalues or Resonances. in Particular, We Extend Our Previous Result [35] Beyond the Regime of Small Solitary Waves and Extend the Results of [19, 29] from Orbital to Asymptotic Stability for a Suitable Family of Solitary Waves.

Modeling And A Domain Decomposition Method With Finite Element Discretization For Coupled Dual-Porosity Flow And Navier–Stokes Flow, Jiangyong Hou, Dan Hu, Xuejian Li, Xiaoming He

Mathematics and Statistics Faculty Research & Creative Works

In This Paper, We First Propose and Analyze a Steady State Dual-Porosity-Navier–Stokes Model, Which Describes Both Dual-Porosity Flow and Free Flow (Governed by Navier–Stokes Equation) Coupled through Four Interface Conditions, Including the Beavers–Joseph Interface Condition. Then We Propose a Domain Decomposition Method for Efficiently Solving Such a Large Complex System. Robin Boundary Conditions Are Used to Decouple the Dual-Porosity Equations from the Navier–Stokes Equations in the Coupled System. based on the Two Decoupled Sub-Problems, a Parallel Robin-Robin Domain Decomposition Method is Constructed and Then Discretized by Finite Elements. We Analyze the Convergence of the Domain Decomposition Method with the Finite …

Motion Planning Algorithm In A Y-Graph, David Baldi

Rose-Hulman Undergraduate Mathematics Journal

We present an explicit algorithm for two robots to move autonomously and without collisions on a track shaped like the letter Y. Configuration spaces are of practical relevance in designing safe control schemes for automated guided vehicles. The topological complexity of a configuration space is the minimal number of continuous instructions required to move robots between any initial configuration to any final one without collisions. Using techniques from topological robotics, we calculate the topological complexity of two robots moving on a Y-track and exhibit an optimal algorithm realizing this exact number of instructions given by the topological complexity.

Δ-Small Intersection Graphs Of Modules, Ahmed H. Alwan

Al-Bahir Journal for Engineering and Pure Sciences

Let R be a commutative ring with unit and M be a unitary left R-module. The δ-small intersection graph of non-trivial submodules of , denoted by , is an undirected simple graph whose vertices are the non-trivial submodules of , and two vertices are adjacent if and only if their intersection is a -small submodule of . In this article, we study the interplay between the algebraic properties of , and the graph properties of such as connectivity, completeness and planarity. Moreover, we determine the exact values of the diameter and girth of , as well as give a formula …

Identifiability Of Phylogenetic Models, Thomas J. Yacovone

Math & Computer Science Honors Theses

An algebraic statistical model is a parametrized family of probability distributions. Identifiability is a crucial property of a statistical model; when it holds, probability distributions in the model uniquely determine the parameters that produce them. In phylogenetics, models that are identifiable can be used to ascertain evolutionary relationships between species based on observed data, such as amino acid and DNA sequence data. However, global identifiability is a strong condition that may not always hold. A discrete parameter of a model is said to be generically identifiable if the set of probability distributions that do not uniquely determine the discrete parameter …

Gap Junctions And Synchronization Clusters In The Thalamic Reticular Nuclei, Anca R. Radulescu, Michael Anderson

Biology and Medicine Through Mathematics Conference

No abstract provided.

Computing Brain Networks With Complex Dynamics, Anca R. Radulescu

Biology and Medicine Through Mathematics Conference

No abstract provided.

Modelling Illiquid Stocks Using Quantum Stochastic Calculus: Asymptotic Methods, Will Hicks

Journal of Stochastic Analysis

No abstract provided.

Errata: Continuous Lattices And Domains, Jimmie D. Lawson

Seminar on Continuity in Semilattices

No abstract provided.

Movie Recommender System Using Matrix Factorization, Roland Fiagbe

Data Science and Data Mining

Recommendation systems are a popular and beneficial field that can help people make informed decisions automatically. This technique assists users in selecting relevant information from an overwhelming amount of available data. When it comes to movie recommendations, two common methods are collaborative filtering, which compares similarities between users, and content-based filtering, which takes a user’s specific preferences into account. However, our study focuses on the collaborative filtering approach, specifically matrix factorization. Various similarity metrics are used to identify user similarities for recommendation purposes. Our project aims to predict movie ratings for unwatched movies using the MovieLens rating dataset. We developed …

G-Coatomic Modules, Ahmed H. Alwan

Al-Bahir Journal for Engineering and Pure Sciences

Let R be a ring and M be a right R-module. A submodule of is said to be g-small in , if for every submodule , with implies that . Then is a g-small submodule of . We call g-coatomic module whenever and then . Also, is called right (left) g-coatomic ring if the right (left) -module (R) is g-coatomic. In this work, we study g-coatomic modules and ring. We investigate some properties of these modules. We prove is g-coatomic if and only if each is g-coatomic. It is proved that if is a g-semiperfect ring with , then …

Book Review Of Inside Mathforum.Org: Analysis Of An Internet Based Education Community., Jose Ponce

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

Inside Mathforum.org: Analysis of an Internet-Based Education Community, Wesley Shumar, Cambridge University Press, September 7, 2017, 1st Edition, 204 pages, ISBN: 9781108518345 (e-book).

Constructing Spanning Sets Of Affine Algebraic Curvature Tensors, Stephen J. Kelly

Rose-Hulman Undergraduate Mathematics Journal

In this paper, we construct two spanning sets for the affine algebraic curvature tensors. We then prove that every 2-dimensional affine algebraic curvature tensor can be represented by a single element from either of the two spanning sets. This paper provides a means to study affine algebraic curvature tensors in a geometric and algebraic manner similar to previous studies of canonical algebraic curvature tensors.

A Note On The Involutive Concordance Invariants For Certain (1,1)-Knots, Anna Antal, Sarah Pritchard

Rose-Hulman Undergraduate Mathematics Journal

A knot K is a smooth embedding of the circle into the three-dimensional sphere; two knots are said to be concordant if they form the boundary of an annulus properly embedded into the product of the three-sphere with an interval. Heegaard Floer knot homology is an invariant of knots introduced by P. Ozsváth and Z. Szabó in the early 2000's which associates to a knot a filtered chain complex CFK(K), which improves on classical invariants of the knot. Involutive Heegaard Floer homology is a variant theory introduced in 2015 by K. Hendricks and C. Manolescu which additionally considers a chain …

Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude

Dissertations, Theses, and Student Research Papers in Mathematics

We introduce and investigate a natural problem regarding unit cube tilings/partitions of Euclidean space and also consider broad generalizations of this problem. The problem fits well within a historical context of similar problems and also has applications to the study of reproducibility in randomized computation.

Given $k\in\mathbb{N}$ and $\epsilon\in(0,\infty)$, we define a $(k,\epsilon)$-secluded unit cube partition of $\mathbb{R}^{d}$ to be a unit cube partition of $\mathbb{R}^{d}$ such that for every point $\vec{p}\in\R^d$, the closed $\ell_{\infty}$ $\epsilon$-ball around $\vec{p}$ intersects at most $k$ cubes. The problem is to construct such partitions for each dimension $d$ with the primary goal of minimizing …

What Is A Number?, Nicholas Radley

HON499 projects

This essay is, in essence, an attempt to make a case for mathematical platonism. That is to say, that we argue for the existence of mathematical objects independent of our perception of them. The essay includes a somewhat informal construction of number systems ranging from the natural numbers to the complex numbers.

Modelling Nuclear Weapon Effects In Wargaming Using Monte Carlo Simulations, Tyler Guetzke, Alexander Withenbury, Zachary Dugger

West Point Research Papers

The United States Army’s interpretation of nuclear weapon effects needs change and modernization. Wargaming exercises are commonplace in today’s military, however, despite the growing threat of non-strategic nuclear weapons (NSNW), little has been done to inform battlefield commanders on their true effects. Our research seeks to develop a tool for commanders to easily interpret quantifiable effects of a NSNW. Utilizing Monte Carlo simulation, we are developing a new methodology to analyze NSNW effects. Our model allows a commander to calculate the expected unit strength following a NSNW strike which will aid in their operational decision making ability. The Monte Carlo …