Physical Sciences and Mathematics Commons^™

Birkhoff Summation Of Irrational Rotations: A Surprising Result For The Golden Mean, Heather Moore

University Honors Theses

This thesis presents a surprising result that the difference in a certain sums of constant rotations by the golden mean approaches exactly 1/5. Specifically, we focus on the Birkhoff sums of these rotations, with the number of terms equal to squared Fibonacci numbers. The proof relies on the properties of continued fraction approximants, Vajda's identity and the explicit formula for the Fibonacci numbers.

Understanding Waveguides In Resonance, Pieter Johannes Daniel Vandenberge

Dissertations and Theses

Several important classes of modern optical waveguides, including anti-resonant reflecting and photonic bandgap fibers, make use of geometries that guide energy in low refractive index material, a property that makes them of significant interest in numerous applications, notably including high-power delivery and guidance. These waveguides frequently exhibit resonance phenomena, in which their ability to propagate an input signal is sharply curtailed at particular operating frequencies. In this work we detail new advances in understanding these resonance effects and their implications for numerical modeling of these structures.

Part 1 focuses on the fields of slab waveguides, relatively simple structures for which …

Forest Generating Functions Of Directed Graphs, Ewan Joaquin Kummel

Dissertations and Theses

A spanning forest polynomial is a multivariate generating function whose variables are indexed over both the vertex and edge sets of a given directed graph. In this thesis, we establish a general framework to study spanning forest polynomials, associating them with a generalized Laplacian matrix and studying its properties. We introduce a novel proof of the famous matrix-tree theorem and show how this extends to a parametric generalization of the all-minors matrix-forest theorem. As an application, we derive explicit formulas for the recently introduced class of directed threshold graphs.

We prove that multivariate forest polynomials are, in general, irreducible and …

Survival Times And Investment Analysis With Dynamic Learning, Zhenzhen Li

Dissertations and Theses

The central statistical problem of survival analysis is to determine and characterize the conditional distribution of a survival time given a history of some observed health markers.

This dissertation contributes to the modeling of such conditional distributions in a setup where the health markers evolve randomly over time in a manner that can be represented by an Ito stochastic process, that is, a stochastic process that can be written as a sum of a time integral of some stochastic process and an Ito integral of some stochastic process, with both integrands subject to certain restrictions.

The random survival time is …

Policing By Proxy: Interrogating Big Tech's Role In Law Enforcement, Claire Elizabeth

University Honors Theses

Predictive policing, sometimes referred to as data-driven or actuarial policing, is a method of policing that uses a risk-based approach to law enforcement. For-profit technology companies market proprietary risk assessment algorithms to law enforcement organizations as tools meant to proactively mitigate crime. Using data collected from a vast array of sources, both personal and public, police are able to "predict" the likelihood of criminal activity in a given area using these algorithms. Proponents claim that risk assessment tools have the potential to fight crime with unbiased accuracy and speed by predicting when, where, and whom to police by relying on …

Equidistant Sets In Spaces Of Bounded Curvature, Logan Scott Fox

Dissertations and Theses

Given a metric space (X,d), and two nonempty subsets A,B ⊆ X, we study the properties of the set of points of equal distance to A and B, which we call the equidistant set E(A,B). In general, the structure of the equidistant set is quite unpredictable, so we look for conditions on the ambient space, as well as the given subsets, which lead to some regularity of the properties of the equidistant set. At a minimum, we will always require that X is path connected (so that E( …

Minimality Of Integer Bar Visibility Graphs, Emily Dehoff

University Honors Theses

A visibility representation is an association between the set of vertices in a graph and a set of objects in the plane such that two objects have an unobstructed, positive-width line of sight between them if and only if their two associated vertices are adjacent. In this paper, we focus on integer bar visibility graphs (IBVGs), which use horizontal line segments with integer endpoints to represent the vertices of a given graph. We present results on the exact widths of IBVGs of paths, cycles, and stars, and lower bounds on trees and general graphs. In our main results, we find …

Linear Nearest Neighbor Flocks With All Distinct Agents, Robert G. Lyons

Dissertations and Theses

This dissertation analyzes the global dynamics of 1-dimensional agent arrays with nearest neighbor linear couplings. The equations of motion are second order linear ODE's with constant coefficients. The novel part of this research is that the couplings are different for each agent. We allow the forces to depend on the relative position and relative velocity (damping terms) of the agents, and the coupling magnitudes differ for each agent. Further, we do not assume that the forces are "Newtonian'" (i.e., the force due to A on B equals minus the force of B on A) as this assumption does not apply …

An Analysis Of Capillary Flow In Finite Length Interior Corners, Samuel Shaw Mohler

Dissertations and Theses

We analyze the mathematical robustness of slow massively parallel interior corner flows in low gravity environments. An interior corner provides a preferential orientation in low gravity environments. This is a luxury usually only found on earth. It also provides a passive pumping mechanism due to geometry of a conduit. The driving force for this flow is a pressure difference due to local surface curvature gradients. An alternative reasoning is that due to the geometrical constraints the interior corner surface energy is unbounded below. This results in the liquid wicking into corners indefinitely. Interior corner flow's main quantity of interest is …

Functional Role Of The N-Terminal Domain In Connexin 46/50 By In Silico Mutagenesis And Molecular Dynamics Simulation, Umair Khan

University Honors Theses

Connexins form intercellular channels known as gap junctions that facilitate diverse physiological roles, from long-range electrical and chemical coupling to nutrient exchange. Recent structural studies on Cx46 and Cx50 have defined a novel and stable open state and implicated the amino-terminal (NT) domain as a major contributor to functional differences between connexin isoforms. This thesis presents two studies which use molecular dynamics simulations with these new structures to provide mechanistic insight into the function and behavior of the NTH in Cx46 and Cx50. In the first, residues in the NTH that differ between Cx46 and Cx50 are swapped between the …

Numerical Techniques And Simulations For Studying Various High Power Optical Fiber Amplifiers, Particularly For Ytterbium (Yb+3), And Thulium (Tm+3) Doped Fibers, Tathagata Goswami

Dissertations and Theses

In this dissertation we present a simplified scalar numerical model, derived from Maxwell's field equations, for the fiber laser amplifier simulations. Maxwell's equations are reduced using a technique called Coupled Mode Theory (CMT).

The reduced model is made more efficient through a new scale model, referred to as an equivalent short fiber, which captures some of the essential characteristics of a longer fiber. The equivalent short fiber can be viewed as a fiber made using artificial (nonphysical) material properties that in some sense compensates for its reduced length. The computations can be accelerated by a factor approximately equal to the …

Spanning Trees Of Complete Graphs And Cycles, Minjin Enkhjargal

University Honors Theses

Spanning trees are typically used to solve least path problems for finding the minimal spanning tree of a graph. Given a number t ≥ 3 what is the least number n = α(t) such that there exists a graph on n vertices having precisely t spanning trees? Specifically, how will the factoring of t with the use of cycles connected by one vertex affect α(t)? Lower and upper bounds of α(t) are graphed by using properties of cycles and complete graphs. The upper bound of α(t) is then improved by constructing a graph of connected cycles {C_p1, C­ …

Group Theory Visualized Through The Rubik's Cube, Ashlyn Okamoto

University Honors Theses

In my thesis, I describe the work done to implement several Group Theory concepts in the context of the Rubik’s cube. A simulation of the cube was constructed using Processing-Java and with help from a YouTube series done by TheCodingTrain. I reflect on the struggles and difficulties that came with creating this program along with the inspiration behind the project. The concepts that are currently implemented at this time are: Identity, Associativity, Order, and Inverses. The functionality of the cube is described as it moves like a regular cube but has extra keypresses that demonstrate the concepts listed. Each concept …

A Posteriori Error Estimates For Maxwell's Equations Using Auxiliary Subspace Techniques, Ahmed El Sakori

Dissertations and Theses

The aim of our work is to construct provably efficient and reliable error estimates of discretization error for Nédélec (edge) element discretizations of Maxwell's equations on tetrahedral meshes. Our general approach for estimating the discretization error is to compute an approximate error function by solving an associated problem in an auxiliary space that is chosen so that:

-Efficiency and reliability results for the computed error estimates can be established under reasonable and verifiable assumptions.

-The linear system used to compute the approximate error function has condition number bounded independently of the discretization parameter.

In many applications, it is some functional …

Guided Reinvention As A Context For Investigating Students' Thinking About Mathematical Language And For Supporting Students In Gaining Fluency, Kristen Vroom

Dissertations and Theses

Fluency with mathematical language is important for students' engagement in many disciplinary practices such as defining, conjecturing, and proving; yet, there is growing evidence that mathematical language is challenging for undergraduate students. This dissertation study draws on two design experiments with pairs of students who were supported to encode their mathematical meanings with more formal language. I aimed to investigate the teaching and learning of mathematical language, and particularly the language in statements with multiple quantifiers, by engaging students in this type of activity. In the first paper, I investigated the complex ways in which the students in my study …

Convex And Nonconvex Optimization Techniques For Multifacility Location And Clustering, Tuyen Dang Thanh Tran

Dissertations and Theses

This thesis contains contributions in two main areas: calculus rules for generalized differentiation and optimization methods for solving nonsmooth nonconvex problems with applications to multifacility location and clustering. A variational geometric approach is used for developing calculus rules for subgradients and Fenchel conjugates of convex functions that are not necessarily differentiable in locally convex topological and Banach spaces. These calculus rules are useful for further applications to nonsmooth optimization from both theoretical and numerical aspects. Next, we consider optimization methods for solving nonsmooth optimization problems in which the objective functions are not necessarily convex. We particularly focus on the class …

On Dc And Local Dc Functions, Liam Jemison

University Honors Theses

In this project we investigate the class of functions which can be represented by a difference of convex functions, hereafter referred to simply as 'DC' functions. DC functions are of interest in optimization because they allow the use of convex optimization techniques in certain non-convex problems. We present known results about DC and locally DC functions, including detailed proofs of important theorems by Hartman and Vesely.

We also investigate the DCA algorithm for optimizing DC functions and implement it to solve the support vector machine problem.

Laurent Series Expansion And Its Applications, Anna Sobczyk

University Honors Theses

The Laurent expansion is a well-known topic in complex analysis for its application in obtaining residues of complex functions around their singularities. Computing the Laurent series of a function around its singularities turns out to be an efficient way to determine the residue of the function as well as to compute the integral of the function along any closed curves around its singularities. Based on the theory of the Laurent series, this paper provides several working examples where the Laurent series of a function is determined and then used to calculate the integral of the function along any closed curve …

Leveraging Model Flexibility And Deep Structure: Non-Parametric And Deep Models For Computer Vision Processes With Applications To Deep Model Compression, Anthony D. Rhodes

Dissertations and Theses

My dissertation presents several new algorithms incorporating non-parametric and deep learning approaches for computer vision and related tasks, including object localization, object tracking and model compression. With respect to object localization, I introduce a method to perform active localization by modeling spatial and other relationships between objects in a coherent "visual situation" using a set of probability distributions. I further refine this approach with the Multipole Density Estimation with Importance Clustering (MIC-Situate) algorithm. Next, I formulate active, "situation" object search as a Bayesian optimization problem using Gaussian Processes. Using my Gaussian Process Context Situation Learning (GP-CL) algorithm, I demonstrate improved …

Modeling And Visualizing Power Amplification In Fiber Optic Cables, Gil Parnon

University Honors Theses

Transverse mode instability in fiber optic cables causes power amplification to exhibit chaotic behavior. Due to this, numerical modeling of fiber optic power amplification is extremely computationally expensive. In this paper I work through modeling similar behavior in a simpler system. I also visualize the three-dimensional phase portrait of the system in order to better understand the behavior and hopefully relate it to more well-understood problems.

Dictionary Learning For Image Reconstruction Via Numerical Non-Convex Optimization Methods, Lewis M. Hicks

University Honors Theses

This thesis explores image dictionary learning via non-convex (difference of convex, DC) programming and its applications to image reconstruction. First, the image reconstruction problem is detailed and solutions are presented. Each such solution requires an image dictionary to be specified directly or to be learned via non-convex programming. The solutions explored are the DCA (DC algorithm) and the boosted DCA. These various forms of dictionary learning are then compared on the basis of both image reconstruction accuracy and number of iterations required to converge.

Necessary Conditions For Stability Of Vehicle Formations, Pablo Enrique Baldivieso Blanco

Dissertations and Theses

Necessary conditions for stability of coupled autonomous vehicles in R are established in this thesis. The focus is on linear arrays with decentralized vehicles, where each vehicle interacts with only a few of its neighbors. Decentralized means that there is no central authority governing the motion. Instead, each vehicle registers only velocity and position relative to itself and bases its acceleration only on those data. Explicit expressions are obtained for necessary conditions for asymptotic stability in the cases that a system consists of a periodic arrangement of two or three different types of vehicles, i.e. configurations as follows: ...2-1-2-1 or …

Counting And Coloring Sudoku Graphs, Kyle Oddson

Mathematics and Statistics Dissertations, Theses, and Final Project Papers

A sudoku puzzle is most commonly a 9 × 9 grid of 3 × 3 boxes wherein the puzzle player writes the numbers 1 - 9 with no repetition in any row, column, or box. We generalize the notion of the n² × n² sudoku grid for all n ϵ Z ^≥2 and codify the empty sudoku board as a graph. In the main section of this paper we prove that sudoku boards and sudoku graphs exist for all such n we prove the equivalence of [3]'s construction using unions and products of graphs to the definition of …

A New Finite Difference Time Domain Method To Solve Maxwell's Equations, Timothy P. Meagher

Dissertations and Theses

We have constructed a new finite-difference time-domain (FDTD) method in this project. Our new algorithm focuses on the most important and more challenging transverse electric (TE) case. In this case, the electric field is discontinuous across the interface between different dielectric media. We use an electric permittivity that stays as a constant in each medium, and magnetic permittivity that is constant in the whole domain. To handle the interface between different media, we introduce new effective permittivities that incorporates electromagnetic fields boundary conditions. That is, across the interface between two different media, the tangential component, E_r(x,y), …

Generalized Differential Calculus And Applications To Optimization, R. Blake Rector

Dissertations and Theses

This thesis contains contributions in three areas: the theory of generalized calculus, numerical algorithms for operations research, and applications of optimization to problems in modern electric power systems. A geometric approach is used to advance the theory and tools used for studying generalized notions of derivatives for nonsmooth functions. These advances specifically pertain to methods for calculating subdifferentials and to expanding our understanding of a certain notion of derivative of set-valued maps, called the coderivative, in infinite dimensions. A strong understanding of the subdifferential is essential for numerical optimization algorithms, which are developed and applied to nonsmooth problems in operations …

Computational Algorithms For Improved Representation Of The Model Error Covariance In Weak-Constraint 4d-Var, Jeremy A. Shaw

Dissertations and Theses

Four-dimensional variational data assimilation (4D-Var) provides an estimate to the state of a dynamical system through the minimization of a cost functional that measures the distance to a prior state (background) estimate and observations over a time window. The analysis fit to each information input component is determined by the specification of the error covariance matrices in the data assimilation system (DAS). Weak-constraint 4D-Var (w4D-Var) provides a theoretical framework to account for modeling errors in the analysis scheme. In addition to the specification of the background error covariance matrix, the w4D-Var formulation requires information on the model error statistics and …

Orthomorphisms Of Boolean Groups, Nichole Louise Schimanski

Dissertations and Theses

An orthomorphism, π, of a group, (G, +), is a permutation of G with the property that the map x → -x + π(x) is also a permutation. In this paper, we consider orthomorphisms of the additive group of binary n-tuples, Zⁿ₂. We use known orthomorphism preserving functions to prove a uniformity in the cycle types of orthomorphisms that extend certain partial orthomorphisms, and prove that extensions of particular sizes of partial orthomorphisms exist. Further, in studying the action of conjugating orthomorphisms by automorphisms, we find several symmetries within the orbits and stabilizers of this action, and …

Tree Graphs And Orthogonal Spanning Tree Decompositions, James Raymond Mahoney

Dissertations and Theses

Given a graph G, we construct T(G), called the tree graph of G. The vertices of T(G) are the spanning trees of G, with edges between vertices when their respective spanning trees differ only by a single edge. In this paper we detail many new results concerning tree graphs, involving topics such as clique decomposition, planarity, and automorphism groups. We also investigate and present a number of new results on orthogonal tree decompositions of complete graphs.

The Design And Validation Of A Group Theory Concept Inventory, Kathleen Mary Melhuish

Dissertations and Theses

Within undergraduate mathematics education, there are few validated instruments designed for large-scale usage. The Group Concept Inventory (GCI) was created as an instrument to evaluate student conceptions related to introductory group theory topics. The inventory was created in three phases: domain analysis, question creation, and field-testing. The domain analysis phase included using an expert consensus protocol to arrive at the topics to be assessed, analyzing curriculum, and reviewing literature. From this analysis, items were created, evaluated, and field-tested. First, 383 students answered open-ended versions of the question set. The questions were converted to multiple-choice format from these responses and disseminated …

An Investigation Of The Role Of Alternate Numeration Systems In Preservice Teacher Mathematics Content Courses, Jodi I. Fasteen

Dissertations and Theses

Alternate numeration systems are common in preservice teacher (PST) mathematics curricula, but there is limited research on how to leverage alternate systems to promote the development of mathematical knowledge for teaching. I analyzed the role of alternate numeration systems in three ways. I conducted a thematic analysis of current PST textbooks to consider the role of alternate numeration systems in written curricula. I conducted a teaching experiment to analyze PSTs' mathematical activity as they engaged with a base five task sequence to reinvent an algorithm for multiplication. And I introduced problematizing mathematical contexts as a design heuristic, situating this within …