Mathematics Commons^™

Using Mobile Technology To Promote Higher-Order Thinking Skills In Elementary Mathematics, Debbie Marie Versoza, Ma. Louise Antonette N. De Las Peñas, Jumela F. Sarmiento, Maria Alva Q. Aberin, Mark Anthony C. Tolentino, Mark L. Loyola

Mathematics Faculty Publications

The problem of rote-based learning in mathematics is well documented. Mobile technology can provide a potential solution; especially when application (app) design is based on sound pedagogical principles and gamification elements. However; an inventory of available mobile apps for mathematics reveals that many of the available apps are guided by a behaviorist perspective that favors repetition over meaningful learning. This paper reports on the design of mobile mathematics apps that harness gamification techniques to promote higher-order thinking skills (HOTS) even in basic elementary school concepts such as number comparison; and addition and subtraction. The integration of these apps in the …

Designing Performance Tasks In Mathematics Using Technological Tools, Ma. Louise Antonette N. De Las Peñas, Debbie Marie Versoza, Maria Alva Q. Aberin, Agnes Garciano, Jumela F. Sarmiento, Mark Anthony C. Tolentino

Mathematics Faculty Publications

In the Philippines, the performance task is one of the major summative assessments in the K to 12 curriculum. This paper discusses how performance tasks may utilize mathematical apps within the context of blended learning. Guidelines on designing performance tasks; as well as the GRASPS framework; are discussed. Performance tasks that cut across various grade levels and strands of mathematics are presented. These involve divisibility (Numbers); integer and polynomial operations (Algebra); triangle centers (Geometry); and statistics (Statistics). The performance tasks described in this paper can provide an initial idea for the design of other summative assessments and contribute to the …

Performance In Calculus Ii For Students In Clear Calculus: A Causal Comparative Study, Ty Mckinney, Rebecca Dibbs

Pursue: Undergraduate Research Journal

Calculus is one of the greatest intellectual achievements of the world and is the main gateway for students that are heading into the fields that will power the economy of the 21st century. However, over 25% of students fail U.S. calculus courses each year and end up changing majors. It is important for educators and researchers to try to improve student success and find ways to increase STEM major retention. The purpose of this study was to compare the performance between students that are in traditional and non-traditional calculus II courses based on their preparation in either traditional or non-traditional …

A Review Of The Fractal Market Hypothesis For Trading And Market Price Prediction, Jonathan Blackledge, Marc Lamphiere

Articles

This paper provides a review of the Fractal Market Hypothesis (FMH) focusing on financial times series analysis. In order to put the FMH into a broader perspective, the Random Walk and Efficient Market Hypotheses are considered together with the basic principles of fractal geometry. After exploring the historical developments associated with different financial hypotheses, an overview of the basic mathematical modelling is provided. The principal goal of this paper is to consider the intrinsic scaling properties that are characteristic for each hypothesis. In regard to the FMH, it is explained why a financial time series can be taken to be …

The Complexity Of Symmetry, Matthew Lemay

HMC Senior Theses

One of the main goals of theoretical computer science is to prove limits on how efficiently certain Boolean functions can be computed. The study of the algebraic complexity of polynomials provides an indirect approach to exploring these questions, which may prove fruitful since much is known about polynomials already from the field of algebra. This paper explores current research in establishing lower bounds on invariant rings and polynomial families. It explains the construction of an invariant ring for whom a succinct encoding would imply that NP is in P/poly. It then states a theorem about the circuit complexity partial …

Exploring Winning Strategies For The Game Of Cycles, Kailee Lin

HMC Senior Theses

This report details my adventures exploring the Game of Cycles in search of winning strategies. I started by studying combinatorial game theory with hopes to use the Sprague-Grundy Theorem and the structure of Nimbers to gain insight for the Game of Cycles. In the second semester, I pivoted to studying specific types of boards instead. In this thesis I show that variations of the mirror-reverse strategy developed by Alvarado et al. in the original Game of Cycles paper can be used to win on additional game boards with special structure, such as lollipops, steering wheel locks, and 3-spoke trees. Additionally …

Regression Analysis: Graduation Rate In Kentucky Public High Schools, Rebecca Price

Mahurin Honors College Capstone Experience/Thesis Projects

Kentucky’s Public High School graduation rates vary widely across the rural and urban regions in the state. In addition to their graduation rates, each of these schools have their own unique demographics, funding, teacher-student ratio, etc. that define said school’s identity. This research aims to analyze the aforementioned variables, as well as other variables listed on each school state report card, in order to create a model to predict any school’s graduation rate.

In order to create this model, data was taken on all public high schools in Kentucky from the Kentucky Department of Education’s School Report Card. Data were …

Diving Into Reliable Numerical Observability And Stabilization Of The One-Dimensional Wave Equation, Emma Moore

Mahurin Honors College Capstone Experience/Thesis Projects

In this project, a one-dimensional wave equation, which is a partial differential equation (PDE) describing vibrations on a string, is considered. It is known that the PDE model is exactly observable and exponentially stabilizable. The main goal of this project is to construct a numerical approximation technique, so-called the direct filtering technique, to prove that the Finite Difference and Finite Element space-discretized 1-D wave equations (i) with homogeneous Dirichlet boundary conditions are uniformly observable, (ii) with controlled boundary conditions are uniformly exponentially stable, as the approximation parameters tend to zero. It is crucial to develop reliable numerical approximation techniques for …

Understanding Changes In Marine Communities Through A Discretized, Size-Structured Matrix Model, Courtney Swanson

Senior Seminars and Capstones

We study a discretized, size-structured matrix model which calculates population in a marine community over time. A portion of this model is a discretized version of the McKendrick-von Foerster equation, so we spend some time studying the process of discretizing that equation. We implement a mini model containing 10 size categories instead of the original 50, and we looked at how the marine community behaves over 40 years. We discuss some of the challenges when implementing this model.

Radial Singular Solutions To Semilinear Partial Differential Equations, Marcelo A. Almora Rios

HMC Senior Theses

We show the existence of countably many non-degenerate continua of singular radial solutions to a p-subcritical, p-Laplacian Dirichlet problem on the unit ball in R^N. This result generalizes those for the 2-Laplacian to any value p and extends recent work on the p-Laplacian by considering solutions both radial and singular.

The Slice Rank Polynomial Method, Thomas C. Martinez

HMC Senior Theses

Suppose you wanted to bound the maximum size of a set in which every k-tuple of elements satisfied a specific condition. How would you go about this? Introduced in 2016 by Terence Tao, the slice rank polynomial method is a recently developed approach to solving problems in extremal combinatorics using linear algebraic tools. We provide the necessary background to understand this method, as well as some applications. Finally, we investigate a generalization of the slice rank, the partition rank introduced by Eric Naslund in 2020, along with various discussions on the intuition behind the slice rank polynomial method and …

On The Inverse Hull Of A One-Sided Shift Of Finite Type, Aria Beaupre

HMC Senior Theses

Let S be the semigroup constructed from a one-sided shift of finite type. In this thesis, we will provide the construction of H(S), the inverse hull of S, explore the properties of H(S), and begin to characterize the structure of H(S). We will also focus on a kind of one-sided shift of finite type, Markov shifts, and prove an invariant on isomorphic inverse hulls of Markov shifts.

Combating The Whitewashing And Male Bias Of The Calculus Curriculum, Sua Cho, Harold Gee Iii, Herbert R. Fynewever

Summer Research

Mathematicians are not the only ones to use Calculus; in fact, there are many more applications and practices in Calculus that come from different professions and interests too. Unfortunately, most Calculus textbooks don’t include people of color or women who use Calculus. Each person highlighted on this poster will be connected to a Calculus-related problem. We hope that their remarkable stories will open the doors for many more!

A Unified Approach For Constructing Confidence Intervals And Hypothesis Tests Using H-Function, Weizhen Wang

Mathematics and Statistics Faculty Publications

We introduce a general method, named the h-function method, to unify the constructions of level-a exact test and 1-a exact confidence interval. Using this method, any confidence interval is improved as follows: i) an approximate interval, including a point estimator, is modified to an exact interval; ii) an exact interval is refined to be an interval that is a subset of the previous one. Two real datasets are used to illustrate the method.

Why Gradient Descent -- Not The Best Optimization Technique -- Works Best In Neural Networks: Qualitative Explanation, Jonatan Contreras, Martine Ceberio, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

In a usual Numerical Methods class, students learn that gradient descent is not an efficient optimization algorithm, and that more efficient algorithms exist, algorithms which are actually used in state-of-the-art numerical optimization packages. On the other hand, in solving optimization problems related to machine learning -- and, in particular, in currently most efficient deep learning -- gradient descent (in the form of backpropagation) is much more efficient than any of the alternatives that have been tried. How can we reconcile these two statements? In this paper, we explain that, in reality, there is no contradiction here. Namely, in usual applications …

Why Question-Based Reasoning Leads To Constructive Approach To Knowledge, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

Once we have partial knowledge, what next question do we usually pursue? Empirical study shows, e.g., that if we know that A \/ B is true, but we do not know whether A is true or B is true, then the usual next step is to ask whether A is true or B is true. This selection of the next step is in line with the constructive approach to knowledge, in which when A \/ B is true, this means that we either know that A is true, or we know that B is true. In this paper, we provide …

Can Ideas Behind Ancient Egyptian Fractions Speed Up Modern Computers?, Olga Kosheleva, Vladik Kreinovich

Departmental Technical Reports (CS)

To divide two numbers a and b, modern computers use an algorithm which is more efficient that what we humans normally do: they compute a*(1/b), where for all sufficiently small integers b, the inverse 1/b is pre-computed. For fractions, when both a and b are integers, this algorithm requires only one multiplication. Can we make the procedure even faster by not using multiplication at all? To do this, we need to represent each fraction as the sum of inverses -- which, interestingly, is how ancient Egyptians represented fractions.

Interdisciplinary Thinking: Financial Literacy Crosses Disciplinary Boundaries, Marla A. Sole

Publications and Research

Financial literacy is ideally suited to be integrated into mathematics courses and taught in an interdisciplinary manner. Students learn best and are motivated when tackling real-world meaningful questions. This article shares how elementary mathematics was applied to better understand the debate about raising the minimum wage and the United States National Debt. To serve as a guide for other teachers who wish to incorporate financial literacy into their mathematics courses and take an interdisciplinary approach, this article suggests readings, data sets, and pedagogical practices. Students were engaged and enthusiastic to work on problems that challenged their thinking about financial issues.

Interdisciplinary Thinking: Financial Literacy Crosses Disciplinary Boundaries, Marla A. Sole

Publications and Research

Financial literacy is ideally suited to be integrated into mathematics courses and taught in an interdisciplinary manner. Students learn best and are motivated when tackling real-world meaningful questions. This article shares how elementary mathematics was applied to better understand the debate about raising the minimum wage and the United States National Debt. To serve as a guide for other teachers who wish to incorporate financial literacy into their mathematics courses and take an interdisciplinary approach, this article suggests readings, data sets, and pedagogical practices. Students were engaged and enthusiastic to work on problems that challenged their thinking about financial issues.

Asymptotic Properties Of The Potentials For Greedy Energy Sequences On The Unit Circle, Ryan Edward Mccleary

Honors Undergraduate Theses

In this work, we analyze the asymptotic behavior of the minimum values of Riesz s-potentials generated by greedy s-energy sequences on the unit circle. The analysis is broken into the cases 0 < s < 1, s = 1, and s > 1, since the behavior of the minimum values of the Riesz s-potential undergoes a sharp transition at s = 1. For 0 < s < 1, the first-order behavior is already known. We obtain first-order asymptotic results for 0 < s < 1. We also prove first-order and second-order asymptotic formulas for s = 1 and investigate the first-order behavior for s > 1.