Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Applied Mathematics (7)
- Computer Sciences (3)
- Discrete Mathematics and Combinatorics (3)
- Geometry and Topology (3)
- Algebraic Geometry (2)
-
- Analysis (2)
- Dynamic Systems (2)
- Statistics and Probability (2)
- Aerospace Engineering (1)
- Applied Statistics (1)
- Artificial Intelligence and Robotics (1)
- Control Theory (1)
- Education (1)
- Education Economics (1)
- Engineering (1)
- Logic and Foundations (1)
- Navigation, Guidance, Control and Dynamics (1)
- Numerical Analysis and Computation (1)
- Ordinary Differential Equations and Applied Dynamics (1)
- Other Applied Mathematics (1)
- Other Computer Sciences (1)
- Partial Differential Equations (1)
- Set Theory (1)
- Social Justice (1)
- Social and Behavioral Sciences (1)
- Theory and Algorithms (1)
- Keyword
-
- 05B15 (1)
- 05C57 Games on graphs (1)
- 14C20 Divisors linear systems invertible sheaves (1)
- 14H50 (1)
- 14L30 Group actions on varieties or schemes (quotients) (1)
-
- 14T05 (1)
- 14T05 Tropical geometry (1)
- 31 Potential Theory (1)
- 34 Ordinary Differential Equations (1)
- 34K60 (1)
- 35 Partial Differential Equations (1)
- 49 Calculus of variations and optimal control; optimization (1)
- 50C21 Flows in graphs (1)
- 51N35 (1)
- 52 - Convex and Discrete Geometry (1)
- 53 Differential geometry (1)
- 60E05 (1)
- 62-07 (1)
- 62-09 (1)
- 68 Computer science (1)
- 68-04 (1)
- 90B10 Network models deterministic (1)
- 90B20 Traffic problems (1)
- 91 - Game theory economics social and behavioral sciences. (1)
- 91A43 Games involving graphs (1)
- 91A44 (1)
- 91A46 Combinatorial games (1)
- 91D30 (1)
- Bifurcation (1)
- Borda Count (1)
Articles 1 - 19 of 19
Full-Text Articles in Other Mathematics
Beginner's Analysis Of Financial Stochastic Process Models, David Garcia
Beginner's Analysis Of Financial Stochastic Process Models, David Garcia
HMC Senior Theses
This thesis explores the use of geometric Brownian motion (GBM) as a financial model for predicting stock prices. The model is first introduced and its assumptions and limitations are discussed. Then, it is shown how to simulate GBM in order to predict stock price values. The performance of the GBM model is then evaluated in two different periods of time to determine whether it's accuracy has changed before and after March 23, 2020.
Multilayer Network Model Of Gender Bias And Homophily In Hierarchical Structures, Emerson Mcmullen
Multilayer Network Model Of Gender Bias And Homophily In Hierarchical Structures, Emerson Mcmullen
HMC Senior Theses
Although women have made progress in entering positions in academia and
industry, they are still underrepresented at the highest levels of leadership.
Two factors that may contribute to this leaky pipeline are gender bias,
the tendency to treat individuals differently based on the person’s gender
identity, and homophily, the tendency of people to want to be around those
who are similar to themselves. Here, we present a multilayer network model
of gender representation in professional hierarchies that incorporates these
two factors. This model builds on previous work by Clifton et al. (2019), but
the multilayer network framework allows us to …
Results On The Generalized Covering Radius Of Error Correcting Codes, Benjamin Langton
Results On The Generalized Covering Radius Of Error Correcting Codes, Benjamin Langton
HMC Senior Theses
The recently proposed generalized covering radius is a fundamental property of error correcting codes. This quantity characterizes the trade off between time and space complexity of certain algorithms when a code is used in them. However, for the most part very little is known about the generalized covering radius. My thesis seeks to expand on this field in several ways. First, a new upper bound on this quantity is established and compared to previous bounds. Second, this bound is used to derive a new algorithm for finding codewords within the generalized covering radius of a given vector, and also to …
An Exploration Of Voting With Partial Orders, Mason Acevedo
An Exploration Of Voting With Partial Orders, Mason Acevedo
HMC Senior Theses
In this thesis, we discuss existing ideas and voting systems in social choice theory. Specifically, we focus on the Kemeny rule and the Borda count. Then, we begin trying to understand generalizations of these voting systems in a setting where voters can submit partial rankings on their ballot, instead of complete rankings.
Radial Singular Solutions To Semilinear Partial Differential Equations, Marcelo A. Almora Rios
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.
Exploring Winning Strategies For The Game Of Cycles, Kailee Lin
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 …
Fractals, Fractional Derivatives, And Newton-Like Methods, Eleanor Byrnes
Fractals, Fractional Derivatives, And Newton-Like Methods, Eleanor Byrnes
HMC Senior Theses
Inspired by the fractals generated by the discretizations of the Continuous Newton Method and the notion of a fractional derivative, we ask what it would mean if such a fractional derivative were to replace the derivatives in Newton's Method. This work, largely experimental in nature, examines these new iterative methods by generating their Julia sets, computing their fractal dimension, and in certain tractable cases examining the behaviors using tools from dynamical systems.
Pascal's Mystic Hexagon In Tropical Geometry, Hanna Hoffman
Pascal's Mystic Hexagon In Tropical Geometry, Hanna Hoffman
HMC Senior Theses
Pascal's mystic hexagon is a theorem from projective geometry. Given six points in the projective plane, we can construct three points by extending opposite sides of the hexagon. These three points are collinear if and only if the six original points lie on a nondegenerate conic. We attempt to prove this theorem in the tropical plane.
Radial Solutions To Semipositone Dirichlet Problems, Ethan Sargent
Radial Solutions To Semipositone Dirichlet Problems, Ethan Sargent
HMC Senior Theses
We study a Dirichlet problem, investigating existence and uniqueness for semipositone and superlinear nonlinearities. We make use of Pohozaev identities, energy arguments, and bifurcation from a simple eigenvalue.
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 …
Emergence And Complexity In Music, Zoe Tucker
Emergence And Complexity In Music, Zoe Tucker
HMC Senior Theses
How can we apply mathematical notions of complexity and emergence to music, and how can these mathematical ideas then inspire new musical works? Using Steve Reich's Clapping Music as a starting point, we look for emergent patterns in music by considering cases where a piece's complexity is significantly different from the total complexity of each of the individual parts. Definitions of complexity inspired by information theory, data compression, and musical practice are considered. We also consider the number of distinct musical pieces that could be composed in the same manner as Clapping Music. Finally, we present a new musical …
Sudoku Variants On The Torus, Kira A. Wyld
Sudoku Variants On The Torus, Kira A. Wyld
HMC Senior Theses
This paper examines the mathematical properties of Sudoku puzzles defined on a Torus. We seek to answer the questions for these variants that have been explored for the traditional Sudoku. We do this process with two such embeddings. The end result of this paper is a deeper mathematical understanding of logic puzzles of this type, as well as a fun new puzzle which could be played.
The Document Similarity Network: A Novel Technique For Visualizing Relationships In Text Corpora, Dylan Baker
The Document Similarity Network: A Novel Technique For Visualizing Relationships In Text Corpora, Dylan Baker
HMC Senior Theses
With the abundance of written information available online, it is useful to be able to automatically synthesize and extract meaningful information from text corpora. We present a unique method for visualizing relationships between documents in a text corpus. By using Latent Dirichlet Allocation to extract topics from the corpus, we create a graph whose nodes represent individual documents and whose edge weights indicate the distance between topic distributions in documents. These edge lengths are then scaled using multidimensional scaling techniques, such that more similar documents are clustered together. Applying this method to several datasets, we demonstrate that these graphs are …
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
Combinatorial Polynomial Hirsch Conjecture, Sam Miller
HMC Senior Theses
The Hirsch Conjecture states that for a d-dimensional polytope with n facets, the diameter of the graph of the polytope is at most n-d. This conjecture was disproven in 2010 by Francisco Santos Leal. However, a polynomial bound in n and d on the diameter of a polytope may still exist. Finding a polynomial bound would provide a worst-case scenario runtime for the Simplex Method of Linear Programming. However working only with polytopes in higher dimensions can prove challenging, so other approaches are welcome. There are many equivalent formulations of the Hirsch Conjecture, one of which is the …
A Mathematical Framework For Unmanned Aerial Vehicle Obstacle Avoidance, Sorathan Chaturapruek
A Mathematical Framework For Unmanned Aerial Vehicle Obstacle Avoidance, Sorathan Chaturapruek
HMC Senior Theses
The obstacle avoidance navigation problem for Unmanned Aerial Vehicles (UAVs) is a very challenging problem. It lies at the intersection of many fields such as probability, differential geometry, optimal control, and robotics. We build a mathematical framework to solve this problem for quadrotors using both a theoretical approach through a Hamiltonian system and a machine learning approach that learns from human sub-experts' multiple demonstrations in obstacle avoidance. Prior research on the machine learning approach uses an algorithm that does not incorporate geometry. We have developed tools to solve and test the obstacle avoidance problem through mathematics.
Extortion And Evolution In The Iterated Prisoner's Dilemma, Michael J. Earnest
Extortion And Evolution In The Iterated Prisoner's Dilemma, Michael J. Earnest
HMC Senior Theses
The Prisoner's Dilemma is a two player game where playing rationally leads to a suboptimal outcome for both players. The game is simple to analyze, but when it is played repeatedly, complex dynamics emerge. Recent research has shown the existence of extortionate strategies, which allow one player to win at least as much as the other. When one player plays such a strategy, the other must either decide to take a low payoff, or accede to the extortion, where they earn higher payoff, but their opponent receives a larger share. We investigate what happens when one player uses this strategy …
Voter Compatibility In Interval Societies, Rosalie J. Carlson
Voter Compatibility In Interval Societies, Rosalie J. Carlson
HMC Senior Theses
In an interval society, voters are represented by intervals on the real line, corresponding to their approval sets on a linear political spectrum. I imagine the society to be a representative democracy, and ask how to choose members of the society as representatives. Following work in mathematical psychology by Coombs and others, I develop a measure of the compatibility (political similarity) of two voters. I use this measure to determine the popularity of each voter as a candidate. I then establish local “agreeability” conditions and attempt to find a lower bound for the popularity of the best candidate. Other results …
Group Actions And Divisors On Tropical Curves, Max B. Kutler
Group Actions And Divisors On Tropical Curves, Max B. Kutler
HMC Senior Theses
Tropical geometry is algebraic geometry over the tropical semiring, or min-plus algebra. In this thesis, I discuss the basic geometry of plane tropical curves. By introducing the notion of abstract tropical curves, I am able to pass to a more abstract metric-topological setting. In this setting, I discuss divisors on tropical curves. I begin a study of $G$-invariant divisors and divisor classes.
Verification Of Solutions To The Sensor Location Problem, Chandler May
Verification Of Solutions To The Sensor Location Problem, Chandler May
HMC Senior Theses
Traffic congestion is a serious problem with large economic and environmental impacts. To reduce congestion (as a city planner) or simply to avoid congested channels (as a road user), one might like to accurately know the flow on roads in the traffic network. This information can be obtained from traffic sensors, devices that can be installed on roads or intersections to measure traffic flow. The sensor location problem is the problem of efficiently locating traffic sensors on intersections such that the flow on the entire network can be extrapolated from the readings of those sensors. I build on current research …