Physical Sciences and Mathematics Commons^™

Fractions Of Numerical Semigroups, Harold Justin Smith

Doctoral Dissertations

Let S and T be numerical semigroups and let k be a positive integer. We say that S is the quotient of T by k if an integer x belongs to S if and only if kx belongs to T. Given any integer k larger than 1 (resp., larger than 2), every numerical semigroup S is the quotient T/k of infinitely many symmetric (resp., pseudo-symmetric) numerical semigroups T by k. Related examples, probabilistic results, and applications to ring theory are shown.

Given an arbitrary positive integer k, it is not true in general that every numerical semigroup S is the …

Discrete Fractional Calculus And Its Applications To Tumor Growth, Sevgi Sengul

Masters Theses & Specialist Projects

Almost every theory of mathematics has its discrete counterpart that makes it conceptually easier to understand and practically easier to use in the modeling process of real world problems. For instance, one can take the "difference" of any function, from 1st order up to the n-th order with discrete calculus. However, it is also possible to extend this theory by means of discrete fractional calculus and make n- any real number such that the ½-th order difference is well defined. This thesis is comprised of five chapters that demonstrate some basic definitions and properties of discrete fractional calculus …

An Algorithm To Generate Two-Dimensional Drawings Of Conway Algebraic Knots, Jen-Fu Tung

Masters Theses & Specialist Projects

The problem of finding an efficient algorithm to create a two-dimensional embedding of a knot diagram is not an easy one. Typically, knots with a large number of crossings will not nicely generate two-dimensional drawings. This thesis presents an efficient algorithm to generate a knot and to create a nice two-dimensional embedding of the knot. For the purpose of this thesis a drawing is “nice” if the number of tangles in the diagram consisting of half-twists is minimal. More specifically, the algorithm generates prime, alternating Conway algebraic knots in O(n) time where n is the number of crossings …

A Criterion For Identifying Stressors In Non-Linear Equations Using Gröbner Bases, Elisabeth Marie Palchak

Honors Theses

No abstract provided.

Carleson-Type Inequalitites In Harmonically Weighted Dirichlet Spaces, Gerardo Roman Chacon Perez

Doctoral Dissertations

Carleson measures for Harmonically Weighted Dirichlet Spaces are characterized. It is shown a version of a maximal inequality for these spaces. Also, Interpolating Sequences and Closed-Range Composition Operators are studied in this context.

On The Irreducibility Of The Cauchy-Mirimanoff Polynomials, Brian C. Irick

Doctoral Dissertations

The Cauchy-Mirimanoff Polynomials are a class of polynomials that naturally arise in various classical studies of Fermat's Last Theorem. Originally conjectured to be irreducible over 100 years ago, the irreducibility of the Cauchy-Mirimanoff polynomials is still an open conjecture.

This dissertation takes a new approach to the study of the Cauchy-Mirimanoff Polynomials. The reciprocal transform of a self-reciprocal polynomial is defined, and the reciprocal transforms of the Cauchy-Mirimanoff Polynomials are found and studied. Particular attention is given to the Cauchy-Mirimanoff Polynomials with index three times a power of a prime, and it is shown that the Cauchy-Mirimanoff Polynomials of index …

Computational Circle Packing: Geometry And Discrete Analytic Function Theory, Gerald Lee Orick

Doctoral Dissertations

Geometric Circle Packings are of interest not only for their aesthetic appeal but also their relation to discrete analytic function theory. This thesis presents new computational methods which enable additional practical applications for circle packing geometry along with providing a new discrete analytic interpretation of the classical Schwarzian derivative and traditional univalence criterion of classical analytic function theory. To this end I present a new method of computing the maximal packing and solving the circle packing layout problem for a simplicial 2-complex along with additional geometric variants and applications. This thesis also presents a geometric discrete Schwarzian quantity whose value …

The Origins Of Mathematical Societies And Journals, Eric S. Savage

Masters Theses

We investigate the origins of mathematical societies and journals. We argue that the origins of today’s professional societies and journals have their roots in the informal gatherings of mathematicians in 17th century Italy, France, and England. The small gatherings in these nations began as academies and after gaining government recognition and support, they became the ancestors of the professional societies that exist today. We provide a brief background on the influences of the Renaissance and Reformation before discussing the formation of mathematical academies in each country.

Analyzing Fractals, Kara Mesznik

Renée Crown University Honors Thesis Projects - All

For my capstone project, I analyzed fractals. A fractal is a picture that is composed of smaller images of the larger picture. Each smaller picture is self- similar, meaning that each of these smaller pictures is actually the larger image just contracted in size through the use of the Contraction Mapping Theorem and shifted using linear and affine transformations.

Fractals live in something called a metric space. A metric space, denoted (X, d), is a space along with a distance formula used to measure the distance between elements in the space. When producing fractals …

On The Numerical Range And Spectrum Of The Weighted Shift Operator In [Iota]², Gina-Louise Santamaria

Theses, Dissertations and Culminating Projects

In this paper, we examine the weighted shift operator in l² as described in Yoo & Rho [15], which is an example of what is known as a hyponormal weighted shift. Using the methods of Tam [13], in conjuction with properties of the weighted shift, we determine the numerical range of Yoo &; Rho’s unilateral weighted shift operator.

It is well-established that the spectrum of a bounded linear operator is always included in the closure of the numerical range. In particular, for a bounded linear operator, the point and compression spectra are contained within the numerical range itself [7]. …

A Mathematical Model Of The Biofluidmechanics Of The Non-Newtonian Mucus Layer Of The Tear Film In The Human Eye, Douglas M. Platt

Theses, Dissertations and Culminating Projects

The human eye is a complicated and delicate organ. The structure of the eye is such that it provides for clear vision of the world. The cornea and conjunctiva at the front of the eye are avascular structures that require nutrients and moisture to be provided by the tear film. The tear film also provides for the removal of debris from the surface of the eye. The tear film has several layers: a lipid layer, an aqueous solution, and mucus. The optical clarity and structural uniformity of the tear film is maintained by the blinking motion of the eyelid. During …

Using Matrix Pencils To Solve Discrete Sturm-Liouville Problems With Nonlinear Boundary Conditions, Michael Kofi Wilson

Theses, Dissertations and Culminating Projects

This thesis deals with discrete second order Sturm-Liouville Boundary Value Problems (DSLBVP) where the parameter as part of the Sturm-Liouville difference equation appears nonlinearly in the boundary conditions. We focus on analyzing the case with cubic nonlinearity in the boundary condition. First, we describe the problem by a matrix equation with nonlinear variables such that solving the DSLBVP is equivalent to solving the matrix equation. Second, we formulate the problem as a nonlinear eigenvalue problem. We further reduce the problem to finding eigenvalues of a matrix pencil in the form A - X B . Under certain conditions, such a …

Pre-Service Teachers’ Knowledge Of Algebraic Thinking And The Characteristics Of The Questions Posed For Students, Leigh A. Van Den Kieboom, Marta Magiera, John Moyer

Mathematics, Statistics and Computer Science Faculty Research and Publications

In this study, we explored the relationship between the strength of pre-service teachers’ algebraic thinking and the characteristics of the questions they posed during cognitive interviews that focused on probing the algebraic thinking of middle school students. We developed a performance rubric to evaluate the strength of pre-service teachers’ algebraic thinking across 130 algebra-based tasks. We used an existing coding scheme found in the literature to analyze the characteristics of the questions pre-service teachers posed during clinical interviews. We found that pre-service teachers with higher algebraic thinking abilities were able to pose probing questions that uncovered student thinking through the …

Pre-Service Middle School Teachers’ Knowledge Of Algebraic Thinking, Marta Magiera, John Moyer, Leigh A. Van Den Kieboom

Mathematics, Statistics and Computer Science Faculty Research and Publications

In this study we examined the relationship between 18 pre-service middle school teachers’ own ability to use algebraic thinking to solve problems and their ability to recognize and interpret the algebraic thinking of middle school students. We assessed the pre-service teachers’ own algebraic thinking by examining their solutions and explanations to multiple algebra-based tasks posed during a semester-long mathematics content course. We assessed their ability to recognize and interpret the algebraic thinking of students in two ways. The first was by analyzing the preservice teachers’ ability to interpret students’ written solutions to open-ended algebra-based tasks. The second was by analyzing …

Projections And Idempotents With Fixed Diagonal And The Homotopy Problem For Unit Tight Frames, Julien Giol, Leonid V. Kovalev, David Larson, Nga Nguyen, James E. Tener

Mathematics - All Scholarship

We investigate the topological and metric structure of the set of idempotent operators and projections which have prescribed diagonal entries with respect to a fixed orthonormal basis of a Hilbert space. As an application, we settle some cases of conjectures of Larson, Dykema, and Strawn on the connectedness of the set of unit-norm tight frames.

Bifurcations Of Traveling Wave Solutions For An Integrable Equation, Jibin Li, Zhijun Qiao

School of Mathematical and Statistical Sciences Faculty Publications and Presentations

This paper deals with the following equation mt= 1/2 1/mk xxx− 1/2 1/mk x, which is proposed by Z. J. Qiao J. Math. Phys. 48, 082701 2007 and Qiao and Liu Chaos, Solitons Fractals 41, 587 2009. By adopting the phase analysis method of planar dynamical systems and the theory of the singular traveling wave systems to the traveling wave solutions of the equation, it is shown that for different k, the equation may have infinitely many solitary wave solutions, periodic wave solutions, kink/antikink wave solutions, cusped solitary wave solutions, and breaking loop solutions. We discuss in a detail the …

Memristics: Memristors, Again? – Part Ii, How To Transform Wired ‘Translations’ Between Crossbars Into Interactions?, Rudolf Kaehr

Rudolf Kaehr

The idea behind this patchwork of conceptual interventions is to show the possibility of a “buffer-free” modeling of the crossbar architecture for memristive systems on the base of a purely difference-theoretical approach. It is considered that on a nano-electronic level principles of interpretation appears as mechanisms of complementarity. The most basic conceptual approach to such a complementarity is introduced as an interchangeability of operators and operands of an operation. Therefore, the architecture of crossbars gets an interpretation as complementarity between crossbar functionality and “buffering” translation functionality. That is, the same matter functions as operator and at once, as operand – …

2010 Sonia Kovalevsky Math For Girls Day Report, Association For Women In Mathematics, Lincoln University Of Missouri, Donna L. Stallings

Math for Girls Day Documents

Report for the Fifth Annual Lincoln University Sonia Kovalevsky Math for Girls Day that was held on April 23, 2010 from 8:00am to 2:00pm on the campus of Lincoln University in Jefferson City, MO.

Weak Primary Decomposition Of Modules Over A Commutative Ring, Harrison Stalvey

Mathematics Theses

This paper presents the theory of weak primary decomposition of modules over a commutative ring. A generalization of the classic well-known theory of primary decomposition, weak primary decomposition is a consequence of the notions of weakly associated prime ideals and nearly nilpotent elements, which were introduced by N. Bourbaki. We begin by discussing basic facts about classic primary decomposition. Then we prove the results on weak primary decomposition, which are parallel to the classic case. Lastly, we define and generalize the Compatibility property of primary decomposition.

On Minimal Surfaces And Their Representations, Brian Fitzpatrick

Math Honors Theses

We consider the problem of representation of minimal surfaces in the euclidean space and provide a proof of Bernstein’s theorem. This pa- per serves as a concise and self-contained reference to the theory of minimal surfaces.

Consecutive Patterns: From Permutations To Column-Convex Polyominoes And Back, Don Rawlings, Mark Tiefenbruck

Mathematics

We expose the ties between the consecutive pattern enumeration problems associated with permutations, compositions, column-convex polyominoes, and words. Our perspective allows powerful methods from the contexts of compositions, column-convex polyominoes, and of words to be applied directly to the enumeration of permutations by consecutive patterns. We deduce a host of new consecutive pattern results,including a solution to the (2m+1)-alternating pattern problem on permutations posed by Kitaev.

Least Squares Problems With Inequality Constraints As Quadratic Constraints, Jodi Mead, Rosemary A. Renaut

Jodi Mead

Linear least squares problems with box constraints are commonly solved to find model parameters within bounds based on physical considerations. Common algorithms include Bounded Variable Least Squares (BVLS) and the Matlab function lsqlin. Here, the goal is to find solutions to ill-posed inverse problems that lie within box constraints. To do this, we formulate the box constraints as quadratic constraints, and solve the corresponding unconstrained regularized least squares problem. Using box constraints as quadratic constraints is an efficient approach because the optimization problem has a closed form solution.

The effectiveness of the proposed algorithm is investigated through solving three …

A Newton Root-Finding Algorithm For Estimating The Regularization Parameter For Solving Ill-Conditioned Least Squares Problems, Jodi Mead, Rosemary Renaut

Jodi Mead

We discuss the solution of numerically ill-posed overdetermined systems of equations using Tikhonov a-priori-based regularization. When the noise distribution on the measured data is available to appropriately weight the fidelity term, and the regularization is assumed to be weighted by inverse covariance information on the model parameters, the underlying cost functional becomes a random variable that follows a X2 distribution. The regularization parameter can then be found so that the optimal cost functional has this property. Under this premise a scalar Newton root-finding algorithm for obtaining the regularization parameter is presented. The algorithm, which uses the singular value decomposition of …

Memristics: Memristors, Again?, Rudolf Kaehr

Rudolf Kaehr

This collection gives first and short critical reflections on the concepts of memristics, memristors and memristive systems and the history of similar movements with an own focus on a possible interplay between memory and computing functions, at once, at the same place and time, to achieve a new kind of complementarity between computation and memory on a single chip without retarding buffering conditions.

The Four-Color Theorem And Chromatic Numbers Of Graphs, Sarah E. Cates

Undergraduate Theses and Capstone Projects

We study graph colorings of the form made popular by the four-color theorem. Proved by Appel and Haken in 1976, the Four-Color Theorem states that all planar graphs can be vertex-colored with at most four colors. We consider an alternate way to prove the Four-Color Theorem, introduced by Hadwiger in 1943 and commonly know as Hadwiger’s Conjecture. In addition, we examine the chromatic number of graphs which are not planar. More specifically, we explore adding edges to a planar graph to create a non-planar graph which has the same chromatic number as the planar graph which we started from.

M-Refinable Extensions Of Real Valued Functions, John Meuser, Tian-Xiao He, Faculty Advisor

John Wesley Powell Student Research Conference

No abstract provided.

Regressive Functions On Pairs, Andrés Eduardo Caicedo

Andrés E. Caicedo

We compute an explicit upper bound for the regressive Ramsey numbers by a combinatorial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n, m), the least l such that any regressive function ƒ: [m, l][2]→ℕ admits a min-homogeneous set of size n. Analysis of this function also leads to the simplest known proof that the regressive Ramsey numbers have rate of growth at least Ackermannian. Together, these results give a purely combinatorial proof that, for each m, g(·, m) has rate of growth precisely Ackermannian, considerably improve the previously …

Codes From Riemann-Roch Spaces For Y2 = Xp - X Over Gf(P), Darren B. Glass, David Joyner, Amy Ksir

Math Faculty Publications

Let Χ denote the hyperelliptic curve y2 = xp - x over a field F of characteristic p. The automorphism group of Χ is G = PSL(2, p). Let D be a G-invariant divisor on Χ(F). We compute explicit F-bases for the Riemann-Roch space of D in many cases as well as G-module decompositions. AG codes with good parameters and large automorphism group are constructed as a result. Numerical examples using GAP and SAGE are also given.

Modeling Growth And Telomere Dynamics In Saccharomyces Cerevisiae, Peter Olofsson, Alison A. Bertuch

Mathematics Faculty Research

A general branching process is proposed to model a population of cells of the yeast Saccharomyces cerevisiae following loss of telomerase. Previously published experimental data indicate that a population of telomerase-deficient cells regain exponential growth after a period of slowing due to critical telomere shortening. The explanation for this phenomenon is that some cells engage telomerase-independent pathways to maintain telomeres that allow them to become “survivors.” Our model takes into account random variation in individual cell cycle times, telomere length, finite lifespan of mother cells, and survivorship. We identify and estimate crucial parameters such as the probability of an individual …

Solution Of A Nonlinear System For Uncertainty Quantification In Inverse Problems, Jodi Mead

Jodi Mead

No abstract provided.