Geometry and Topology Commons^™

A 4-Dimensional Rubik’S Cube You Can Hold: How It’S Possible And The Math Behind It, Eric J. Moon

SACAD: Scholarly Activities

This poster examines the physical 2x2x2x2, a hand-held realization of a 4-dimensional Rubik’s Cube invented by Melinda Green. Unlike most higher-dimensional twisty puzzles, which exist only as software simulations, this puzzle provides a physical model for exploring 4-dimensional rotation, symmetry, and solving methods. The poster introduces the structure of the puzzle, its canonical move system, and several algebraic ideas that help explain how scrambling and solving work.

From a mathematical perspective, the puzzle can be studied using group actions, commutators, conjugation, and combinatorial counting. In particular, the number of reachable states depends on corner permutations, corner orientations, parity restrictions, twist …

An Introduction To Modern Conversations On Knot Invariants, Stella Shah

Scripps Senior Theses

Knot Theory is a vast and diverse subfield of modern mathematics involving the classification and abstraction of knots and links. In this thesis, we wish to provide the necessary background for and an explanation of two papers in different subfields of knot theory, The Forbidden Quiver of a Link, and Biquandle Fares and Link Invariants.

In Chapter I, we begin with an introduction to knot theory and knot invariants. We continue to present the example of Fox Colorings, and conclude the chapter with an example of the Fox Coloring Number Invariant.

In Chapter II, we explore the derivation and utilization …

Simplicial Decomposition And Realization, Matthew Ellison

Dartmouth College Ph.D Dissertations

In simplicial decomposition, we define two invariants --- V_Z and V_Q --- which represent notions of integral and rational volume of a certain class of simplicial complexes. We prove V_Z and V_Q are additive under disjoint union and connected sum, and investigate `integrality gaps' between the two quantities. We apply the theory to establish a conjecture of Sleator, Thurston, and Tarjan on tetrahedral fillings, and, as a corollary, obtain a new proof of Pournin's 2012 result on the diameter of the associahedron. In simplicial realization, we provide practical sufficient conditions and computer code to prove the existence of Euclidean embeddings …

New View Of Some Propositions On Hesitant Fuzzy Set And Its Application In Selecting The Best Person In Any Job, Manar Mohamed Omran Dr., Arafa A. Nasef A.Dr, Reham Abd El-Aziz Abo Khadra Dr., Mahmoud Arafa Nasef Dr.

Journal of Engineering Research

An essential part of uncertainty is played by the hesitant fuzzy set (HFS). So, it can be utilized when making decisions. The suggested use of HFS to choose the best candidate for any post is thoroughly discussed and introduces new HFS concepts

Orientable Quadrilateral Embeddings Of Cartesian Products Of Graphs, Matthew Farnsworth, Max Goskie, Adrian Volpe, Jackson Sayre

SPARK Symposium Presentations

In the spirit of Pisanski (1989) we consider orientable quadrilateral embeddings of Cartesian products of cycles on surfaces. We offer a constructive example of such an embedding of three low-order cycles. Then we show more generally that such embeddings exist for the product of a 2-cycle, and even cycle, and an arbitrary third cycle. We represent our graphs using rotation schemes to show this existence. Use of rotation schemes led to the ultimate characterization of our findings visually, providing conjectures for generalizations of products of three cycles.

Moore Graphs, Trevor Saxton

Williams Honors College, Honors Research Projects

A Moore graph is a simple regular graph, with n vertices, degree d, and diameter k, that satisfies the Moore bound: n = 1 + d (d − 1)k − 1 d − 2 . There are graphs for which the bound is met and in which existence and uniqueness are known. For k = 2 it is known that the Moore bound is achieved for d = 2, 3, 7, with the case of d = 57 conjectured to exist. For k = 3 the bound is achieved for only d = 3 [5]. Due to the construction of …

Coloring Trivalent Graphs: A Defect Tft Approach, Amit Kumar

LSU Doctoral Dissertations

We show that the combinatorial matter of graph coloring is, in fact, quantum in the sense of satisfying the sum over all the possible intermediate state properties of a path integral. In our case, the topological field theory (TFT) with defects gives meaning to it. This TFT has the property that when evaluated on a planar trivalent graph, it provides the number of Tait-Coloring of it. Defects can be considered as a generalization of groups. With the Klein-four group as a 1-defect condition, we reinterpret graph coloring as sections of a certain bundle, distinguishing a coloring (global-sections) from a coloring …

Counting The Classes Of Projectively-Equivalent Pentagons On Finite Projective Planes Of Prime Order, Maxwell Hosler

Rose-Hulman Undergraduate Mathematics Journal

In this paper, we examine the number of equivalence classes of pentagons on finite projective planes of prime order under projective transformations. We are interested in those pentagons in general position, meaning that no three vertices are collinear. We consider those planes which can be constructed from finite fields of prime order, and use algebraic techniques to characterize them by their symmetries. We are able to construct a unique representative for each pentagon class with nontrivial symmetries. We can then leverage this fact to count classes of pentagons in general. We discover that there are (1/10)((p+3)(p-3)+4 …

Nano Topology And Decision Making In Medical Applications, Samir Mukhtar, Mohamed Shokry, Manar Omran

Journal of Engineering Research

Nano Topology is one of the essential topics that receive special attention from some athletes in the field of General Topology, Operations Research, and Computer Science, because it has a vital role in the generalizing most of the various mathematical concepts. Recently, many efforts have been made to study many types of Nano Topology, as the previous studies lacked real applications in Engineering, Medicine, Pharmacy, and Social Sciences. In this paper, we present some different applications of these studies. The paper is divided into two parts: Firstly, we study the theory of The Nano Topology and investigate its relation with …

New Operation Defined Over Dual-Hesitant Fuzzy Set And Its Application In Diagnostics In Medicine, Manar Mohamed Omran, Reham Abdel-Aziz Abo-Khadra

Journal of Engineering Research

In recent decades, several types of sets, such as fuzzy sets, interval-valued fuzzy sets, intuitionistic fuzzy sets, interval-valued intuitionistic fuzzy sets, type 2 fuzzy sets, type n fuzzy sets, and hesitant fuzzy sets, have been introduced and investigated widely. In this paper, we propose dual hesitant fuzzy sets (DHFSs), which encompass fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and fuzzy multi-sets as special cases. Then we investigate the basic operations and properties of DHFSs. We also discuss the relationships among the sets mentioned above, and then propose an extension principle of DHFSs. Additionally, we give an example to illustrate …

Categorical Chain Conditions For Étale Groupoid Algebras, Sunil Philip

Dissertations, Theses, and Capstone Projects

Let R be a unital commutative ring and G an ample groupoid. Using the topology of the groupoid G, Steinberg defined an étale groupoid algebra RG. These étale groupoid algebras generalize various algebras, including group algebras, commutative algebras over a field generated by idempotents, traditional groupoid algebras, Leavitt path algebras, higher-rank graph algebras, and inverse semigroup algebras. Steinberg later characterized the classical chain conditions for étale groupoid algebras. In this work, we characterize categorically noetherian and artinian, locally noetherian and artinian, and semisimple étale groupoid algebras, thereby generalizing existing results for Leavitt path algebras and introducing new results for inverse …

The Modular Generalized Springer Correspondence For The Symplectic Group, Joseph Dorta

LSU Doctoral Dissertations

The Modular Generalized Springer Correspondence (MGSC), as developed by Achar, Juteau, Henderson, and Riche, stands as a significant extension of the early groundwork laid by Lusztig's Springer Correspondence in characteristic zero which provided crucial insights into the representation theory of finite groups of Lie type. Building upon Lusztig's work, a generalized version of the Springer Correspondence was later formulated to encompass broader contexts.

In the realm of modular representation theory, Juteau's efforts gave rise to the Modular Springer Correspondence, offering a framework to explore the interplay between algebraic geometry and representation theory in positive characteristic. Achar, Juteau, Henderson, and Riche …

Discrete Macaulay-Steiner Geometry, Nikola Kuzmanovski

Dissertations and Doctoral Documents, University of Nebraska-Lincoln, 2023–

This thesis is concerned with discrete isoperimetric inequalities and Hilbert functions. Two generalizations of the Ahlswede-Cai local global principle are presented. These results give positive answers to two questions posed by Harper. One of these results is achieved by proving uniqueness of the lexicographic and colexicographic orders in two dimensions. The other result generalizes the technique which is commonly known as compression and includes almost all previously published results in this direction. The Ahlswede-Cai local global principle is a direct corollary of this result. Optimal downsets are studied in rectangles and triangles. All optimal downsets are found. The main result …

The Dual Boundary Complex Of The Moduli Space Of Cyclic Compactifications, Toby Anderson

HMC Senior Theses

Moduli spaces provide a useful method for studying families of mathematical objects. We study certain moduli spaces of algebraic curves, which are generalizations of familiar lines and conics. This thesis focuses on, Δ^(r,n), the dual boundary complex of the moduli space of genus-zero cyclic curves. This complex is itself a moduli space of graphs and can be investigated with combinatorial methods. Remarkably, the combinatorics of this complex provides insight into the geometry and topology of the original moduli space. In this thesis, we investigate two topologically invariant properties of Δ^(r,n). We compute its Euler characteristic and …

Id Numbers Of Lobster Graphs, Mark Anthony C. Tolentino, Luis Silvestre Jr, Richwell T. Chan Sim, Amir Jann Erikson Diga, Althea Julia R. Loyola

Mathematics Faculty Publications

No abstract provided.

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 …

Partitions Of R^N With Maximal Seclusion And Their Applications To Reproducible Computation, Jason Vander Woude

Department of Mathematics: Dissertations, Theses, and Student Research

We introduce and investigate a natural problem regarding unit cube tilings/partitions of Euclidean space and also consider broad generalizations of this problem. The problem fits well within a historical context of similar problems and also has applications to the study of reproducibility in randomized computation.

Given $k\in\mathbb{N}$ and $\epsilon\in(0,\infty)$, we define a $(k,\epsilon)$-secluded unit cube partition of $\mathbb{R}^{d}$ to be a unit cube partition of $\mathbb{R}^{d}$ such that for every point $\vec{p}\in\R^d$, the closed $\ell_{\infty}$ $\epsilon$-ball around $\vec{p}$ intersects at most $k$ cubes. The problem is to construct such partitions for each dimension $d$ with the primary goal of minimizing …

Roots Of Quaternionic Polynomials And Automorphisms Of Roots, Olalekan Ogunmefun

Electronic Theses and Dissertations

The quaternions are an extension of the complex numbers which were first described by Sir William Rowan Hamilton in 1843. In his description, he gave the equation of the multiplication of the imaginary component similar to that of complex numbers. Many mathematicians have studied the zeros of quaternionic polynomials. Prominent of these, Ivan Niven pioneered a root-finding algorithm in 1941, Gentili and Struppa proved the Fundamental Theorem of Algebra (FTA) for quaternions in 2007. This thesis finds the zeros of quaternionic polynomials using the Fundamental Theorem of Algebra. There are isolated zeros and spheres of zeros. In this thesis, we …

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.

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.

Cayley Map Embeddings Of Complete Graphs With Even Order, Michael O'Connor

Honors Program Theses

German mathematician Claus Michael Ringel used voltage graphs to embed complete graphs onto orientable surfaces such that none of the graph's edges cross each other. Cayley maps do the same whilst being simpler to work with. The goal is to determine the efficiency of Cayley maps in embedding complete graphs onto orientable surfaces. This article focus on complete graphs of even order with an emphasis on graphs whose orders are congruent to 6 modulo 12 and 0 modulo 12. We establish 12 distinct classes that each have their own unique qualities. Through the generalization of a previous technique, we prove …

Finite Matroidal Spaces And Matrological Spaces, Ziyad M. Hamad

Graduate Theses, Dissertations, and Problem Reports (ETD)

The purpose of this thesis is to present new different spaces as attempts to generalize the concept of topological vector spaces. A topological vector space, a well-known concept in mathematics, is a vector space over a field \mathbb{F} with a topology that makes the addition and scalar multiplication operations of the vector space continuous functions. The field \mathbb{F} is usually \mathbb{R} or \mathbb{C} with their standard topologies. Since every vector space is a finitary matroid, we define two spaces called finite matroidal spaces and matrological spaces by replacing the linear structure of the topological vector space with a finitary matroidal …

On The Uniqueness Of Continuation Of A Partially Defined Metric, Evgeniy Petrov

Theory & Applications of Graphs

The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let G=G(V,E) be an undirected graph with the set of vertices V and the set of edges E. A necessary and sufficient condition under which the weight w : E → R⁺ on the graph G has a unique continuation to a metric d : V x V → R⁺ is found.

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 …

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 …

Dot Product Bounds In Galois Rings, David Lee Crosby

Graduate Theses/Dissertations

We consider the Erdős Distance Conjecture in the context of dot products in Galois rings and prove results for single dot products and pairs of dot products.

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.

Cayley Map Embeddings Of Complete Graphs, Miriam Scheinblum

Honors Program Theses

This paper looks at Cayley map embeddings of complete graphs on orientable surfaces. Cayley maps constrain graph embeddings to those with cyclical edge rotations, so optimal embeddings on surfaces with the minimum genus may not always be possible. We explore instances when Cayley maps succeed at optimally embedding complete graphs, and when optimal embeddings are not possible, we determine how close to optimal they can get by finding vertex rotations that result in the smallest possible genus. Many of the complete graphs we consider have prime numbers of vertices, so for each complete graph Kn we focus on mappings with …

A Discrete Analogue For The Poincaré-Hopf Theorem, Savana Ammons

HMC Senior Theses

In this thesis, we develop a discrete analogue to the Poincaré–Hopf Theorem. We define the notion of a vector field on a graph, and establish an index theory for such a field. Specifically, we create well-defined indices for the nodes and “cells" formed by a planar graph. Then, we show that the sum of these indices remains constant for certain types of planar graphs, regardless of the discrete vector fields they have.

Discrete Morse Theory By Vector Fields: A Survey And New Directions, Matthew Nemitz

All Graduate Theses, Dissertations, and Other Capstone Projects

We synthesize some of the main tools in discrete Morse theory from various sources. We do this in regards to abstract simplicial complexes with an emphasis on vector fields and use this as a building block to achieve our main result which is to investigate the relationship between simplicial maps and homotopy. We use the discrete vector field as a catalyst to build a chain homotopy between chain maps induced by simplicial maps.