兩種區(qū)分平面投影圖平面合痕類的算法.pdf

1、大連理工大學(xué)碩士學(xué)位論文兩種區(qū)分平面投影圖平面合痕類的算法姓名：盧婷申請學(xué)位級別：碩士專業(yè)：基礎(chǔ)數(shù)學(xué)指導(dǎo)教師：楊志青20090624兩種區(qū)分平面投影圖平面合痕類的算法TwoAlgorithmsDistinguishingDistinctLinkDiagramsuptoPlanarIsotopyAbstractTopology，whichisdevelopedinmodemtimes，isallimportantandbasicbranc

2、hofmathematics，focusingonthephenomenonofcontinuityKnottheoryisallattractivefieldoftopology，anditscentraltopicistheclassificationofknotsInpresent，mathematicianshavebeenabletodeterminewhethertwoknotsareequivalentIntheory，w

3、ecallcreateamachine，whichcandeterminewhethertwoinputofknotprojectionsareequivalentThisCallbedeterminedtheoretically，butnotpracticallyInactualcalculationmathematicianshaveinventedanumberofPolynomialInvariants，andthoseinva

4、riantsincludemoreinformationthanjusttheAlexanderPolynomialThisarticlemakesthefollowingexpansionandinnovationitintroducestwoalgorithmsdistinguishingdistinctlinkdiagramsuptoplanarisotopyThisarticleisstructuredasfollows：For

5、theproblemsofclassificationwediscussedisaboutknottheory，SO，fistofall，weintroducetopology，knottheoryandtheirhistoryofdevelopmentanditsapplicationinvariousfieldsinthefirstchapterInthesecondchapter，weintroducethebasicconcep

6、tsofknottheory，includingregularprojection，DTcode，aswellasthedetailsonhowtogetaDTcodefromaknotprojectionFinally，wehavealittlediscussiononthenumberofDTcodesinsomespecialknotsprojectionsChapterHIisacennaIpartofthisarticlefo

7、cusingontwomethodstodistinguishdistinctLinkdiagramsuptoPlanarIsotopyOnemethodis觚expansionoftheliterature【46]，theotherisfindingamapfromaknotdiagramtoanotherdiagramwhichsatisfiessomerestrictionsIfwecouldfindit，weCallsaytha