Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Publication
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Geometry and Topology
The Mean Sum Of Squared Linking Numbers Of Random Piecewise-Linear Embeddings Of $K_N$, Yasmin Aguillon, Xingyu Cheng, Spencer Eddins, Pedro Morales
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 …
How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli
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 …
Complete Bipartite Graph Embeddings On Orientable Surfaces Using Cayley Maps, Madeline Spies
Complete Bipartite Graph Embeddings On Orientable Surfaces Using Cayley Maps, Madeline Spies
Honors Program Theses
We explored how effective Cayley Maps are at embedding complete bipartite graphs onto orientable surfaces, such as spheres and tori. We embedded the graphs onto surfaces using Cayley Maps with the intent of finding rotations that result in the graphs’ optimal genera. Because there are only three groups that can be used to describe Kp,p, where p is prime, we chose to focus on this specific graph type. This paper explains how we determined the genera when using a Cayley Map, provides general theorems for surface face sizes and the Dihedral Group, and discusses our results for Kp,p up to …
Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K
Special Subset Vertex Multisubgraphs For Multi Networks, Florentin Smarandache, W.B. Vasantha Kandasamy, Ilanthenral K
Branch Mathematics and Statistics Faculty and Staff Publications
In this book authors study special type of subset vertex multi subgraphs; these multi subgraphs can be directed or otherwise. Another special feature of these subset vertex multigraphs is that we are aware of the elements in each vertex set and how it affects the structure of both subset vertex multisubgraphs and edge multisubgraphs. It is pertinent to record at this juncture that certain ego centric directed multistar graphs become empty on the removal of one edge, there by theorising the importance, and giving certain postulates how to safely form ego centric multi networks. Given any subset vertex multigraph we …
3-Maps And Their Generalizations, Kevin J. Mccall
3-Maps And Their Generalizations, Kevin J. Mccall
Theses and Dissertations
A 3-map is a 3-region colorable map. They have been studied by Craft and White in their paper 3-maps. This thesis introduces topological graph theory and then investigates 3-maps in detail, including examples, special types of 3-maps, the use of 3-maps to find the genus of special graphs, and a generalization known as n-maps.
Tying The Knot: Applications Of Topology To Chemistry, Tarini S. Hardikar
Tying The Knot: Applications Of Topology To Chemistry, Tarini S. Hardikar
Honors Theses
Chirality (or handedness) is the property that a structure is “different” from its mirror image. Topology can be used to provide a rigorous framework for the notion of chirality. This project examines various types of chirality and discusses tools to detect chirality in graphs and knots. Notable theorems that are discussed in this work include ones that identify chirality using properties of link polynomials (HOMFLY polynomials), rigid vertex graphs, and knot linking numbers. Various other issues of chirality are explored, and some specially unique structures are discussed. This paper is borne out of reading Dr. Erica Flapan’s book, When Topology …
Patterns Formed By Coins, Andrey M. Mishchenko
Patterns Formed By Coins, Andrey M. Mishchenko
Journal of Humanistic Mathematics
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non- overlapping circles. The first half of the article is an exposition of the two most important facts about circle packings, (1) that essentially whatever pattern we ask for, we may always arrange circles in that pattern, and (2) that under simple conditions on the pattern, there is an essentially unique arrangement of circles in that pattern. In the second half of the article, we consider related questions, but where we …
Discrete Morse Functions, Vector Fields, And Homological Sequences On Trees, Ian B. Rand
Discrete Morse Functions, Vector Fields, And Homological Sequences On Trees, Ian B. Rand
Mathematics Summer Fellows
The goal of this project is to construct a discrete Morse function which induces both a unique gradient vector field and homological sequence on a given tree. After reviewing the basics of discrete Morse theory, we will show that the two standard notions of equivalence of discrete Morse functions, Forman and homological equivalence, are independent of one another. We then show through a constructive algorithm the existence of a discrete Morse function on a tree inducing a desired gradient vector field and homological sequence. After proving that our algorithm is correct, we give an example to illustrate its use.
Tutte Polynomial In Knot Theory, David Alan Petersen
Tutte Polynomial In Knot Theory, David Alan Petersen
Theses Digitization Project
This thesis reviews the history of knot theory with an emphasis on the diagrammatic approach to studying knots. Also covered are the basic concepts and notions of graph theory and how these two fields are related with an example of a knot diagram and how to associate it to a graph.