Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- 05A10 (1)
- 05A19 (1)
- 05C09 (1)
- 11B37 (1)
- 14H50 (1)
-
- 14T05 (1)
- 37N25 Dynamical systems in biology (1)
- 51N35 (1)
- 54H99 (1)
- 57R25 (1)
- 60K40 Other physical applications of random processes (1)
- 92C60 Medical epidemiology (1)
- Algebra (1)
- Binomial coefficients (1)
- Category theory (1)
- Coherence (1)
- Combinatorial identities (1)
- Combinatorics (1)
- Gauss codes (1)
- General topology (1)
- Graphical indices (1)
- Interpolation Jack polynomial (1)
- Interpolation polynomial (1)
- Knots (1)
- Lie algebras (1)
- Mac Lane (1)
- Monoidal categories (1)
- Plane and space curves (1)
- Questions of classical algebraic geometry (1)
- Recurrences (1)
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
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.
Use Of Kalman Filtering In State And Parameter Estimation Of Diabetes Models, Cassidy Le
Use Of Kalman Filtering In State And Parameter Estimation Of Diabetes Models, Cassidy Le
HMC Senior Theses
Diabetes continues to affect many lives every year, putting those affected by it at higher risk of serious health issues. Despite many efforts, there currently is no cure for diabetes. Nevertheless, researchers continue to study diabetes in hopes of understanding the disease and how it affects people, creating mathematical models to simulate the onset and progression of diabetes. Recent research by David J. Albers, Matthew E. Levine, Andrew Stuart, Lena Mamykina, Bruce Gluckman, and George Hripcsak1 has suggested that these models can be furthered through the use of Data Assimilation, a regression method that synchronizes a model with a …
On The Mysteries Of Interpolation Jack Polynomials, Havi Ellers
On The Mysteries Of Interpolation Jack Polynomials, Havi Ellers
HMC Senior Theses
Interpolation Jack polynomials are certain symmetric polynomials in N variables with coefficients that are rational functions in another parameter k, indexed by partitions of length at most N. Introduced first in 1996 by F. Knop and S. Sahi, and later studied extensively by Sahi, Knop-Sahi, and Okounkov-Olshanski, they have interesting connections to the representation theory of Lie algebras. Given an interpolation Jack polynomial we would like to differentiate it with respect to the variable k and write the result as a linear combination of other interpolation Jack polynomials where the coefficients are again rational functions in k. In this …
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 …
An Exploration Of Combinatorial Interpretations For Fibonomial Coefficients, Richard Shapley
An Exploration Of Combinatorial Interpretations For Fibonomial Coefficients, Richard Shapley
HMC Senior Theses
We can define Fibonomial coefficients as an analogue to binomial coefficients as F(n,k) = FnFn-1 … Fn-k+1 / FkFk-1…F1, where Fn represents the nth Fibonacci number. Like binomial coefficients, there are many identities for Fibonomial coefficients that have been proven algebraically. However, most of these identities have eluded combinatorial proofs.
Sagan and Savage (2010) first presented a combinatorial interpretation for these Fibonomial coefficients. More recently, Bennett et al. (2018) provided yet another interpretation, that is perhaps more tractable. However, there still has been little progress towards using these interpretations …
A Coherent Proof Of Mac Lane's Coherence Theorem, Luke Trujillo
A Coherent Proof Of Mac Lane's Coherence Theorem, Luke Trujillo
HMC Senior Theses
Mac Lane’s Coherence Theorem is a subtle, foundational characterization of monoidal categories, a categorical concept which is now an important and popular tool in areas of pure mathematics and theoretical physics. Mac Lane’s original proof, while extremely clever, is written somewhat confusingly. Many years later, there still does not exist a fully complete and clearly written version of Mac Lane’s proof anywhere, which is unfortunate as Mac Lane’s proof provides very deep insight into the nature of monoidal categories. In this thesis, we provide brief introductions to category theory and monoidal categories, and we offer a precise, clear development of …