Geometry and Topology Commons^™

The Jin And Jang Of Quantum Physics Truth Tables, Shannon Lieb, Jeremiah Farrell

Scholarship and Professional Work - LAS

No abstract provided.

Paul Swinford – A Tribute, Jeremiah Farrell

Scholarship and Professional Work - LAS

No abstract provided.

Kate Jones – A Tribute, Karen Farrell, Jeremiah Farrell

Scholarship and Professional Work - LAS

Kate is also an accomplished recreational mathematician and poet. To try to match in a small way her creative ability, we offer three puzzle-games in her honor: O'BEIRNE's TRI-HEX, PAPPUS and "KATe JONES". These three are specific examples of (9,3) symmetric configurations. More generally an (n,r) configuration is a collection of n "points"and n "lines" subject to the following requirements:

Rl: Any two points belong to at most one line.

R2: Each line has r points, and each point belongs to r lines.

Geodesics In Lorentzian Manifolds, Amir A. Botros

Electronic Theses, Projects, and Dissertations

We present an extension of Geodesics in Lorentzian Manifolds (Semi-Riemannian Manifolds or pseudo-Riemannian Manifolds ). A geodesic on a Riemannian manifold is, locally, a length minimizing curve. On the other hand, geodesics in Lorentzian manifolds can be viewed as a distance between ``events''. They are no longer distance minimizing (instead, some are distance maximizing) and our goal is to illustrate over what time parameter geodesics in Lorentzian manifolds are defined. If all geodesics in timelike or spacelike or lightlike are defined for infinite time, then the manifold is called ``geodesically complete'', or simply, ``complete''. It is easy to show that …

A Counterexample For Lightning Flash Modules Over E(E1,E2), David Benson, Robert R. Bruner

Mathematics Faculty Research Publications

We give a counterexample to Theorem 5 in Section 18.2 of Margolis’ book, “Spectra and the Steenrod Algebra” and make remarks about the proofs of some later theorems in the book that depend on it. The counterexample is a module which does not split as a sum of lightning flash modules and free modules.

Single Valued Neutrosophic Graphs, Florentin Smarandache, Said Broumi, Assia Bakali, Mohamed Talea

Branch Mathematics and Statistics Faculty and Staff Publications

The notion of single valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets. We apply the concept of single valued neutrosophic sets, an instance of neutrosophic sets, to graphs. We introduce certain types of single valued neutrosophic graphs (SVNG) and investigate some of their properties with proofs and examples.

An Introduction To Differential Geometry Through Computation, Mark E. Fels

Mathematics and Statistics Faculty Presentations

No abstract provided.

Convexity Of Neural Codes, Robert Amzi Jeffs

HMC Senior Theses

An important task in neuroscience is stimulus reconstruction: given activity in the brain, what stimulus could have caused it? We build on previous literature which uses neural codes to approach this problem mathematically. A neural code is a collection of binary vectors that record concurrent firing of neurons in the brain. We consider neural codes arising from place cells, which are neurons that track an animal's position in space. We examine algebraic objects associated to neural codes, and completely characterize a certain class of maps between these objects. Furthermore, we show that such maps have natural geometric implications related to …

The Kretschmann Scalar, Charles G. Torre

How to... in 10 minutes or less

On a pseudo-Riemannian manifold with metric g, the "Kretschmann scalar" is a quadratic scalar invariant of the Riemann R tensor of g, defined by contracting all indices with g. In this worksheet we show how to calculate the Kretschmann scalar from a metric.

A Special Tribute To Martin Gardner, Jeremiah Farrell

Scholarship and Professional Work - LAS

There are exactly 12 different letters in the phrase GATHERING FOR MARTIN GARDNER. We use each of the 12 letters three times each in 18 different two-letter words that are to be placed on the nodes of the graph so adjoining nodes have a letter in common.

Hidden Symmetries And Commensurability Of 2-Bridge Link Complements, Christian Millichap, William Worden

Faculty Publications

In this paper, we show that any nonarithmetic hyperbolic 2-bridge link complement admits no hidden symmetries. As a corollary, we conclude that a hyperbolic 2-bridge link complement cannot irregularly cover a hyperbolic 3-manifold. By combining this corollary with the work of Boileau and Weidmann, we obtain a characterization of 3-manifolds with nontrivial JSJ-decomposition and rank-two fundamental groups. We also show that the only commensurable hyperbolic 2-bridge link complements are the figure-eight knot complement and the 6²₂ link complement. Our work requires a careful analysis of the tilings of R² that come from lifting the canonical triangulations of …

Locally Anisotropic Toposes, Jonathon Funk, Pieter Hofstra

Publications and Research

This paper continues the investigation of isotropy theory for toposes. We develop the theory of isotropy quotients of toposes, culminating in a structure theorem for a class of toposes we call locally anisotropic. The theory has a natural interpretation for inverse semigroups, which clarifies some aspects of how inverse semigroups and toposes are related.

Classification Of Compact 2-Manifolds, George H. Winslow

Theses and Dissertations

It is said that a topologist is a mathematician who can not tell the difference between a doughnut and a coffee cup. The surfaces of the two objects, viewed as topological spaces, are homeomorphic to each other, which is to say that they are topologically equivalent. In this thesis, we acknowledge some of the most well-known examples of surfaces: the sphere, the torus, and the projective plane. We then observe that all surfaces are, in fact, homeomorphic to either the sphere, the torus, a connected sum of tori, a projective plane, or a connected sum of projective planes. Finally, we …

Algorithmic Foundations Of Heuristic Search Using Higher-Order Polygon Inequalities, Newton Henry Campbell Jr.

CCAC Theses and Dissertations

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two landmarks when visiting a vertex as opposed to the common single landmark …

Alexander And Writhe Polynomials For Virtual Knots, Blake Mellor

Mathematics, Statistics and Data Science Faculty Works

We give a new interpretation of the Alexander polynomial Δ₀ for virtual knots due to Sawollek and Silver and Williams, and use it to show that, for any virtual knot, Δ₀ determines the writhe polynomial of Cheng and Gao (equivalently, Kauffman's affine index polynomial). We also use it to define a second-order writhe polynomial, and give some applications.

Exploration Of Curvature Through Physical Materials, Lucinda-Joi Chu-Ketterer

Pitzer Senior Theses

Parametric equations are commonly used to describe surfaces. Looking at parametric equations does not provide tangible information about an object. Thus through the use of physical materials, an understanding of the limitations of the materials allows someone to gain a broader understanding of the surface. A M$\ddot{o}$bius strip and Figure 8 Klein bottle were created through knitting due to the precision and steady increase in curvature allowed through knitting. A more standard Klein bottle was created through crochet due to the ease in creating quick increases in curvature. Both methods demonstrate the change in curvature for both surfaces where the …

In Search Of A Class Of Representatives For Su-Cobordism Using The Witten Genus, John E. Mosley

Theses and Dissertations--Mathematics

In algebraic topology, we work to classify objects. My research aims to build a better understanding of one important notion of classification of differentiable manifolds called cobordism. Cobordism is an equivalence relation, and the equivalence classes in cobordism form a graded ring, with operations disjoint union and Cartesian product. My dissertation studies this graded ring in two ways:

1. by attempting to find preferred class representatives for each class in the ring.

2. by computing the image of the ring under an interesting ring homomorphism called the Witten Genus.

Nuclear Space Facts, Strange And Plain, Jeremy Becnel, Ambar Sengupta

Faculty Publications

We present a scenic but practical guide through nuclear spaces and their dual spaces, examining useful, unexpected, and often unfamiliar results both for nuclear spaces and their strong and weak duals.

Links With Finite N-Quandles, Jim Hoste, Patrick D. Shanahan

Mathematics, Statistics and Data Science Faculty Works

We prove a conjecture of Przytycki which asserts that the n-quandle of a link L in the 3-sphere is finite if and only if the fundamental group of the n-fold cyclic branched cover of the 3-sphere, branched over L, is finite.

Colorings, Determinants And Alexander Polynomials For Spatial Graphs, Terry Kong, Alec Lewald, Blake Mellor, Vadim Pigrish

Mathematics, Statistics and Data Science Faculty Works

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We use the Alexander module to define the determinant and p-colorings of a balanced spatial graph, and provide examples. We show that the determinant of a spatial graph determines for which p the graph is p-colorable, and that a p-coloring of a graph corresponds to a representation of …