Geometry and Topology Commons^™

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 …

Self-Assembly Of Dna Graphs And Postman Tours, Katie Bakewell

UNF Graduate Theses and Dissertations

DNA graph structures can self-assemble from branched junction molecules to yield solutions to computational problems. Self-assembly of graphs have previously been shown to give polynomial time solutions to hard computational problems such as 3-SAT and k-colorability problems. Jonoska et al. have proposed studying self-assembly of graphs topologically, considering the boundary components of their thickened graphs, which allows for reading the solutions to computational problems through reporter strands. We discuss weighting algorithms and consider applications of self-assembly of graphs and the boundary components of their thickened graphs to problems involving minimal weight Eulerian walks such as the Chinese Postman Problem and …

Higher Cluster Categories And Qft Dualities, Sebastián Franco, Gregg Musiker

Publications and Research

We introduce a unified mathematical framework that elegantly describes minimally supersymmetry gauge theories in even dimensions, ranging from six dimensions to zero dimensions, and their dualities. This approach combines and extends recent developments on graded quivers with potentials, higher Ginzburg algebras, and higher cluster categories (also known as m-cluster categories). Quiver mutations studied in the context of mathematics precisely correspond to the order-(m + 1) dualities of the gauge theories. Our work indicates that these equivalences of quiver gauge theories sit inside an infinite family of such generalized dualities.

Extensions Of The Morse-Hedlund Theorem, Eben Blaisdell

Honors Theses

Bi-infinite words are sequences of characters that are infinite forwards and backwards; for example "...ababababab...". The Morse-Hedlund theorem says that a bi-infinite word f repeats itself, in at most n letters, if and only if the number of distinct subwords of length n is at most n. Using the example, "...ababababab...", there are 2 subwords of length 3, namely "aba" and "bab". Since 2 is less than 3, we must have that "...ababababab..." repeats itself after at most 3 letters. In fact it does repeat itself every two letters. …

Spanning Tree Problem With Neutrosophic Edge Weights, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea, Arindam Dey, Le Hoang Son

Branch Mathematics and Statistics Faculty and Staff Publications

Neutrosophic set and neutrosophic logic theory are renowned theories to deal with complex, not clearly explained and uncertain real life problems, in which classical fuzzy sets/models may fail to model properly. This paper introduces an algorithm for finding minimum spanning tree (MST) of an undirected neutrosophic weighted connected graph (abbr. UNWCG) where the arc/edge lengths are represented by a single valued neutrosophic numbers. To build the MST of UNWCG, a new algorithm based on matrix approach has been introduced. The proposed algorithm is compared to other existing methods and finally a numerical example is provided.

Geometric Serendipity, Dakota Becker

Auctus: The Journal of Undergraduate Research and Creative Scholarship

The central focus of my practice is the serendipitous exploration into geometry, symmetry, design, and color. I have found more and more that the affinity I have for hard-edge geometric abstraction is a deeper reflection of the way in which I process my thoughts and surroundings. In the past year, I have sought to challenge myself by questioning the core of my practice and pushing it to go beyond its individual elements. In this way, I seek to create work that is more than its parts. As a result, I have become more purposeful with my designs and push both …

A Journey To The Adic World, Fayadh Kadhem

Electronic Theses and Dissertations

The first idea of this research was to study a topic that is related to both Algebra and Topology and explore a tool that connects them together. That was the entrance for me to the “adic world”. What was needed were some important concepts from Algebra and Topology, and so they are treated in the first two chapters.

The reader is assumed to be familiar with Abstract Algebra and Topology, especially with Ring theory and basics of Point-set Topology.

The thesis consists of a motivation and four chapters, the third and the fourth being the main ones. In the third …

Introduction To The Usu Library Of Solutions To The Einstein Field Equations, Ian M. Anderson, Charles G. Torre

Tutorials on... in 1 hour or less

This is a Maple worksheet providing an introduction to the USU Library of Solutions to the Einstein Field Equations. The library is part of the DifferentialGeometry software project and is a collection of symbolic data and metadata describing solutions to the Einstein equations.

Classification Of Minimal Separating Sets In Low Genus Surfaces, J. J. P. Veerman, William Maxwell, Victor Rielly, Austin K. Williams

Mathematics and Statistics Faculty Publications and Presentations

Consider a surface S and let M ⊂ S. If S \ M is not connected, then we say M separates S, and we refer to M as a separating set of S. If M separates S, and no proper subset of M separates S, then we say M is a minimal separating set of S. In this paper we use computational methods of combinatorial topology to classify the minimal separating sets of the orientable surfaces of genus g = 2 and g = 3. The classification for genus 0 and 1 was done …

Graph Structures In Bipolar Neutrosophic Environment, Florentin Smarandache, Muhammad Akram, Muzzamal Sitara

Branch Mathematics and Statistics Faculty and Staff Publications

A bipolar single-valued neutrosophic (BSVN) graph structure is a generalization of a bipolar fuzzy graph. In this research paper, we present certain concepts of BSVN graph structures. We describe some operations on BSVN graph structures and elaborate on these with examples. Moreover, we investigate some related properties of these operations.

Constructing A Square Indian Fire Altar Activity, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

In this activity, we will model constructing a square fire altar with a method similar to one used by people in ancient India. The fire altars, which were made of bricks, had various shapes. Instructions for building the altars were in Vedic texts called Śulba-sūtras. We will follow instructions for constructing a square gārhapatya fire altar from the Baudhāyana-śulba-sūtra, which was written during the Middle Vedic period, about 800-500 BC.

Constructing A Square An Ancient Indian Way Activity, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

In this activity students use string to model one of the ways that was used in ancient India for constructing a square. The construction was used in building a temporary fire altar. The activity is based on a translation by Sen and Bag of the Baudhāyana-śulba-sūtra.

Euler Construction Activity, Cynthia J. Huffman Ph.D.

Open Educational Resources - Math

Original sources of mathematics provide many opportunities for students to both do mathematics and to improve their problem solving skills. It is also interesting to explore original sources in new ways with the use of technology. In this activity, students can gain experience with dynamic geometry software and enhance their geometric intuition by working through a construction given by Euler in 1783.

Generalizations Of Coarse Properties In Large Scale Spaces, Kevin Michael Sinclair

Doctoral Dissertations

Many results in large scale geometry are proven for a metric space. However, there exists many large scale spaces that are not metrizable. We generalize several concepts to general large scale spaces and prove relationships between them. First we look into the concept of coarse amenability and other variations of amenability on large scale spaces. This leads into the definition of coarse sparsification and connections with coarse amenability. From there, we look into an equivalence of Sako's definition of property A on uniformly locally finite spaces and prove that finite coarse asymptotic definition implies it. As well, we define large …

Statistical Computational Topology And Geometry For Understanding Data, Joshua Lee Mike

Doctoral Dissertations

Here we describe three projects involving data analysis which focus on engaging statistics with the geometry and/or topology of the data.

The first project involves the development and implementation of kernel density estimation for persistence diagrams. These kernel densities consider neighborhoods for every feature in the center diagram and gives to each feature an independent, orthogonal direction. The creation of kernel densities in this realm yields a (previously unavailable) full characterization of the (random) geometry of a dataspace or data distribution.

In the second project, cohomology is used to guide a search for kidney exchange cycles within a kidney paired …

Localization Of Large Scale Structures, Ryan James Jensen

Doctoral Dissertations

We begin by giving the definition of coarse structures by John Roe, but quickly move to the equivalent concept of large scale geometry given by Jerzy Dydak. Next we present some basic but often used concepts and results in large scale geometry. We then state and prove the equivalence of various definitions of asymptotic dimension for arbitrary large scale spaces. Some of these are generalizations of asymptotic dimension for metric spaces, and many of the proofs are new. Particularly useful in proving the equivalences of the various definitions is the notion of partitions of unity, originally set forth by Jerzy …

Mathematical Description And Mechanistic Reasoning: A Pathway Toward Stem Integration, Paul J. Weinberg

Journal of Pre-College Engineering Education Research (J-PEER)

Because reasoning about mechanism is critical to disciplined inquiry in science, technology, engineering, and mathematics (STEM) domains, this study focuses on ways to support the development of this form of reasoning. This study attends to how mechanistic reasoning is constituted through mathematical description. This study draws upon Smith’s (2007) characterization of mathematical description of scientific phenomena as ‘‘bootstrapping,’’ where negotiating the relationship between target phenomena and represented relations is fundamental to learning. In addition, the development of mathematical representation presents a viable pathway towards STEM integration. In this study, participants responded to an assessment of mechanistic reasoning while cognitive interviews …

A Compact Introduction To A Generalized Extreme Value Theorem, Nicholas A. Scoville

Topology

In a short paper published just one year prior to his thesis, Maurice Frechet gives a simple generalization one what we might today call the Extreme value theorem. This generalization is a simple matter of coming up with ``the right" definitions in order to make this work. In this mini PSP, we work through Frechet's entire 1.5 page paper to give an extreme value theorem in more general topological spaces, ones which, to use Frechet's newly coined term, are compact.

The Closure Operation As The Foundation Of Topology, Nicholas A. Scoville

Topology

No abstract provided.

An Introduction To Topology For The High School Student, Nathaniel Ferron

Masters Essays

No abstract provided.