Mathematics Commons™

All Articles in Mathematics

11788 full-text articles. Page 1 of 319.

Elimination For Systems Of Algebraic Differential Equations, 2017 The Graduate Center, City University of New York

Elimination For Systems Of Algebraic Differential Equations, Richard Gustavson

All Graduate Works by Year: Dissertations, Theses, and Capstone Projects

We develop new upper bounds for several effective differential elimination techniques for systems of algebraic ordinary and partial differential equations. Differential elimination, also known as decoupling, is the process of eliminating a fixed subset of unknown functions from a system of differential equations in order to obtain differential algebraic consequences of the original system that do not depend on that fixed subset of unknowns. A special case of differential elimination, which we study extensively, is the question of consistency, that is, if the given system of differential equations has a solution. We first look solely at the algebraic data" of ...

2017 The Graduate Center, City University of New York

Diophantine Approximation And The Atypical Numbers Of Nathanson And O'Bryant, David Seff

All Graduate Works by Year: Dissertations, Theses, and Capstone Projects

For any positive real number $\theta > 1$, and any natural number $n$, it is obvious that sequence $\theta^{1/n}$ goes to 1. Nathanson and O'Bryant studied the details of this convergence and discovered some truly amazing properties. One critical discovery is that for almost all $n$, $\displaystyle\floor{\frac{1}{\fp{\theta^{1/n}}}}$ is equal to $\displaystyle\floor{\frac{n}{\log\theta}-\frac{1}{2}}$, the exceptions, when $n > \log_2 \theta$, being termed atypical $n$ (the set of which for fixed $\theta$ being named $\mcA_\theta$), and that for $\log\theta$ rational, the number of atypical \$n ...

The Recognition Problem For Table Algebras And Reality-Based Algebras, 2017 University of Regina

The Recognition Problem For Table Algebras And Reality-Based Algebras, Allen Herman, Mikhail Muzychuk, Bangteng Xu

EKU Faculty and Staff Scholarship

Given a finite-dimensional noncommutative semisimple algebra A over C with involution, we show that A always has a basis B for which ( A , B ) is a reality-based algebra. For algebras that have a one-dimensional representation δ , we show that there always exists an RBA-basis for which δ is a positive degree map. We characterize all RBA-bases of the 5-dimensional noncommutative semisimple algebra for which the algebra has a positive degree map, and give examples of RBA-bases of C ⊕ M n ( C ) for which the RBA has a positive degree map, for all n ≥ 2

2017 University of Leeds

On The Analysis Of The Sir Epidemic Model For Small Networks: An Application In Hospital Settings, Martin Lopez-Garcia

Biology and Medicine Through Mathematics Conference

No abstract provided.

2017 State University of New York at New Paltz

Balanced Excitation And Inhibition Shapes The Dynamics Of A Neuronal Network For Movement And Reward, Anca R. Radulescu

Biology and Medicine Through Mathematics Conference

No abstract provided.

Roman Domination In Complementary Prisms, 2017 East Tennessee State University

Roman Domination In Complementary Prisms, Alawi I. Alhashim

Electronic Theses and Dissertations

The complementary prism GG of a graph G is formed from the disjoint union of G and its complement G by adding the edges of a perfect match- ing between the corresponding vertices of G and G. A Roman dominating function on a graph G = (V,E) is a labeling f : V(G) → {0,1,2} such that every vertex with label 0 is adjacent to a vertex with label 2. The Roman domination number γR(G) of G is the minimum f(V ) = Σv∈V f(v) over all such functions of G. We study the Roman domination number ...

Mathematical Evolution, 2017 Butler University

Mathematical Evolution, Jeremiah Farrell, William Johnston

Scholarship and Professional Work - LAS

Crossword puzzle featured in the May 2017 issue of American Mathematical Monthly.

Languages, Geodesics, And Hnn Extensions, 2017 University of Nebraska-Lincoln

Languages, Geodesics, And Hnn Extensions, Maranda Franke

Dissertations, Theses, and Student Research Papers in Mathematics

The complexity of a geodesic language has connections to algebraic properties of the group. Gilman, Hermiller, Holt, and Rees show that a finitely generated group is virtually free if and only if its geodesic language is locally excluding for some finite inverse-closed generating set. The existence of such a correspondence and the result of Hermiller, Holt, and Rees that finitely generated abelian groups have piecewise excluding geodesic language for all finite inverse-closed generating sets motivated our work. We show that a finitely generated group with piecewise excluding geodesic language need not be abelian and give a class of infinite non-abelian ...

Peptide Identification: Refining A Bayesian Stochastic Model, 2017 East Tennessee State University

Peptide Identification: Refining A Bayesian Stochastic Model, Theophilus Barnabas Kobina Acquah

Electronic Theses and Dissertations

Notwithstanding the challenges associated with different methods of peptide identification, other methods have been explored over the years. The complexity, size and computational challenges of peptide-based data sets calls for more intrusion into this sphere. By relying on the prior information about the average relative abundances of bond cleavages and the prior probability of any specific amino acid sequence, we refine an already developed Bayesian approach in identifying peptides. The likelihood function is improved by adding additional ions to the model and its size is driven by two overall goodness of fit measures. In the face of the complexities associated ...

Application Of Symplectic Integration On A Dynamical System, 2017 East Tennessee State University

Application Of Symplectic Integration On A Dynamical System, William Frazier

Electronic Theses and Dissertations

Molecular Dynamics (MD) is the numerical simulation of a large system of interacting molecules, and one of the key components of a MD simulation is the numerical estimation of the solutions to a system of nonlinear differential equations. Such systems are very sensitive to discretization and round-off error, and correspondingly, standard techniques such as Runge-Kutta methods can lead to poor results. However, MD systems are conservative, which means that we can use Hamiltonian mechanics and symplectic transformations (also known as canonical transformations) in analyzing and approximating solutions. This is standard in MD applications, leading to numerical techniques known as symplectic ...

2017 East Tennessee State University

Differentiating Between A Protein And Its Decoy Using Nested Graph Models And Weighted Graph Theoretical Invariants, Hannah E. Green

Electronic Theses and Dissertations

To determine the function of a protein, we must know its 3-dimensional structure, which can be difficult to ascertain. Currently, predictive models are used to determine the structure of a protein from its sequence, but these models do not always predict the correct structure. To this end we use a nested graph model along with weighted invariants to minimize the errors and improve the accuracy of a predictive model to determine if we have the correct structure for a protein.

2017 University of Southern Mississippi

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 T-Restricted Optimal Rubbling Of Graphs, 2017 East Tennessee State University

On T-Restricted Optimal Rubbling Of Graphs, Kyle Murphy

Electronic Theses and Dissertations

For a graph G = (V;E), a pebble distribution is defined as a mapping of the vertex set in to the integers, where each vertex begins with f(v) pebbles. A pebbling move takes two pebbles from some vertex adjacent to v and places one pebble on v. A rubbling move takes one pebble from each of two vertices that are adjacent to v and places one pebble on v. A vertex x is reachable under a pebbling distribution f if there exists some sequence of rubbling and pebbling moves that places a pebble on x. A pebbling distribution where ...

"Returning To The Root" Of The Problem: Improving The Social Condition Of African Americans Through Science And Mathematics Education, 2017 Florida A&M University

"Returning To The Root" Of The Problem: Improving The Social Condition Of African Americans Through Science And Mathematics Education, Vanessa R. Pitts Bannister, Julius Davis, Jomo Mutegi, Latasha Thompson, Deborah Lewis

Catalyst: A Social Justice Forum

The underachievement and underrepresentation of African Americans in STEM (Science, Technology, Engineering and Mathematics) disciplines have been well documented. Efforts to improve the STEM education of African Americans continue to focus on relationships between teaching and learning and factors such as culture, race, power, class, learning preferences, cultural styles and language. Although this body of literature is deemed valuable, it fails to help STEM teacher educators and teachers critically assess other important factors such as pedagogy and curriculum. In this article, the authors argue that both pedagogy and curriculum should be centered on the social condition of African Americans – thus ...

Does Logic Help Us Beat Monty Hall?, 2017 Cedarville University

Does Logic Help Us Beat Monty Hall?, Adam J. Hammett, Nathan A. Harold, Tucker R. Rhodes

The Research and Scholarship Symposium

The classical Monty Hall problem entails that a hypothetical game show contestant be presented three doors and told that behind one door is a car and behind the other two are far less appealing prizes, like goats. The contestant then picks a door, and the host (Monty) is to open a different door which contains one of the bad prizes. At this point in the game, the contestant is given the option of keeping the door she chose or changing her selection to the remaining door (since one has already been opened by Monty), after which Monty opens the chosen ...

Models Of Nation-Building Via Systems Of Differential Equations, 2017 Cedarville University

Models Of Nation-Building Via Systems Of Differential Equations, Carissa F. Slone, Darryl K. Ahner, Mark E. Oxley, William P. Baker

The Research and Scholarship Symposium

Nation-building modeling is an important field of research given the increasing number of candidate nations and the limited resources available. A modeling methodology and a system of differential equations model are presented to investigate the dynamics of nation-building. The methodology is based upon parameter identification techniques applied to a system of differential equations, to evaluate nation-building operations. Data from Operation Iraqi Freedom (OIF) and Afghanistan are used to demonstrate the validity of different models as well as the comparison of models.

Six Septembers: Mathematics For The Humanist, 2017 Duquesne University

Six Septembers: Mathematics For The Humanist, Patrick Juola, Stephen Ramsay

Zea E-Books

Scholars of all stripes are turning their attention to materials that represent enormous opportunities for the future of humanistic inquiry. The purpose of this book is to impart the concepts that underlie the mathematics they are likely to encounter and to unfold the notation in a way that removes that particular barrier completely. This book is a primer for developing the skills to enable humanist scholars to address complicated technical material with confidence. This book, to put it plainly, is concerned with the things that the author of a technical article knows, but isn’t saying. Like any field, mathematics ...

Harnack Inequalities: From Poincare Conjecture To Matrix Determinant, 2017 Nova Southeastern University

Harnack Inequalities: From Poincare Conjecture To Matrix Determinant, Fuzhen (Frank) Zhang

Mathematics Colloquium Series

With a brief survey on the Harnack inequalities in various forms in Functional Analysis, in Partial Differential Equations, and in Perelman’s solution of the Poincare Conjecture, we discuss the Harnack inequality in Linear Algebra and Matrix Analysis. We present an extension of Tung’s inequality of Harnack type and study the equality case.

A Game Of Monovariants On A Checkerboard, 2017 Lynchburg College

A Game Of Monovariants On A Checkerboard, Linwood Reynolds

Student Scholar Showcase

Abstract: Assume there is a game that takes place on a 20x20 checkerboard in which each of the 400 squares are filled with either a penny, nickel, dime, or quarter. The coins are placed randomly onto the squares, and there are to be 100 of each of the coins on the board. To begin the game, 59 coins are removed at random. The goal of the game is to remove each remaining coin from the board according to the following rules: 1. A penny can only be removed if all 4 adjacent squares are empty. That is, a penny cannot ...

A Nonexpert Introduction To Rational Homotopy Theory, 2017 University of Colorado, Boulder