Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Bipartite graphs. (1)
- Bonding Patterns (1)
- Convergence in expectation (1)
- Counting (1)
- Cryptanalysis (1)
-
- Cryptography (1)
- Customer satisfaction (1)
- Discrete logarithm (1)
- Dyson Equation (1)
- Elliptic Curves (1)
- Elliptic curve (1)
- Game theory (1)
- Gerrymandering (1)
- Guassian Unitary Ensemble (1)
- Ionization Potential (1)
- Knots (1)
- LDA (1)
- Latent topic (1)
- Latin squares (1)
- Lead Sulfide Quantum Dots (1)
- Markov chain (1)
- Mathematics (1)
- Minimum embeddings (1)
- Monte Carlo Numerical Integration (1)
- On-line (1)
- Operations Research (1)
- Optimization (1)
- Partitioning (1)
- Perceived value (1)
- Poset (1)
Articles 1 - 11 of 11
Full-Text Articles in Physical Sciences and Mathematics
Computational Investigation Of The Ionization Potential Of Lead Sulfide Quantum Dots, Jessica Beyer
Computational Investigation Of The Ionization Potential Of Lead Sulfide Quantum Dots, Jessica Beyer
Scripps Senior Theses
The purpose of this work was to determine the impact of quantum dot size on ionization potential and to determine how the presence of carbonyl-based ligands affect the ionization potential of lead sulfide quantum dot systems. Ionization potential (IP) is defined as the energy required to remove an electron from an atom, molecule, or material. IP helps scientists determine how reactive the material of interest is, which is crucial information when manufacturing nanomaterials. Accurate quantum chemical calculations of ionization potential are challenging due to the computational cost associated with the numerical solution of the Dyson equation. In this work, the …
Partially Filled Latin Squares, Mariam Abu-Adas
Partially Filled Latin Squares, Mariam Abu-Adas
Scripps Senior Theses
In this thesis, we analyze various types of Latin squares, their solvability and embeddings. We examine the results by M. Hall, P. Hall, Ryser and Evans first, and apply our understandings to develop an algorithm that the determines the minimum possible embedding of an unsolvable Latin square. We also study Latin squares with missing diagonals in detail.
Interpolating The Riemann Zeta Function In The P-Adics, Rebecca Mamlet
Interpolating The Riemann Zeta Function In The P-Adics, Rebecca Mamlet
Scripps Senior Theses
In this thesis, we develop the Kubota-Leopoldt Riemann zeta function in the p-adic integers. We follow Neil Koblitz's interpolation of Riemann zeta, using Bernoulli measures and p-adic integrals. The underlying goal is to better understand p-adic expansions and computations. We finish by connecting the Riemann zeta function to L-functions and their p-adic interpolations.
Random Matrix Theory: A Combinatorial Proof Of Wigner's Semicircle Law, Vanessa Wolf
Random Matrix Theory: A Combinatorial Proof Of Wigner's Semicircle Law, Vanessa Wolf
Scripps Senior Theses
A combinatorial proof of Wigner’s semicircle law for the Gaussian Unitary Ensemble (GUE) is presented using techniques from free probability. Motivating examples taken from the symmetric Bernoulli ensemble and the GUE show the distribution of eigenvalues of sample n x n matrices approaching Wigner’s semicircle as n get large. The concept of crossing and non-crossing pairings is developed, along with proofs of Wick’s Formula for real and complex Gaussians. It is shown that Wigner’s semicircle distribution has moments given by the Catalan numbers. Wick’s Formula and several additional lemmas (proved in sequence) lead to a "method of moments" proof that …
Stationary Distribution Of Recombination On 4x4 Grid Graph As It Relates To Gerrymandering, Camryn Hollarsmith
Stationary Distribution Of Recombination On 4x4 Grid Graph As It Relates To Gerrymandering, Camryn Hollarsmith
Scripps Senior Theses
A gerrymandered political districting plan is used to benefit a group seeking to elect more of their own officials into office. This practice happens at the city, county and state level. A gerrymandered plan can be strategically designed based on partisanship, race, and other factors. Gerrymandering poses a contradiction to the idea of “one person, one vote” ruled by the United States Supreme Court case Reynolds v. Sims (1964) because it values one demographic’s votes more than another’s, thus creating an unfair advantage and compromising American democracy. To prevent the practice of gerrymandering, we must know how to detect a …
Procuring Pediatric Vaccines In A Two-Economy Duopoly, Seongeun Lee, Susan E. Martonosi
Procuring Pediatric Vaccines In A Two-Economy Duopoly, Seongeun Lee, Susan E. Martonosi
Scripps Senior Theses
In this work, we aim to present an optimization model for vaccine pricing in a two-economy duopoly. This model observes the price dynamics between a high income country and a low income country that procure vaccinations through PAHO. This model is formulated to provide insights on optimal pricing strategy for PAHO to ultimately increase vaccine accessibility to low income countries. The objective is to satisfy the public demand at the lowest price possible, while providing enough profit for the vaccine manufacturers to stay in business. Using non-linear integer programming, the model results show that cross-subsidization occurs in PAHO vaccine procurement.
A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley
A Cryptographic Attack: Finding The Discrete Logarithm On Elliptic Curves Of Trace One, Tatiana Bradley
Scripps Senior Theses
The crux of elliptic curve cryptography, a popular mechanism for securing data, is an asymmetric problem. The elliptic curve discrete logarithm problem, as it is called, is hoped to be generally hard in one direction but not the other, and it is this asymmetry that makes it secure.
This paper describes the mathematics (and some of the computer science) necessary to understand and compute an attack on the elliptic curve discrete logarithm problem that works in a special case. The algorithm, proposed by Nigel Smart, renders the elliptic curve discrete logarithm problem easy in both directions for elliptic curves of …
Enhancement On Counting Invariant On Symmetric Virtual Biracks, Melinda Ho
Enhancement On Counting Invariant On Symmetric Virtual Biracks, Melinda Ho
Scripps Senior Theses
This thesis introduces a new enhancement for virtual birack counting invariants. We first introduce knots and other general types of knots (oriented knots, framed knots, racks, and biracks). Then we’ll discuss the methods, knot invariants, mathematicians use to identify whether two knots are different. Next we’ll look at knots with virtual crossings and knots with a good involution. Finally, we introduce a new symmetric enhancement for virtual birack counting invariants and provide an example.
Price, Perceived Value And Customer Satisfaction: A Text-Based Econometric Analysis Of Yelp! Reviews, Eleanor A. Dwyer
Price, Perceived Value And Customer Satisfaction: A Text-Based Econometric Analysis Of Yelp! Reviews, Eleanor A. Dwyer
Scripps Senior Theses
We examine the antecedents of customer satisfaction in the restaurant sector, paying particular attention to perceived value and price level. Using Latent Dirichlet Allocation, we extract latent topics from the text of Yelp! reviews, then analyze the relationship between these topics and satisfaction, measured as the difference between review rating and user average review rating.
Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden
Factoring The Duplication Map On Elliptic Curves For Use In Rank Computations, Tracy Layden
Scripps Senior Theses
This thesis examines the rank of elliptic curves. We first examine the correspondences between projective space and affine space, and use the projective point at infinity to establish the group law on elliptic curves. We prove a section of Mordell’s Theorem to establish that the abelian group of rational points on an elliptic curve is finitely generated. We then use homomorphisms established in our proof to find a formula for the rank, and then provide examples of computations.
Exploring The On-Line Partitioning Of Posets Problem, Leah F. Rosenbaum
Exploring The On-Line Partitioning Of Posets Problem, Leah F. Rosenbaum
Scripps Senior Theses
One question relating to partially ordered sets (posets) is that of partitioning or dividing the poset's elements into the fewest number of chains that span the poset. In 1950, Dilworth established that the width of the poset - the size of the largest set composed only of incomparable elements - is the minimum number of chains needed to partition that poset. Such a bound in on-line partitioning has been harder to establish, and work has evalutated classes of posets based on their width. This paper reviews the theorems that established val(2)=5 and illustrates them with examples. It also covers some …