Mathematics Commons^™

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 …

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 …

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 & Statistical Sciences Faculty Publications

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 …

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.

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.

Symmetry From Nature To The Classroom, Rochelle Lueders

Honors Capstones

Capstone submitted as a graduation requirement for the BSU Honors Program.

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.

An Investigation Of Wavelets, Wendy Bergh

Honors Capstones

Capstone submitted as a graduation requirement for the BSU Honors Program.

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

John Wesley Powell Student Research Conference

No abstract provided.

A Non-Autonomous Second Order Boundary Value Problem On The Half-Line, Gregory S. Spradlin

Publications

By variational arguments, the existence of a solution to a nonautonomous second-order boundary problem on the half-line is proven. The corresponding autonomous problem has no solution, revealing significant differences between the autonomous and the non-autonomous case.

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 …

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.

Browder-Krasnoselskii-Type Fixed Point Theorems In Banach Spaces, Ravi P. Agarwal, Donal O'Regan

Mathematics and System Engineering Faculty Publications

We present some fixed point theorems for the sum A+B of a weakly-strongly continuous map and a nonexpansive map on a Banach space X. Our results cover several earlier works by Edmunds, Reinermann, Singh, and others.

Determining The Success Of Ncaa Basketball Teams Through Team Characteristics, Raymond Witkos

Honors Projects in Mathematics

Every year much of the nation becomes engulfed in the NCAA basketball postseason tournament more affectionately known as “March Madness.” The tournament has received the name because of the ability for any team to win a single game and advance to the next round. The purpose of this study is to determine whether concrete statistical measures can be used to predict the final outcome of the tournament. The data collected in the study include 13 independent variables ranging from the 2003-2004 season up until the current 2009-2010 season. Different tests were run in an attempt to achieve the most accurate …

Bytes Of Π, Spring 2010, Department Of Mathematics And Computer Science, Bridgewater State College

Department of Mathematics Newsletter

No abstract provided.

Regressive Functions On Pairs, Andrés Eduardo Caicedo

Mathematics Faculty Publications and Presentations

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 …

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

Mathematics Faculty Publications and Presentations

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 …

Signal Recovery From Inaccurate And Incomplete Measurements Via Regularized Orthogonal Matching Pursuit, Deanna Needell, Roman Vershynin

CMC Faculty Publications and Research

We demonstrate a simple greedy algorithm that can reliably recover a vector v ?? ??d from incomplete and inaccurate measurements x = ??v + e. Here, ?? is a N x d measurement matrix with Nv with O(n) nonzeros from its inaccurate measurements x in at most n iterations, where each iteration amounts to solving a least squares problem. The noise level of the recovery is proportional to ??{logn} ||e||2. In particular, if the error term e vanishes the reconstruction is exact.

On Construction Of The Smallest One-Sided Confidence Interval For The Difference Of Two Proportions, Weizhen Wang

Mathematics and Statistics Faculty Publications

For my class of one-sided 1 - α confidence intervals with a certain monotonicity ordering on the random confidence limit, the smallest interval, in the sense of the set inclusion for the difference of two proportions of two independent binomial random variables, is constructed based on a direct analysis of coverage probability function. A special ordering on the confidence limit is developed and the corresponding smallest confidence interval is derived. This interval is then applied to identify the minimum effective dose (MED) for binary data in dose-response studies, and a multiple test procedure that controls the familywise error rate at …

Detecting Malicious Javascript, Matthew F. Der

Honors Theses

The increased use of the World Wide Web and JavaScript as a scripting language for Web pages have made JavaScript a popular attack vector for infecting users' machines with malware. Additionally, attackers often obfuscate their code to avoid detection, which heightens the challenge and complexity of automated defense systems. We present two analyses of malicious scripts and suggest how they could be extended into intrusion detection systems. For our analyses we use a sample of deobfuscated malicious and benign scripts collected from actual Web sites. First, using our malicious sample, we perform a manual analysis of attack signatures, identifying four …

On Calculating Residuated Approximations And The Structure Of Finite Lattices Of Small Width, Wu Feng

Doctoral Dissertations

The concept of a residuated mapping relates to the concept of Galois connections; both arise in the theory of partially ordered sets. They have been applied in mathematical theories (e.g., category theory and formal concept analysis) and in theoretical computer science. The computation of residuated approximations between two lattices is influenced by lattice properties, e.g. distributivity.

In previous work, it has been proven that, for any mapping f : L → [special characters omitted] between two complete lattices L and [special characters omitted], there exists a largest residuated mapping ρf dominated by f, and the notion of "the shadow …

Section Abstracts: Astronomy, Mathematics, And Physics & Materials Science

Virginia Journal of Science

Abstracts of papers of the Astronomy, Mathematics, and Physics (Including Materials Science) Section for the 88th Annual Meeting of the Virginia Academy of Science, May 20-21, 2010, James Madison University, Harrisonburg, VA.

Problem Solving Based Instruction In The High School Mathematics Classroom, Lawrence Vettleson, Jr.

Mathematics Graduate Theses

This paper is a review of research pertaining to the use of problem solving in classroom instruction. It covers the stages of problems solving as listed by George Polya and how they can be used to enhance mathematics instruction. This research paper will identify that problem solving is a need based on Minnesota state mathematics standards and National mathematics standards. Covered in this paper is the research on the effects of mathematics instruction using problem solving. The research covers some of the benefits to student education if students learn mathematics using a problem solving based approach to classroom instruction.

Volume 03, Cheryl Peck, Charles Hoever, Longwood Theater Department, Brittany Anderson, J. Ervin Sheldon, Richard Hayden, Yuri Calustro, Candice Fleming, Rebecca Franklin, Ashley Yocum, Danielle M. Jagoda, Cristina M. Valdivieso, Jameka Jones, Amy Ellis, Ashley Maser, Erikk Shupp, Jamie Yurasits, Joshua Davis, Alexander Leonhart, Kenny Wolfe, Sally Meadows, J. Haley, Amy Jackson, Morgan Howard, Adrienne Heinbaugh, Melissa Dorton, Ciarra Stalker

Incite: The Journal of Undergraduate Scholarship

Introduction from Dean Dr. Charles Ross

Little Shop of Horrors by Longwood Theater Department

Who Has the Hottest Hotsauce in Farmville: A Quantitative Comparison of Sauces from Local Restaurants by Cheryl Peck and Charles Hoever

Precipitation Effects on the Growth of White Oaks and Virginia Pines on the Mt. Vernon Plantation by Brittany Anderson

Design and Synthesis of Novel Ion Binding Molecules for Self-Assembly and Sensing Applications by J. Ervin Sheldon

A Statistical Analysis of Algorithms for Playing SameGame by Richard Hayden

Intersecting Cylinders at Arbitrary Angles by Yuri Calustro

Putting a Foot in the Revolving Door: Strategies for Reducing …

A Discrete Nonlinear Model Of Resonant Scattering, Katherine Hollister Smith

Honors Capstones

No abstract provided.

Representing Propositional Logic Connectives With Modular Polynomials, Shawn Davis

McNair Scholars Research Journal

This paper explores the relationship between n-valued propositional logic connectives and modular polynomials. Namely the representing of logic connectives using modular polynomials. The case for n = 2 is explored and a method is developed for finding the coefficients of the unique polynomial that represents any given binary logic connective. Examples are then given for using the modular polynomial representations of connectives to determine the validity of propositional arguments. A similar procedure is shown for when n = 3 and an evaluation of the axioms of Łukasiewicz’s 3-valued logic is given using modular polynomials. The general case is explored to …

Applying Metric Regularity To Compute Condition Measure Of Smoothing Algorithm For Matrix Games, Boris S. Mordukhovich, Javier Peña, Vera Roshchina

Mathematics Research Reports

Abstract. We develop an approach of variational analysis and generalized differentiation to conditioning issues for two-person zero-sum matrix games. Our major results establish precise relationships between a certain condition measure of the smoothing first-order algorithm proposed in (4] and the exact bound of metric regularity for an associated set-valued mapping. In this way we compute the aforementioned condition measure in terms of the initial matrix game data.

On The Non-Existence Of A Projective (75, 4,12, 5) Set In Pg(3, 7), Aaron C.S. Chan, James A. Davis, Jonathan Jedwab

Department of Math & Statistics Faculty Publications

We show by a combination of theoretical argument and computer search that if a projective (75, 4, 12, 5) set in PG(3, 7) exists then its automorphism group must be trivial. This corresponds to the smallest open case of a coding problem posed by H. Ward in 1998, concerning the possible existence of an infinite family of projective two-weight codes meeting the Griesmer bound.