Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Discrete Mathematics and Combinatorics (4)
- Other Mathematics (4)
- Algebra (2)
- Algebraic Geometry (2)
- Computer Sciences (2)
-
- Geometry and Topology (2)
- Applied Mathematics (1)
- Applied Statistics (1)
- Computational Neuroscience (1)
- Life Sciences (1)
- Logic and Foundations (1)
- Neuroscience and Neurobiology (1)
- Other Applied Mathematics (1)
- Other Computer Sciences (1)
- Set Theory (1)
- Statistics and Probability (1)
- Theory and Algorithms (1)
- Keyword
-
- Combinatorics (2)
- Complexity (2)
- Tropical geometry (2)
- 05B15 (1)
- 13P10-Gröbner bases; other bases for ideals and modules (1)
-
- 14T05 (1)
- 51-04 Explicit machine computation and programs (1)
- 62-07 (1)
- 62-09 (1)
- 68-04 (1)
- 91A44 (1)
- 92C20- Neural biology (1)
- Adinkra (1)
- Algebraic geometry (1)
- Bounds (1)
- Chip firing (1)
- Conjecture (1)
- Data analysis (1)
- Explicit machine computation and programs (1)
- Geometric tropicalization (1)
- Graph (1)
- Graphical methods (1)
- Hassett spaces (1)
- Hirsch (1)
- Jacobian (1)
- Linear algebra (1)
- Mathematics (1)
- Music (1)
- Polynomial (1)
- Puzzles (1)
Articles 1 - 10 of 10
Full-Text Articles in Mathematics
Random Tropical Curves, Magda L. Hlavacek
Random Tropical Curves, Magda L. Hlavacek
HMC Senior Theses
In the setting of tropical mathematics, geometric objects are rich with inherent combinatorial structure. For example, each polynomial $p(x,y)$ in the tropical setting corresponds to a tropical curve; these tropical curves correspond to unbounded graphs embedded in $\R^2$. Each of these graphs is dual to a particular subdivision of its Newton polytope; we classify tropical curves by combinatorial type based on these corresponding subdivisions. In this thesis, we aim to gain an understanding of the likeliness of the combinatorial type of a randomly chosen tropical curve by using methods from polytope geometry. We focus on tropical curves corresponding to quadratics, …
Complexity Of Linear Summary Statistics, Micah G. Pedrick
Complexity Of Linear Summary Statistics, Micah G. Pedrick
HMC Senior Theses
Families of linear functionals on a vector space that are mapped to each other by a group of symmetries of the space have a significant amount of structure. This results in computational redundancies which can be used to make computing the entire family of functionals at once more efficient than applying each in turn. This thesis explores asymptotic complexity results for a few such families: contingency tables and unranked choice data. These are used to explore the framework of Radon transform diagrams, which promise to allow general theorems about linear summary statistics to be stated and proved.
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 …
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
HMC Senior Theses
Supersymmetry is a theoretical model of particle physics that posits a symmetry between bosons and fermions. Supersymmetry proposes the existence of particles that we have not yet observed and through them, offers a more unified view of the universe. In the same way Feynman Diagrams represent Feynman Integrals describing subatomic particle behaviour, supersymmetry algebras can be represented by graphs called adinkras. In addition to being motivated by physics, these graphs are highly structured and mathematically interesting. No one has looked at the Jacobians of these graphs before, so we attempt to characterize them in this thesis. We compute Jacobians through …
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.
Toric Ideals, Polytopes, And Convex Neural Codes, Caitlin Lienkaemper
Toric Ideals, Polytopes, And Convex Neural Codes, Caitlin Lienkaemper
HMC Senior Theses
How does the brain encode the spatial structure of the external world?
A partial answer comes through place cells, hippocampal neurons which
become associated to approximately convex regions of the world known
as their place fields. When an organism is in the place field of some place
cell, that cell will fire at an increased rate. A neural code describes the set
of firing patterns observed in a set of neurons in terms of which subsets
fire together and which do not. If the neurons the code describes are place
cells, then the neural code gives some information about the …
Tropical Derivation Of Cohomology Ring Of Heavy/Light Hassett Spaces, Shiyue Li
Tropical Derivation Of Cohomology Ring Of Heavy/Light Hassett Spaces, Shiyue Li
HMC Senior Theses
The cohomology of moduli spaces of curves has been extensively studied in classical algebraic geometry. The emergent field of tropical geometry gives new views and combinatorial tools for treating these classical problems. In particular, we study the cohomology of heavy/light Hassett spaces, moduli spaces of heavy/light weighted stable curves, denoted as $\calm_{g, w}$ for a particular genus $g$ and a weight vector $w \in (0, 1]^n$ using tropical geometry. We survey and build on the work of \citet{Cavalieri2014}, which proved that tropical compactification is a \textit{wonderful} compactification of the complement of hyperplane arrangement for these heavy/light Hassett spaces. For $g …
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 …