Mathematics Commons^™

A History Of The Hurwitz Problem Concerning Branched Coverings, James Alexander Byars

Boise State University Theses and Dissertations

From a d-sheeted branched covering f : M → N, where M and N are surfaces, one can read off the branch datum

D(f) = {M, N, d, (A₁, . . . , A_r)},

where A_i = [e_i1, . . . , e_{in_i}] is a partition of d. Furthermore, a relationship between the Euler characteristics between M and N is known, called the Riemann-Hurwitz formula

��(M) = d��(N) − v(D(f …

Matrix Completion Problems For The Positiveness And Contraction Through Graphs, Louis C. Christopher

Theses and Dissertations

In this work, we study contractive and positive real matrix completion problems which are motivated in part by studies on sparce (or dense) matrices for weighted sparse recovery problems and rating matrices with rating density in recommender systems. Matrix completions problems also have many applications in probability and statistics, chemistry, numerical analysis (e.g. optimization), electrical engineering, and geophysics. In this paper we seek to connect the contractive and positive completion property to a graph theoretic property. We then answer whether the graphs of real symmetric matrices having loops at every vertex have the contractive completion property if and only if …

Constructing Hyperbolic Polygons In The Poincaré Disk, Akram Zakaria Samweil

Electronic Theses, Projects, and Dissertations

The Poincaré Disk plays a significant role in non-Euclidean geometry. Inverting points, segments, or polygons through a circle provides us with a deep vision of the link between Euclidean and non-Euclidean geometry; especially when we try to prove lemmas, constructions, or conjectures. All points inside a circle, c, represent a Poincaré Disk denoted D_c, and all "lines" in a Poincaré Disk are d-lines, which are circles orthogonal to the circle's boundary. The question that motivated my research is: how can we use the properties of the disk, its boundary, and its d-lines to construct hyperbolic polygons? We will …

A Machine Learning Approach To Constructing Ramsey Graphs Leads To The Trahtenbrot-Zykov Problem., Emily Hawboldt

Electronic Theses and Dissertations

Attempts at approaching the well-known and difficult problem of constructing Ramsey graphs via machine learning lead to another difficult problem posed by Zykov in 1963 (now commonly referred to as the Trahtenbrot-Zykov problem): For which graphs F does there exist some graph G such that the neighborhood of every vertex in G induces a subgraph isomorphic to F? Chapter 1 provides a brief introduction to graph theory. Chapter 2 introduces Ramsey theory for graphs. Chapter 3 details a reinforcement learning implementation for Ramsey graph construction. The implementation is based on board game software, specifically the AlphaZero program and its …

Stability Of Cauchy's Equation On Δ+., Holden Wells

Electronic Theses and Dissertations

The most famous functional equation f(x+y)=f(x)+f(y) known as Cauchy's equation due to its appearance in the seminal analysis text Cours d'Analyse (Cauchy 1821), was used to understand fundamental aspects of the real numbers and the importance of regularity assumptions in mathematical analysis. Since then, the equation has been abstracted and examined in many contexts. One such examination, introduced by Stanislaw Ulam and furthered by Donald Hyers, was that of stability. Hyers demonstrated that Cauchy's equation exhibited stability over Banach Spaces in the following sense: functions that approximately satisfy Cauchy's equation are approximated with the same level of error by functions …

Algebraic And Integral Closure Of A Polynomial Ring In Its Power Series Ring, Joseph Swanson

All Dissertations

Let R be a domain. We look at the algebraic and integral closure of a polynomial ring, R[x], in its power series ring, R[[x]]. A power series α(x) ∈ R[[x]] is said to be an algebraic power series if there exists F (x, y) ∈ R[x][y] such that F (x, α(x)) = 0, where F (x, y) ̸ = 0. If F (x, y) is monic, then α(x) is said to be an integral power series. We characterize the units of algebraic and integral power series. We show that the only algebraic power series with infinite radii of convergence are …

Recovering Coefficients Of Second-Order Hyperbolic And Plate Equations Via Finite Measurements On The Boundary, Scott Randall Scruggs

All Dissertations

Abstract In this dissertation, we consider the inverse problem for a second-order hyperbolic equation of recovering n + 3 unknown coefficients defined on an open bounded domain with a smooth enough boundary. We also consider the inverse problem of recovering an unknown coefficient on the Euler- Bernoulli plate equation on a lower-order term again defined on an open bounded domain with a smooth enough boundary. For the second-order hyperbolic equation, we show that we can uniquely and (Lipschitz) stably recover all these coefficients from only using half of the corresponding boundary measurements of their solutions, and for the plate equation, …

Stressor: An R Package For Benchmarking Machine Learning Models, Samuel A. Haycock

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

Many discipline specific researchers need a way to quickly compare the accuracy of their predictive models to other alternatives. However, many of these researchers are not experienced with multiple programming languages. Python has recently been the leader in machine learning functionality, which includes the PyCaret library that allows users to develop high-performing machine learning models with only a few lines of code. The goal of the stressor package is to help users of the R programming language access the advantages of PyCaret without having to learn Python. This allows the user to leverage R’s powerful data analysis workflows, while simultaneously …

Dna Self-Assembly Of Trapezohedral Graphs, Hytham Abdelkarim

Electronic Theses, Projects, and Dissertations

Self-assembly is the process of a collection of components combining to form an organized structure without external direction. DNA self-assembly uses multi-armed DNA molecules as the component building blocks. It is desirable to minimize the material used and to minimize genetic waste in the assembly process. We will be using graph theory as a tool to find optimal solutions to problems in DNA self-assembly. The goal of this research is to develop a method or algorithm that will produce optimal tile sets which will self-assemble into a target DNA complex. We will minimize the number of tile and bond-edge types …

Association Of Lockdown Policies With Covid-19 Early Case Growth Rates In The United States, Anna Barefield

Boise State University Theses and Dissertations

The COVID-19 pandemic has impacted essentially the entire globe, infecting over 755 million people worldwide and resulting in over 6.8 million deaths to date. Different countries have had varying levels of success in managing the spread of the pandemic, and the success or lack thereof could be explained by the impact of government intervention, such as lockdown policies, mask mandates, and social distancing advisories. The United States responded particularly poorly to the early pandemic outbreak as compared to other similar countries, due to its lack of coordinated planning to implement effective policies, with large variations in action taken by each …

An Interval-Valued Random Forests, Paul Gaona Partida

All Graduate Theses and Dissertations, Spring 1920 to Summer 2023

There is a growing demand for the development of new statistical models and the refinement of established methods to accommodate different data structures. This need arises from the recognition that traditional statistics often assume the value of each observation to be precise, which may not hold true in many real-world scenarios. Factors such as the collection process and technological advancements can introduce imprecision and uncertainty into the data.

For example, consider data collected over a long period of time, where newer measurement tools may offer greater accuracy and provide more information than previous methods. In such cases, it becomes crucial …

Empowering 5g Mmwave: Leveraging Kml Placemarks For Enhanced Rf Design And Deployment Efficiency, Gustavo A. Fernandez

School of Mathematical & Statistical Sciences Faculty Publications

This publication explores the significance of Keyhole Markup Language (KML) in telecommunications, particularly in the context of 5G mmWave RF design and planning. With the advent of 5G mmWave technology, the demand for seamless and efficient network deployments has never been greater. The deployment of small cells and repeaters for 5G mmWave necessitates utmost precision in location accuracy and rapid information exchange during site surveys and evaluations. The challenges of mmWave frequencies, including their limited range and susceptibility to attenuation, intensify the complexity and criticality of this process. Network operators must ensure that the chosen location is devoid of obstacles …

Idempotent Completions Of Equivariant Matrix Factorization Categories, Michael K. Brown, Mark E. Walker

Department of Mathematics: Faculty Publications

We prove that equivariant matrix factorization categories associated to henselian local hypersurface rings are idempotent complete, generalizing a result of Dyckerhoff in the non- equivariant case.

A Dilation Theoretic Approach To Approximation By Inner Functions, Daniel Alpay, Tirthankar Bhattacharyya, Abhay Jindal, Poornendu Kumar

Mathematics, Physics, and Computer Science Faculty Articles and Research

Using results from the theory of operators on a Hilbert space, we prove approximation results for matrix-valued holomorphic functions on the unit disc and the unit bidisc. The essential tools are the theory of unitary dilation of a contraction and the realization formula for functions in the unit ball of . We first prove a generalization of a result of Carathéodory. This generalization has many applications. A uniform approximation result for matrix-valued holomorphic functions which extend continuously to the unit circle is proved using the Potapov factorization. This generalizes a theorem due to Fisher. Approximation results are proved for matrix-valued …

Geometric Curves From P-Circles, Isaiah Dempsey, Bill Wood

Summer Undergraduate Research Program (SURP) Symposium

p-Circles are a generalization of the usual circle satisfying the equation |x|^p + |y|^p = 1. The 1-circle is the square with vertices (1,0),(0,1),(-1,0),(0,-1). As p goes to infinity the p-circle equation becomes max(|x|, |y|) = 1. So the ∞-circle is the square with vertices (1,1),(-1,1),(-1,-1),(1,-1). From 1≤p≤2 the p-circle smoothly transforms from a square to a circle, and from 2≤p≤∞ the p-circle smoothly transforms from a circle to a square.

Analysis On The Fluctuations In Port Demand Caused By The Change In International Trade Of The Countries Along The 21st Century Maritime Silk Road : Take The Asean Countries For Example, Ziyi Shu

World Maritime University Dissertations

No abstract provided.

Study On The Construction Of Public Information Platform For International Multimodal Transport : A Case Study Of Shanghai, Yijie Chen

World Maritime University Dissertations

No abstract provided.

Study On Overcapacity Of Liner Shipping : On The Transpacific Routes, Yuxin Pu

World Maritime University Dissertations

No abstract provided.

Research On Investment Risk And Decision Making In Dry Bulk Ships : Case Study Nijie Shipping World Limited, Mingyu Xu

World Maritime University Dissertations

No abstract provided.

The Attempt And Operation Of Container Sharing Platform In The Yangtze River Delta : Efficient Transfer Of Empty Containers And Resources Sharing, Yifei Wei

World Maritime University Dissertations

No abstract provided.