Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Entire DC Network
Self Regulation In College-Level Mathematics Classes, Jenny Lee
Self Regulation In College-Level Mathematics Classes, Jenny Lee
HMC Senior Theses
This thesis investigates the need for improvement in mathematics education at the college level in the US regarding equitable practices in instruction. In particular, it focuses on understanding the role self-regulation can play in the classroom dynamics, and how self-regulation can be a way to empower students. Also included is a case study in an introductory linear algebra class at a liberal arts college and is meant to provide a investigation into a way of incorporating self-regulation by using self-paced assessments. Results of this study suggest a possible question to consider in reforming mathematics education for a more equitable environment …
On The Landscape Of Random Tropical Polynomials, Christopher Hoyt
On The Landscape Of Random Tropical Polynomials, Christopher Hoyt
HMC Senior Theses
Tropical polynomials are similar to classical polynomials, however addition and multiplication are replaced with tropical addition (minimums) and tropical multiplication (addition). Within this new construction, polynomials become piecewise linear curves with interesting behavior. All tropical polynomials are piecewise linear curves, and each linear component uniquely corresponds to a particular monomial. In addition, certain monomial in the tropical polynomial can be trivial due to the fact that tropical addition is the minimum operator. Therefore, it makes sense to consider a graph of connectivity of the monomials for any given tropical polynomial. We investigate tropical polynomials where all coefficients are chosen from …
An Incidence Approach To The Distinct Distances Problem, Bryce Mclaughlin
An Incidence Approach To The Distinct Distances Problem, Bryce Mclaughlin
HMC Senior Theses
In 1946, Erdös posed the distinct distances problem, which asks for the minimum number of distinct distances that any set of n points in the real plane must realize. Erdös showed that any point set must realize at least &Omega(n1/2) distances, but could only provide a construction which offered &Omega(n/&radic(log(n)))$ distances. He conjectured that the actual minimum number of distances was &Omega(n1-&epsilon) for any &epsilon > 0, but that sublinear constructions were possible. This lower bound has been improved over the years, but Erdös' conjecture seemed to hold until in 2010 Larry Guth and Nets Hawk Katz …