Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
- Publication
- Publication Type
Articles 1 - 8 of 8
Full-Text Articles in Physical Sciences and Mathematics
Selective Strong Screenability, Isaac Joseph Coombs
Selective Strong Screenability, Isaac Joseph Coombs
Boise State University Theses and Dissertations
Screenability and strong screenability were both introduced some sixty years ago by R.H. Bing in his paper Metrization of Topological Spaces. Since then, much work has been done in exploring selective screenability (the selective version of screenability). However, the corresponding selective version of strong screenability has been virtually ignored. In this paper we seek to remedy this oversight. It is found that a great deal of the proofs about selective screenability readily carry over to proofs for the analogous version for selective strong screenability. We give some examples of selective strongly screenable spaces with the primary example being Pol's …
Persistence Equivalence Of Discrete Morse Functions On Trees, Yuqing Liu
Persistence Equivalence Of Discrete Morse Functions On Trees, Yuqing Liu
Mathematics Summer Fellows
We introduce a new notion of equivalence of discrete Morse functions on graphs called persistence equivalence. Two functions are considered persistence equivalent if and only if they induce the same persistence diagram. We compare this notion of equivalence to other notions of equivalent discrete Morse functions. We then compute an upper bound for the number of persistence equivalent discrete Morse functions on a fixed graph and show that this upper bound is sharp in the case where our graph is a tree. We conclude with an example illustrating our construction.
Nearness Without Distance, Nicholas A. Scoville
Introduction To Computational Topology Using Simplicial Persistent Homology, Jason Turner, Brenda Johnson, Ellen Gasparovic
Introduction To Computational Topology Using Simplicial Persistent Homology, Jason Turner, Brenda Johnson, Ellen Gasparovic
Honors Theses
The human mind has a natural talent for finding patterns and shapes in nature where there are none, such as constellations among the stars. Persistent homology serves as a mathematical tool for accomplishing the same task in a more formal setting, taking in a cloud of individual points and assembling them into a coherent continuous image. We present an introduction to computational topology as well as persistent homology, and use them to analyze configurations of BuckyBalls®, small magnetic balls commonly used as desk toys.
Homeomorphisms Of The Sierpinski Carpet, Karuna S. Sangam
Homeomorphisms Of The Sierpinski Carpet, Karuna S. Sangam
Senior Projects Spring 2018
The Sierpinski carpet is a fractal formed by dividing the unit square into nine congruent squares, removing the center one, and repeating the process for each of the eight remaining squares, continuing infinitely many times. It is a well-known fractal with many fascinating topological properties that appears in a variety of different contexts, including as rational Julia sets. In this project, we study self-homeomorphisms of the Sierpinski carpet. We investigate the structure of the homeomorphism group, identify its finite subgroups, and attempt to define a transducer homeomorphism of the carpet. In particular, we find that the symmetry groups of platonic …
Graph Replacement Systems For Julia Sets Of Quadratic Polynomials, Yuan Jessica Liu
Graph Replacement Systems For Julia Sets Of Quadratic Polynomials, Yuan Jessica Liu
Senior Projects Spring 2018
Belk and Forrest construct a specific class of graph replacement systems that give sequences of graphs that converge to fractals. Given a polynomial, we have an algorithm that gives a replacement system that leads to a graph sequence which we conjecture converges to the Julia set. We prove the conjecture for the quadratic polynomial $z^2+c$ where $c$ is a real number and the critical point is in a three cycle. We present some additional results and observations on replacement systems obtained from certain polynomials.
Concerning The Construction Of Four-Bar Linkages And Their Topological Configuration-Spaces, Peter K. Servatius
Concerning The Construction Of Four-Bar Linkages And Their Topological Configuration-Spaces, Peter K. Servatius
Senior Projects Spring 2018
For a given linkage with one degree of freedom we can analyze the coupler curve created by any selected tracer point in relation to a driver link. The Watt Engine is a four-bar linkage constructed such that the tracer point draws an approximate straight line along a section of the coupler curve. We will explore the family of linkages that are created using Watt's parameters, along with linkages designed by other inventors; looking at methodologies of creating a linkage and the defining what we mean by approximate straight-line motion. Ultimately we will be creating our own linkage using what 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.