Intrinsic Properties of Spatial Graphs - Denison University

More documents

Recommendations

Info

$Math 232 syllabus - Denison University$

$Math 102 syllabus - Personal Pages - Denison University$

Introduction Linking and Knotting Other Intrinsic Properties ConclusionIntrinsic PropertiesThere are many other questions one could ask about intrinsicproperties of spatial graphs. One is asking which propertiesare, in fact, intrinsic: for example, the property of containingcomposite knots is not intrinsic.QuestionWhich measures of complexity for knots and/or links areintrinsically large? I.e. for any n there is a graph such that everyembedding of the graph contains a knot and/or link for whichthe measure is larger than n?For each such intrinsically large property, we can ask the samequestions we have asked about the linking number of links,crossing number of knots, etc.Blake MellorIntrinsic Properties of Spatial Graphs
Introduction Linking and Knotting Other Intrinsic Properties ConclusionExtrinsic PropertiesTheta graph 2-bouquet graph handcuff graphRather than looking at intrinsic properties of graphs, we couldask how to distinguish embeddings of a particular graph.Important examples are the θ graphs, bouquet graphs and thehandcuff graph. Various invariants, such as the Yamadapolynomial, have been developed to distinguish embeddings.Any question asked about knots can also be asked aboutspatial graphs, so the opportunities are endless!Blake MellorIntrinsic Properties of Spatial Graphs
Page 1 and 2: Introduction Linking and Knotting O
Page 41: Introduction Linking and Knotting O

Intrinsic Properties of Spatial Graphs - Denison University

Create successful ePaper yourself

Delete template?

Save as template?