Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Discrete Mathematics and Combinatorics (5)
- Algebraic Geometry (3)
- Other Mathematics (3)
- Algebra (2)
- Applied Mathematics (2)
-
- Education (2)
- Aerospace Engineering (1)
- Artificial Intelligence and Robotics (1)
- Computer Sciences (1)
- Control Theory (1)
- Curriculum and Instruction (1)
- Engineering (1)
- Logic and Foundations (1)
- Navigation, Guidance, Control and Dynamics (1)
- Other Applied Mathematics (1)
- Science and Mathematics Education (1)
- Keyword
-
- 05B15 (1)
- 05C09 (1)
- 05C10 Planar graphs; geometric and topological aspects of graph theory (1)
- 05C15 Coloring of graphs and hypergraphs (1)
- 05C35 Extremal problems (1)
-
- 05Cxx Graph theory (1)
- 05E99 None of the above but in this section (algebraic combinatorics) (1)
- 14H50 (1)
- 14T05 (1)
- 49 Calculus of variations and optimal control; optimization (1)
- 51 Geometry (1)
- 51-04 Explicit machine computation and programs (1)
- 51N35 (1)
- 52-XX Convex and discrete geometry (1)
- 53 Differential Geometry (1)
- 53 Differential geometry (1)
- 54-01 General Topology Instructional Exposition (1)
- 54H99 (1)
- 55N35 Other homology theories (1)
- 57-XX Manifolds and cell complexes (1)
- 57M27 Invariants of knots and 3-manifolds (1)
- 57R25 (1)
- 68 Computer science (1)
- 91A44 (1)
- 97 Mathematics Education (1)
- 97-A70 Mathematics Education Theses (1)
- Codes (1)
- Convexity (1)
- Cube (1)
- Discrete Proof (1)
Articles 1 - 15 of 15
Full-Text Articles in Geometry and Topology
The Dual Boundary Complex Of The Moduli Space Of Cyclic Compactifications, Toby Anderson
The Dual Boundary Complex Of The Moduli Space Of Cyclic Compactifications, Toby Anderson
HMC Senior Theses
Moduli spaces provide a useful method for studying families of mathematical objects. We study certain moduli spaces of algebraic curves, which are generalizations of familiar lines and conics. This thesis focuses on, Δ(r,n), the dual boundary complex of the moduli space of genus-zero cyclic curves. This complex is itself a moduli space of graphs and can be investigated with combinatorial methods. Remarkably, the combinatorics of this complex provides insight into the geometry and topology of the original moduli space. In this thesis, we investigate two topologically invariant properties of Δ(r,n). We compute its Euler characteristic and …
Discrete Analogues Of The Poincaré-Hopf Theorem, Kate Perkins
Discrete Analogues Of The Poincaré-Hopf Theorem, Kate Perkins
HMC Senior Theses
My thesis unpacks the relationship between two discrete formulations of the Poincaré-Hopf index theorem. Chapter 1 introduces necessary definitions. Chapter 2 describes the discrete analogs and their differences. Chapter 3 contains a proof that one analog implies the other and chapter 4 contains a proof that the Poincaré-Hopf theorem implies the discrete analogs. Finally, chapter 5 presents still open questions and further research directions.
Algebraic Invariants Of Knot Diagrams On Surfaces, Ryan Martinez
Algebraic Invariants Of Knot Diagrams On Surfaces, Ryan Martinez
HMC Senior Theses
In this thesis we first give an introduction to knots, knot diagrams, and algebraic structures defined on them accessible to anyone with knowledge of very basic abstract algebra and topology. Of particular interest in this thesis is the quandle which "colors" knot diagrams. Usually, quandles are only used to color knot diagrams in the plane or on a sphere, so this thesis extends quandles to knot diagrams on any surface and begins to classify the fundamental quandles of knot diagrams on the torus.
This thesis also breifly looks into Niebrzydowski Tribrackets which are a different algebraic structure which, in future …
A Discrete Analogue For The Poincaré-Hopf Theorem, Savana Ammons
A Discrete Analogue For The Poincaré-Hopf Theorem, Savana Ammons
HMC Senior Theses
In this thesis, we develop a discrete analogue to the Poincaré–Hopf Theorem. We define the notion of a vector field on a graph, and establish an index theory for such a field. Specifically, we create well-defined indices for the nodes and “cells" formed by a planar graph. Then, we show that the sum of these indices remains constant for certain types of planar graphs, regardless of the discrete vector fields they have.
Where The Wild Knots Are, Forest Kobayashi
Where The Wild Knots Are, Forest Kobayashi
HMC Senior Theses
The new work in this document can be broken down into two main parts. In the first, we introduce a formalism for viewing the signed Gauss code for virtual knots in terms of an action of the symmetric group on a countable set. This is achieved by creating a "standard unknot" whose diagram contains countably-many crossings, and then representing tame knots in terms of the action of permutations with finite support. We present some preliminary computational results regarding the group operation given by this encoding, but do not explore it in detail. To make the encoding above formal, we require …
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.
Enhancing The Quandle Coloring Invariant For Knots And Links, Karina Elle Cho
Enhancing The Quandle Coloring Invariant For Knots And Links, Karina Elle Cho
HMC Senior Theses
Quandles, which are algebraic structures related to knots, can be used to color knot diagrams, and the number of these colorings is called the quandle coloring invariant. We strengthen the quandle coloring invariant by considering a graph structure on the space of quandle colorings of a knot, and we call our graph the quandle coloring quiver. This structure is a categorification of the quandle coloring invariant. Then, we strengthen the quiver by decorating it with Boltzmann weights. Explicit examples of links that show that our enhancements are proper are provided, as well as background information in quandle theory.
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.
Pattern Recognition In Stock Data, Kathryn Dover
Pattern Recognition In Stock Data, Kathryn Dover
HMC Senior Theses
Finding patterns in high dimensional data can be difficult because it cannot be easily visualized. There are many different machine learning methods to fit data in order to predict and classify future data but there is typically a large expense on having the machine learn the fit for a certain part of a dataset. We propose a geometric way of defining different patterns in data that is invariant under size and rotation. Using a Gaussian Process, we find that pattern within stock datasets and make predictions from it.
Convexity Of Neural Codes, Robert Amzi Jeffs
Convexity Of Neural Codes, Robert Amzi Jeffs
HMC Senior Theses
An important task in neuroscience is stimulus reconstruction: given activity in the brain, what stimulus could have caused it? We build on previous literature which uses neural codes to approach this problem mathematically. A neural code is a collection of binary vectors that record concurrent firing of neurons in the brain. We consider neural codes arising from place cells, which are neurons that track an animal's position in space. We examine algebraic objects associated to neural codes, and completely characterize a certain class of maps between these objects. Furthermore, we show that such maps have natural geometric implications related to …
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.
Using Topology To Explore Mathematics Education Reform, Carling Sugarman
Using Topology To Explore Mathematics Education Reform, Carling Sugarman
HMC Senior Theses
Mathematics education is a constant topic of conversation in the United States. Many attempts have been made historically to reform teaching methods and improve student results. Particularly, past ideas have emphasized problem-solving to make math feel more applicable and enjoyable. Many have additionally tackled the widespread problem of “math anxiety” by creating lessons that are more discussion-based than drill-based to shift focus from speed and accuracy. In my project, I explored past reform goals and some added goals concerning students' perceptions of mathematics. To do so, I created and tested a pilot workshop in topology, a creative and intuitive field, …
A Discrete Approach To The Poincare-Miranda Theorem, Connor Thomas Ahlbach
A Discrete Approach To The Poincare-Miranda Theorem, Connor Thomas Ahlbach
HMC Senior Theses
The Poincare-Miranda Theorem is a topological result about the existence of a zero of a function under particular boundary conditions. In this thesis, we explore proofs of the Poincare-Miranda Theorem that are discrete in nature - that is, they prove a continuous result using an intermediate lemma about discrete objects. We explain a proof by Tkacz and Turzanski that proves the Poincare-Miranda theorem via the Steinhaus Chessboard Theorem, involving colorings of partitions of n-dimensional cubes. Then, we develop a new proof of the Poincare-Miranda Theorem that relies on a polytopal generalization of Sperner's Lemma of Deloera - Peterson - Su. …
Mathematical Knowledge For Teaching And Visualizing Differential Geometry, Nathan Pinsky
Mathematical Knowledge For Teaching And Visualizing Differential Geometry, Nathan Pinsky
HMC Senior Theses
In recent decades, education researchers have recognized the need for teachers to have a nuanced content knowledge in addition to pedagogical knowledge, but very little research was conducted into what this knowledge would entail. Beginning in 2008, math education researchers began to develop a theoretical framework for the mathematical knowledge needed for teaching, but their work focused primarily on elementary schools. I will present an analysis of the mathematical knowledge needed for teaching about the regular curves and surfaces, two important concepts in differential geometry which generalize to the advanced notion of a manifold, both in a college classroom and …
Extending List Colorings Of Planar Graphs, Sarah Loeb
Extending List Colorings Of Planar Graphs, Sarah Loeb
HMC Senior Theses
In the study of list colorings of graphs, we assume each vertex of a graph has a specified list of colors from which it may be colored. For planar graphs, it is known that there is a coloring for any list assignment where each list contains five colors. If we have some vertices that are precolored, can we extend this to a coloring of the entire graph? We explore distance constraints when we allow the lists to contain an extra color. For lists of length five, we fix $W$ as a subset of $V(G)$ such that all vertices in $W$ …