Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Mathematics (11)
- Discrete Mathematics and Combinatorics (6)
- Algebra (5)
- Applied Mathematics (3)
- Other Mathematics (3)
-
- Computer Sciences (2)
- Number Theory (2)
- Partial Differential Equations (2)
- Statistics and Probability (2)
- Algebraic Geometry (1)
- Artificial Intelligence and Robotics (1)
- Data Science (1)
- Dynamic Systems (1)
- Dynamical Systems (1)
- Education (1)
- Education Economics (1)
- Engineering (1)
- Fluid Dynamics (1)
- Geometry and Topology (1)
- Graphics and Human Computer Interfaces (1)
- Harmonic Analysis and Representation (1)
- Operational Research (1)
- Operations Research, Systems Engineering and Industrial Engineering (1)
- Ordinary Differential Equations and Applied Dynamics (1)
- Physics (1)
- Social Justice (1)
- Social and Behavioral Sciences (1)
- Statistical Models (1)
- Vital and Health Statistics (1)
- Keyword
-
- Algebraic combinatorics (2)
- 00A69 - general applied mathematics (1)
- 05 (1)
- 05-02 (1)
- 05A05 (1)
-
- 05C81 - random walks on graphs (1)
- 05Cxx Graph theory (1)
- 05E (1)
- 05E10 (1)
- 11A67 (1)
- 11B39 (1)
- 20B30 (1)
- 34K60 (1)
- 35K57 Reaction-diffusion equations (1)
- 52-XX Convex and discrete geometry (1)
- 57-XX Manifolds and cell complexes (1)
- 60E05 (1)
- 65N35 Spectral (1)
- 68R05 (1)
- 76D05 Navier-Stokes equations for incompressible viscous fluids (1)
- 90C31 - sensitivity and stability (1)
- 91D30 (1)
- Abstract Algebra (1)
- Algebraic Geometry (1)
- Brownian Motion (1)
- Collocation and related methods for boundary value problems involving PDEs (1)
- Combinatorial aspects of representation theory (1)
- Combinatorics (1)
- Combinatorics in computer science (1)
- Complex Multiplication (1)
Articles 1 - 12 of 12
Full-Text Articles in Entire DC Network
Generalized Far-Difference Representations, Prakod Ngamlamai
Generalized Far-Difference Representations, Prakod Ngamlamai
HMC Senior Theses
Integers are often represented as a base-$b$ representation by the sum $\sum c_ib^i$. Lekkerkerker and Zeckendorf later provided the rules for representing integers as the sum of Fibonacci numbers. Hannah Alpert then introduced the far-difference representation by providing rules for writing an integer with both positive and negative multiples of Fibonacci numbers. Our work aims to generalize her work to a broader family of linear recurrences. To do so, we describe desired properties of the representations, such as lexicographic ordering, and provide a family of algorithms for each linear recurrence that generate unique representations for any integer. We then prove …
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.
The Sensitivity Of A Laplacian Family Of Ranking Methods, Claire S. Chang
The Sensitivity Of A Laplacian Family Of Ranking Methods, Claire S. Chang
HMC Senior Theses
Ranking from pairwise comparisons is a particularly rich subset of ranking problems. In this work, we focus on a family of ranking methods for pairwise comparisons which encompasses the well-known Massey, Colley, and Markov methods. We will accomplish two objectives to deepen our understanding of this family. First, we will consider its network diffusion interpretation. Second, we will analyze its sensitivity by studying the "maximal upset" where the direction of an arc between the highest and lowest ranked alternatives is flipped. Through these analyses, we will build intuition to answer the question "What are the characteristics of robust ranking methods?" …
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 …
Modeling Self-Diffusiophoretic Janus Particles In Fluid, Kausik Das
Modeling Self-Diffusiophoretic Janus Particles In Fluid, Kausik Das
HMC Senior Theses
We explore spherical Janus particles in which a chemical reaction occurs on one face, depleting a substrate in the suspending fluid, while no reaction occurs on the other face. The steady state concentration field is governed by Laplace’s equation with mixed boundary conditions. We use the collocation method to obtain numerical solutions to the equation in spherical coordinates. The asymmetry of the reaction gives rise to a slip velocity that causes the particle to move spontaneously in the fluid through a process known as self-diffusiophoresis. Using the Lorentz reciprocal theorem, we obtain the swimming velocity of the particle. We extend …
Explorations In Well-Rounded Lattices, Tanis Nielsen
Explorations In Well-Rounded Lattices, Tanis Nielsen
HMC Senior Theses
Lattices are discrete subgroups of Euclidean spaces. Analogously to vector spaces, they can be described as spans of collections of linearly independent vectors, but with integer (instead of real) coefficients. Lattices have many fascinating geometric properties and numerous applications, and lattice theory is a rich and active field of theoretical work. In this thesis, we present an introduction to the theory of Euclidean lattices, along with an overview of some major unsolved problems, such as sphere packing. We then describe several more specialized topics, including prior work on well-rounded ideal lattices and some preliminary results on the study of planar …
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.
Long Increasing Subsequences, Hannah Friedman
Long Increasing Subsequences, Hannah Friedman
HMC Senior Theses
In my thesis, I investigate long increasing subsequences of permutations from two angles. Motivated by studying interpretations of the longest increasing subsequence statistic across different representations of permutations, we investigate the relationship between reduced words for permutations and their RSK tableaux in Chapter 3. In Chapter 4, we use permutations with long increasing subsequences to construct a basis for the space of ��-local functions.
Permutations, Representations, And Partition Algebras: A Random Walk Through Algebraic Statistics, Ian Shors
Permutations, Representations, And Partition Algebras: A Random Walk Through Algebraic Statistics, Ian Shors
HMC Senior Theses
My thesis examines a class of functions on the symmetric group called permutation statistics using tools from representation theory. In 2014, Axel Hultman gave formulas for computing expected values of permutation statistics sampled via random walks. I present analogous formulas for computing variances of these statistics involving Kronecker coefficients – certain numbers that arise in the representation theory of the symmetric group. I also explore deep connections between the study of moments of permutation statistics and the representation theory of the partition algebras, a family of algebras introduced by Paul Martin in 1991. By harnessing these partition algebras, I derive …
Graph Learning On Multi-Modality Medical Data To Generate Clinical Predictions, Justin Jiang
Graph Learning On Multi-Modality Medical Data To Generate Clinical Predictions, Justin Jiang
HMC Senior Theses
There exist petabytes of data pertaining to medical visits – everything from blood pressure recordings, X-rays, and doctor’s notes. Electronic health records (EHRs) organize this data into databases, providing an exciting opportunity for machine learning researchers to dive deeper into analyzing human health. There already exist machine learning models that aim to expedite the process of hospital visits; for example, summary models can digest a patient’s medical history and highlight certain parts of their past that merit attention. The current frontier of medical machine learning is combining the various formats of data to generate a clinical prediction – much like …
A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman
A Visual Tour Of Dynamical Systems On Color Space, Jonathan Maltsman
HMC Senior Theses
We can think of a pixel as a particle in three dimensional space, where its x, y and z coordinates correspond to its level of red, green, and blue, respectively. Just as a particle’s motion is guided by physical rules like gravity, we can construct rules to guide a pixel’s motion through color space. We can develop striking visuals by applying these rules, called dynamical systems, onto images using animation engines. This project explores a number of these systems while exposing the underlying algebraic structure of color space. We also build and demonstrate a Visual DJ circuit board for …
An Inquiry Into Lorentzian Polynomials, Tomás Aguilar-Fraga
An Inquiry Into Lorentzian Polynomials, Tomás Aguilar-Fraga
HMC Senior Theses
In combinatorics, it is often desirable to show that a sequence is unimodal. One method of establishing this is by proving the stronger yet easier-to-prove condition of being log-concave, or even ultra-log-concave. In 2019, Petter Brändén and June Huh introduced the concept of Lorentzian polynomials, an exciting new tool which can help show that ultra-log-concavity holds in specific cases. My thesis investigates these Lorentzian polynomials, asking in which situations they are broadly useful. It covers topics such as matroid theory, discrete convexity, and Mason’s conjecture, a long-standing open problem in matroid theory. In addition, we discuss interesting applications to known …