Topology Marianelly Lopez Anita Roman Jose Valencia Joe Williams.

Slides:



Advertisements
Similar presentations
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Advertisements

Visibility Graph Team 10 NakWon Lee, Dongwoo Kim.
Mathematics Combinatorics Graph Theory Topological Graph Theory David Craft.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
An Introduction to Topology Linda Green Nueva Math Circle September 30, 2011 Images from virtualmathmuseum.org.
An Introduction to Topology Linda Green
Computational Topology for Computer Graphics Klein bottle.
Lecture 1: The Euler characteristic of a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305) Topics in Topology: Scientific.
Surfaces and Topology Raymond Flood Gresham Professor of Geometry.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
Kenta Noguchi Keio University Japan 2012/5/301Cycles in Graphs.
Topology YAN JIE (Ryan).
Realizability of Graphs Maria Belk and Robert Connelly.
What is the next line of the proof? a). 2q = 6p. b). 2q = 6r c). 2q  6pd). 2q  6r e). 2q  6pf). 2q  6r.
Cutting a surface into a Disk Jie Gao Nov. 27, 2002.
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs Y. Rabinovich R. Raz DCG 19 (1998) Iris Reinbacher COMP 670P
Geometry of Infinite Graphs Jim Belk Bard College.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Graphs Chapter 20 Data Structures and Problem Solving with C++: Walls and Mirrors, Frank Carrano, © 2012.
The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.
Chapter 4 Graphs.
MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.
Minimum Spanning Trees. Subgraph A graph G is a subgraph of graph H if –The vertices of G are a subset of the vertices of H, and –The edges of G are a.
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
Slide 14-1 Copyright © 2005 Pearson Education, Inc. SEVENTH EDITION and EXPANDED SEVENTH EDITION.
Maps. Graphs on Surfaces We are mainly interested in embeddings of graphs on surfaces:  : G ! S. An embedding should be differentiated from immersion.
© 2010 Pearson Prentice Hall. All rights reserved. CHAPTER 10 Geometry.
How many faces do you get from walking the faces of this rotation system of K 4 ? Is this an embedding of K 4 in the plane? 0 : : : 0 3.
Mobius Band By: Katie Neville.
PART 1 SOLID SHAPES Two-dimensional Shapes (2D) These shapes are flat and can only be drawn on paper. They have two dimensions – length and width.
Graphs, Puzzles, & Map Coloring
Euler’s characteristic and the sphere
Section 5.1 Rubber Sheet Geometry Discovering the Topological Idea of Equivalence by Distortion. “The whole of mathematics is nothing more than a refinement.
Fall 2015 COMP 2300 Discrete Structures for Computation Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1.
Stefan Felsner planar graph G planar embedding of G A graph G is planar if it can be drawn on the plane with no crossing edges.
Solid Modeling Ref. Mantyla. Introduction Aim of modeling: The search of a media of communication.
Geometry out of the Paper Dr. Jessica Purcell University of Texas at Austin An Introduction to Manifolds.
Graphs, Paths & Circuits
Graphs. Graphs Similar to the graphs you’ve known since the 5 th grade: line graphs, bar graphs, etc., but more general. Those mathematical graphs are.
AND.
Walks, Paths and Circuits. A graph is a connected graph if it is possible to travel from one vertex to any other vertex by moving along successive edges.
3D Solid Modeling Moving From 2D to 3D Project Lead The Way, Inc.
Graphs. Contents Terminology Graphs as ADTs Applications of Graphs.
Tree Diagrams A tree is a connected graph in which every edge is a bridge. There can NEVER be a circuit in a tree diagram!
Euler characteristic (simple form):
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Copyright © 2009 Pearson Education, Inc. Chapter 14 Section 1 – Slide Graph Theory Graphs, Paths & Circuits.
Topology and The Euler Number
Graphs Chapter 20.
Random remarks about random walks
AND.
Foundation Vocabulary
Hexagonal Pyramid cut at an angle #2
3D Solid Modeling Moving From 2D to 3D
CS120 Graphs.
Comp 245 Data Structures Graphs.
Can you draw this picture without lifting up your pen/pencil?
Walks, Paths, and Circuits
Warm Up – Wednesday.
Graph Theory What is a graph?.
Graphs, Paths & Circuits
Mathematics for Computer Science MIT 6.042J/18.062J
Simple Graphs: Connectedness, Trees
Warm Up – Tuesday Find the critical times for each vertex.
Miniature Train Wheels.
Warm Up – 3/19 - Wednesday Give the vertex set. Give the edge set.
Richard Anderson Winter 2019 Lecture 6
Properties of Matter By Mrs. Walsh.
Drawing a graph
Presentation transcript:

Topology Marianelly Lopez Anita Roman Jose Valencia Joe Williams

Topology vs. Geometry Topology is the study of objects/spaces that are the same under homeomorphism. In topology distance or angles of an object/ space doesn’t matter. In geometry angles or distances are required to find the shape of an object.

Dimensions 0-D: points 1-D: object that can be disconnected by removing a finite # of 0-D objects 2-D:object that can be disconnected by removing a finite # of 1-D objects 3-D: object that can be disconnected by removing a finite # of 2-D objects

Cuts Used to determine dimension Definition of Dimension Can be used a finite number of times Cannot be used to make homeomorphism true for shapes

Graphs Trees- shapes that force you to take the same path to reach the starting point Cycles- shapes that you can take another path around to reach the starting point

Homeomorphism Homeomorphism are continuous invertible functions/ maps.Homeomorphism are continuous invertible functions/ maps. Continuous functions/maps are two points that start close to each other and end close to each other.Continuous functions/maps are two points that start close to each other and end close to each other.

The Euler Characteristic χ= v - e Χ= kai, v= vertices, e= edges Χ= kai, v= vertices, e= edges Theory for trees χ=1 Theory for cycles χ= 0 Boundary points cannot be in the middle of a line in a homeomorphic shape

Mobius Strip A non-oriental surface that has only one boundary. When something goes from one end of it all the way around, they completely flip upside down. “P=d”