Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Other Mathematics
Enthymemathical Proofs And Canonical Proofs In Euclid’S Plane Geometry, Abel Lassalle, Marco Panza
Enthymemathical Proofs And Canonical Proofs In Euclid’S Plane Geometry, Abel Lassalle, Marco Panza
MPP Published Research
Since the application of Postulate I.2 in Euclid’s Elements is not uniform, one could wonder in what way should it be applied in Euclid’s plane geometry. Besides legitimizing questions like this from the perspective of a philosophy of mathematical practice, we sketch a general perspective of conceptual analysis of mathematical texts, which involves an extended notion of mathematical theory as system of authorizations, and an audience-dependent notion of proof.
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.
Self-Assembly Of Dna Graphs And Postman Tours, Katie Bakewell
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 …