Geometry and Topology Commons^™

The Isoperimetric Inequality And Wirtinger’S Inequality, Mason Neal

Honors Theses

In this thesis, we present Hurwitz’s proof of the Isoperimetric Inequality, which roughly states that the area enclosed by a simple closed curve is always less than or equal to the area of a circle with the same perimeter. Hurwitz’s proof relies on Wirtinger’s Inequality. We survey results about periodic functions and Fourier series, and we use them to provide a proof of Wirtinger’s Inequality. We then give a new proof of a variant of Wirtinger’s Inequality due to Alzer and generalize this variant to higher powers.

Unique Combinations Of Packing Integer Squares, Keith M. Dreiling, Austin Leanna, William Mooney

SACAD: Scholarly Activities

This research investigates a function, informally named WAK(x), that describes the number of ways to divide an integer square into integer subsquares counting only the list of parts. Previous research has shown values up to 28, though finding these values is computationally complex and requires a long runtime using computer algorithms. We attempt to find patterns in the values and many aspects of the values, hoping to find a general solution. We are unsure if a solution exists, but we have ideas for how to move forward in finding a solution.

Arrangements Of N Planes Resulting In One Bounded Tetrahedral Chamber, Ava Knight

Williams Honors College, Honors Research Projects

This paper investigates the combinatorial geometry of plane arrangements in three-dimensional space, focusing on configurations that produce exactly one bounded tetrahedral chamber. We define T(n) as the number of face-combinatorial equivalence classes of arrangements of n planes in ℝ³ containing exactly one bounded tetrahedral chamber. Known values — T(3) = 0, T(4) = 1, and T(5) = 2 — are established through direct construction, while T(6) remains an open problem. This paper contributes experimental evidence toward resolving T(6) by systematically extending the two valid 5-plane arrangements and verifying, through a plane removal argument, that each yields a valid plane configuration …

A Preliminary Study Of Hilbert–Kunz Functions: Coefficient Behavior In A Normal Affine Semigroup Ring, Jesus A. Mendiola Herrera

Theses and Dissertations

In 1890, David Hilbert published a set of notes on what now constitutes one of the bases of Commutative Algebra; his work would eventually influence the efforts of mathematicians like Ernst Kunz. In 1969, Ernst Kunz introduced a particular mapping regarding modules of regular local rings. His goal was to characterize Noetherian local rings of prime characteristic by computing the length of the composition series under Frobenius power transformations. In this thesis, the focus will be on stating the initial steps on finding the coefficients of the Hilbert-Kunz function of the normal affine semigroup ring of the form R = …

Geometric Algebra For Field Theory In Curved Spacetime, Kevin Rhine

All Graduate Reports and Creative Projects, Fall 2023 to Present

Physics seeks to understand the universe by uncovering the fundamental laws that govern matter, energy, space, and time. At its heart lies the challenge of unification: finding a mathematical framework that consistently describes these interactions across all scales, from the subatomic to the cosmological.

This thesis explores geometric algebra, a mathematical language that unifies algebra and geometry, as a tool for advancing this understanding. By extending this framework to curved spacetimes, where gravity influences the structure of space and time, we investigate its ability to describe physical phenomena such as electromagnetism and general relativity. A notable contribution includes the geometric …

Constructing Binary Encoding Matrices From Joined Graphs, Joshua Avalos

Electronic Theses, Projects, and Dissertations

Codes and technology are part of our daily lives and allow the modern world to function, and for us to have conveniences in our lives such as smartphones that can be used to privately call people on the other side of the planet, and for secure access to the internet. In this thesis we will explore the construction of binary codes created by vertex-edge incidence matrices of planar graphs. The Hamming (7,4) code was an incredible code that allowed the detection and correction of errors after receiving them through a transmission. We will explore the possibility of the creation of …

Möbius Transformations And Hyperbolic Geometry In The Upper Half-Plane, Emma Bunch

Mahurin Honors College Capstone Experience/Thesis Projects

In this thesis, we discuss several properties of Möbius transformations and hyperbolic geometry, a type of non-Euclidean geometry, in the upper half-plane using tools of complex analysis. We begin with preliminaries for our work, comprising the stereographic projection, the representation of circles and lines in the complex plane, conformal maps, and a result on cross-products, which we include for further development. We proceed to Möbius transformations and discuss their properties, cross-ratios, and various mappings. We additionally provide useful calculations. Lastly, we conclude with the hyperbolic metric in the upper half-plane and explore hyperbolic distance, including its invariance under Möbius transformations. …

Lipschitz Conditions On Operators And Matrices, Ryan Farrell

UNF Graduate Theses and Dissertations

Lipschitz functions on the real line find various applications across mathematics, including in differential equations, optimization, and machine learning. The goal of this thesis is to investigate functions which satisfy certain Lipschitz conditions when ap- plied to operators and matrices. Our study will review two classes of such functions, the class of Operator Lipschitz functions with respect to a given matrix norm, and the class consisting of functions which do not meet Lipschitz conditions in the traditional sense but satisfy inequalities which are Lipschitz in nature – we call such conditions ”Lipschitz-like”. The thesis concludes with a survey of these …

Geometric Properties Of Positive Definite Matrices: Means, Order, And Metrics, Blaine Dubois

UNF Graduate Theses and Dissertations

In this thesis, we study matrix means from a geometric point of view. In particular, we consider divergences of the form Tr[A + B − 2G(A, B)] for certain Geometric-Type matrix means G(A, B). We derive alternative formulations of this distance function through the application of one-sided inverses of G(A, B). When G(A, B) = A#B, we give a curve parametrization of the straight-line path between two points with respect to this semi-metric and present conditions under which this holds for other Geometric-Type means. For read- ability and self-containment, we introduce most of the preliminary concepts to build up to …

On Cheeger Constants Of Knots, Robert Lattimer

Electronic Theses, Projects, and Dissertations

In this thesis, we will look at finding bounds for the Cheeger constant of links. We will do this by analyzing an infinite family of links call two-bridge fully augmented links. In order to find a bound on the Cheeger constant, we will look for the Cheeger constant of the link’s crushtacean. We will use that Cheeger constant to give us insight on a good cut for the link itself, and use that cut to obtain a bound. This method gives us a constructive way to find an upper bound on the Cheeger constant of a two-bridge fully augmented link. …

Spacetime Geometry Of Acoustics And Electromagnetism, Lucas Burns, Tatsuya Daniel, Stephon Alexander, Justin Dressel

Mathematics, Physics, and Computer Science Faculty Articles and Research

Both acoustics and electromagnetism represent measurable fields in terms of dynamical potential fields. Electromagnetic force-fields form a spacetime bivector that is represented by a dynamical energy–momentum 4-vector potential field. Acoustic pressure and velocity fields form an energy–momentum density 4-vector field that is represented by a dynamical action scalar potential field. Surprisingly, standard field theory analyses of spin angular momentum based on these traditional potential representations contradict recent experiments, which motivates a careful reassessment of both theories. We analyze extensions of both theories that use the full geometric structure of spacetime to respect essential symmetries enforced by vacuum wave propagation. The …

Manifold Learning In Robotics: A Tutorial And Survey, Marcus Hawkins

Computer Science and Engineering Theses - Archive

In this article, we hope to represent the current state of the art of manifold learning in an understandable and approachable way. The authors will present a general overview core algorithms associated with linear and nonlinear dimensionality reduction techniques, give rudimentary definitions from differential geometry, and tenets of robotic perception, manipulation and path planning. Some of the historical applications of these algorithms will be presented, as well as conjectures about future uses, through examples from peer-reviewed journals.

The Computational Search For Unidentified Central Configurations Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It is vital in celestial mechanics, such as planning collision-free satellite orbit trajectories. When beginning to understand the N-body problem, we can start by looking at equal masses of these particles or celestial bodies. As particles move, their position and velocity change, both energy and angular momentum are conserved. Sets of constant energy and angular momentum, known as integral manifolds, are higher-dimensional figures that represent constraints of movement to a system. Integral manifolds are described …

Super Hiper Funcion Y Super Hiper Estructura Y Sus Correspondientes Super Hiper Funcion Neutrosofica Y Super Hiper Estructura Neutrosofica, Florentin Smarandache

Branch Mathematics and Statistics Faculty and Staff Publications

El n-ésimo Conjunto Potencia de un Conjunto {o Pn(S)} describe mejor nuestro mundo real, porque un sistema S (que puede ser una empresa, institución, asociación, país, sociedad, conjunto de objetos/plantas/animales/seres, conjunto de conceptos/ideas/proposiciones, etc.) está formado por subsistemas, que a su vez están formados por sub-subsistemas, y así sucesivamente. Demostramos que la Super Hiper Función es una generalización de la Función clásica, Super Función y la Hiper Función. Y el Super Hiper Álgebra, Super Hiper Gráfico son parte de la Super Hiper Estructura. Casi todas las estructuras en nuestro mundo real son Super Hiper Estructuras Neutrosóficas ya que tienen …

An Exposition Of The Curvature Of Warped Product Manifolds, Angelina Bisson

Electronic Theses, Projects, and Dissertations

The field of differential geometry is brimming with compelling objects, among which are warped products. These objects hold a prominent place in differential geometry and have been widely studied, as is evident in the literature. Warped products are topologically the same as the Cartesian product of two manifolds, but with distances in one of the factors in skewed. Our goal is to introduce warped product manifolds and to compute their curvature at any point. We follow recent literature and present a previously known result that classifies all flat warped products to find that there are flat examples of warped products …

The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales

Rose-Hulman Undergraduate Mathematics Journal

DNA and other polymer chains in confined spaces behave like closed loops. Arsuaga et al. \cite{AB} introduced the uniform random polygon model in order to better understand such loops in confined spaces using probabilistic and knot theoretical techniques, giving some classification on the mean squared linking number of such loops. Flapan and Kozai \cite{flapan2016linking} extended these techniques to find the mean sum of squared linking numbers for random linear embeddings of complete graphs $K_n$ and found it to have order $\Theta(n(n!))$. We further these ideas by inspecting random piecewise-linear embeddings of complete graphs and give introductory-level summaries of the ideas …

Differential Calculus: From Practice To Theory, Eugene Boman, Robert Rogers

Milne Open Textbooks

Differential Calculus: From Practice to Theory covers all of the topics in a typical first course in differential calculus. Initially it focuses on using calculus as a problem solving tool (in conjunction with analytic geometry and trigonometry) by exploiting an informal understanding of differentials (infinitesimals). As much as possible large, interesting, and important historical problems (the motion of falling bodies and trajectories, the shape of hanging chains, the Witch of Agnesi) are used to develop key ideas. Only after skill with the computational tools of calculus has been developed is the question of rigor seriously broached. At that point, the …

An Explicit Construction Of Sheaves In Context, Tyler A. Bryson

Dissertations, Theses, and Capstone Projects

This document details the body of theory necessary to explicitly construct sheaves of sets on a site together with the development of supporting material necessary to connect sheaf theory with the wider mathematical contexts in which it is applied. Of particular interest is a novel presentation of the plus construction suitable for direct application to a site without first passing to the generated grothendieck topology.

Knot Equivalence, Jacob Trubey

Electronic Theses, Projects, and Dissertations

A knot is a closed curve in R3. Alternatively, we say that a knot is an embedding f : S1 → R3 of a circle into R3. Analogously, one can think of a knot as a segment of string in a three-dimensional space that has been knotted together in some way, with the ends of the string then joined together to form a knotted loop. A link is a collection of knots that have been linked together.

An important question in the mathematical study of knot theory is that of how we can tell when two knots are, or are …

A Stronger Strong Schottky Lemma For Euclidean Buildings, Michael E. Ferguson

Dissertations, Theses, and Capstone Projects

We provide a criterion for two hyperbolic isometries of a Euclidean building to generate a free group of rank two. In particular, we extend the application of a Strong Schottky Lemma to buildings given by Alperin, Farb and Noskov. We then use this extension to obtain an infinite family of matrices that generate a free group of rank two. In doing so, we also introduce an algorithm that terminates in finite time if the lemma is applicable for pairs of certain kinds of matrices acting on the Euclidean building for the special linear group over certain discretely valued fields.

Bifurcation Levels Of The Integral Manifolds Of The Newtonian N-Body Problem, Hannah G. Havel

CURE Proceedings

The N-body problem, first proposed by Isaac Newton, is a field of study in mathematics and physics that involves predicting the motion of particles moving under their mutual gravitational attraction. It has significance to many areas of science, including physics and computer science, and is crucial in understanding how the universe works. In fact, it was a primary motivation for Newton's development of calculus. An important application of the N-body problem is within celestial mechanics and involves how planets and other celestial bodies move with mutual gravitational attraction. It is important in developing how satellites behave in space using complicated …

Unomaha Problem Of The Week (2021-2022 Edition), Brad Horner, Jordan M. Sahs

UNO Student Research and Creative Activity Fair

The University of Omaha math department's Problem of the Week was taken over in Fall 2019 from faculty by the authors. The structure: each semester (Fall and Spring), three problems are given per week for twelve weeks, with each problem worth ten points - mimicking the structure of arguably the most well-regarded university math competition around, the Putnam Competition, with prizes awarded to top-scorers at semester's end. The weekly competition was halted midway through Spring 2020 due to COVID-19, but relaunched again in Fall 2021, with massive changes.

Now there are three difficulty tiers to POW problems, roughly corresponding to …

Van Kampen Diagrams And Small Cancellation Theory, Kelsey N. Lowrey

Master's Theses

Given a presentation of G, the word problem asks whether there exists an algorithm to determine which words in the free group, F(A), represent the identity in G. In this thesis, we study small cancellation theory, developed by Lyndon, Schupp, and Greendlinger in the mid-1960s, which contributed to the resurgence of geometric group theory. We investigate the connection between Van Kampen diagrams and the small cancellation hypotheses. Groups that have a presentation satisfying the small cancellation hypotheses C'(1/6), or C'(1/4) and T(4) have a nice solution to the word problem known as Dehn’s Algorithm.

How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli

The Review: A Journal of Undergraduate Student Research

The art gallery problem is a geometry question that seeks to find the minimum number of guards necessary to guard an art gallery based on the qualities of the museum’s shape, specifically the number of walls. Solved by Václav Chvátal in 1975, the resulting Art Gallery Theorem dictates that ⌊n/3⌋ guards are always sufficient and sometimes necessary to guard an art gallery with n walls. This theorem, along with the argument that proves it, are accessible and interesting results even to one with little to no mathematical knowledge, introducing readers to common concepts in both geometry and graph …

Finding Optimal Cayley Map Embeddings Using Genetic Algorithms, Jacob Buckelew

Honors Program Theses

Genetic algorithms are a commonly used metaheuristic search method aimed at solving complex optimization problems in a variety of fields. These types of algorithms lend themselves to problems that can incorporate stochastic elements, which allows for a wider search across a search space. However, the nature of the genetic algorithm can often cause challenges regarding time-consumption. Although the genetic algorithm may be widely applicable to various domains, it is not guaranteed that the algorithm will outperform other traditional search methods in solving problems specific to particular domains. In this paper, we test the feasibility of genetic algorithms in solving a …

Stroke Clustering And Fitting In Vector Art, Khandokar Shakib

Senior Independent Study Theses

Vectorization of art involves turning free-hand drawings into vector graphics that can be further scaled and manipulated. In this paper, we explore the concept of vectorization of line drawings and study multiple approaches that attempt to achieve this in the most accurate way possible. We utilize a software called StrokeStrip to discuss the different mathematics behind the parameterization and fitting involved in the drawings.

Elliptic Curves And Their Practical Applications, Henry H. Hayden Iv

Graduate Theses/Dissertations

Finding rational points that satisfy functions known as elliptic curves induces a finitely-generated abelian group. Such functions are powerful tools that were used to solve Fermat's Last Theorem and are used in cryptography to send private keys over public systems. Elliptic curves are also useful in factoring and determining primality.

Boxes, Extended Boxes And Sets Of Positive Upper Density In The Euclidean Space, Polona Durcik, Vjekoslav Kovač

Mathematics, Physics, and Computer Science Faculty Articles and Research

We prove that sets with positive upper Banach density in sufficiently large dimensions contain congruent copies of all sufficiently large dilates of three specific higher-dimensional patterns. These patterns are: 2n vertices of a fixed n-dimensional rectangular box, the same vertices extended with n points completing three-term arithmetic progressions, and the same vertices extended with n points completing three-point corners. Our results provide common generalizations of several Euclidean density theorems from the literature.

Diagrams In Intra-Configurational Analysis, Marco Panza, Gianluca Longa

MPP Published Research

In this paper we would like to attempt to shed some light on the way in which diagrams enter into the practice of ancient Greek geometrical analysis. To this end, we will first distinguish two main forms of this practice, i.e., trans-configurational and intra-configurational. We will then argue that, while in the former diagrams enter in the proof essentially in the same way (mutatis mutandis) they enter in canonical synthetic demonstrations, in the latter, they take part in the analytic argument in a specific way, which has no correlation in other aspects of classical geometry. In intra-configurational analysis, diagrams represent …

Analysis, Constructions And Diagrams In Classical Geometry, Marco Panza

MPP Published Research

Greek ancient and early modern geometry necessarily uses diagrams. Among other things, these enter geometrical analysis. The paper distinguishes two sorts of geometrical analysis and shows that in one of them, dubbed “intra-confgurational” analysis, some diagrams necessarily enter as outcomes of a purely material gesture, namely not as result of a codifed constructive procedure, but as result of a free-hand drawing.