University of New Mexico
University of Missouri-St. Louis
University of Nebraska-Lincoln
Trinity University
Southeastern University - Lakeland
Grand Valley State University
Minnesota State University Moorhead
Math 115: College Algebra For Pre-Calculus,
2023
CUNY Queens College
Math 115: College Algebra For Pre-Calculus, Seth Lehman
Open Educational Resources
OER course syllabus for Math 115, College Algebra, at Queens College
Interpolation Problems And The Characterization Of The Hilbert Function,
2023
University of Arkansas, Fayetteville
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 …
A Pebbling Game On Powers Of Paths,
2023
Lehigh University
A Pebbling Game On Powers Of Paths, Garth Isaak, Matthew Prudente, Joseph M. Marcinik Iii
Communications on Number Theory and Combinatorial Theory
Two Player Graph Pebbling is an extension of graph pebbling. Players Mover and Defender use pebbling moves, the act of removing two pebbles from one vertex and placing one pebble on an adjacent vertex, to win. If a specified vertex has a pebble on it, then Mover wins. If a specified vertex is pebble-free and there are no more valid pebbling moves, then Defender wins. The Two-Player Pebbling Number of a graph G, η(G), is the minimum m such that for every arrangement of m pebbles and for any specified vertex, Mover can win. We specify the …
Asymptotic Stability Of Solitary Waves For The 1d Nls With An Attractive Delta Potential,
2023
Missouri University of Science and Technology
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,
2023
Missouri University of Science and Technology
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 …
An Algebraic Characterization Of Total Input Strictly Local Functions,
2023
Universite Jean Monnet
An Algebraic Characterization Of Total Input Strictly Local Functions, Dakotah Lambert, Jeffrey Heinz
Proceedings of the Society for Computation in Linguistics
This paper provides an algebraic characteriza- tion of the total input strictly local functions. Simultaneous, noniterative rules of the form A→B/C D, common in phonology, are defin- able as functions in this class whenever CAD represents a finite set of strings. The algebraic characterization highlights a fundamental con- nection between input strictly local functions and the simple class of definite string languages, as well as connections to string functions stud- ied in the computer science literature, the def- inite functions and local functions. No effec- tive decision procedure for the input strictly local maps was previously available, but one arises …
Parasitic Gaps In Japanese: An Mg-Based Approach,
2023
Universität Leipzig
Parasitic Gaps In Japanese: An Mg-Based Approach, Yu Tomita, Hitomi Hirayama
Proceedings of the Society for Computation in Linguistics
This paper aims to provide an account based on Minimalist Grammar (MG) for what are called parasitic gaps in Japanese, which we take as a null pronoun. The main goal of this paper is to provide a syntactic account of the environment in which a parasitic gap reading is licensed in Japanese. First, Japanese parasitic gaps are compared with English ones, illustrating the puzzle to be solved. We argue that the possibility of co-indexing between a parasitic gap (null pronoun) and wh-phrase is correlated with the point at which the wh-phrase enters the derivation. We also show that scrambling counterbleeds …
An Explicit Construction Of Sheaves In Context,
2023
The Graduate Center, City University of New York
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,
2023
The Graduate Center, City University of New York
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 E2-terms coincide with certain …
Complex-Valued Approach To Kuramoto-Like Oscillators,
2023
The University of Western Ontario
Complex-Valued Approach To Kuramoto-Like Oscillators, Jacqueline Bao Ngoc Doan
Electronic Thesis and Dissertation Repository
The Kuramoto Model (KM) is a nonlinear model widely used to model synchrony in a network of oscillators – from the synchrony of the flashing fireflies to the hand clapping in an auditorium. Recently, a modification of the KM (complex-valued KM) was introduced with an analytical solution expressed in terms of a matrix exponential, and consequentially, its eigensystem. Remarkably, the analytical KM and the original KM bear significant similarities, even with phase lag introduced, despite being determined by distinct systems. We found that this approach gives a geometric perspective of synchronization phenomena in terms of complex eigenmodes, which in turn …
Motion Planning Algorithm In A Y-Graph,
2023
Wright College, City Colleges, Chicago
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,
2023
Department of Mathematics, College of Education for Pure Sciences, University of Thi-Qar, Thi-Qar, Iraq
Δ-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,
2023
College of the Holy Cross
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,
2023
State University of New York at New Paltz
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,
2023
State University of New York at New Paltz
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,
2023
Memorial University of Newfoundland, St Johns, NL A1C 5S7, Canada
Modelling Illiquid Stocks Using Quantum Stochastic Calculus: Asymptotic Methods, Will Hicks
Journal of Stochastic Analysis
No abstract provided.
Errata: Continuous Lattices And Domains,
2023
Louisiana State University, Baton Rouge, LA 70803 USA
Errata: Continuous Lattices And Domains, Jimmie D. Lawson
Seminar on Continuity in Semilattices
No abstract provided.
Movie Recommender System Using Matrix Factorization,
2023
University of Central Florida
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,
2023
Department of Mathematics, College of Education for Pure Sciences, University of Thi-Qar, Thi-Qar, Iraq
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.,
2023
The University of Texas Rio Grande Valley
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).
