Adequacy of Link Families

Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Jablan, Slavik
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Jablan, Slavik
description Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number, and computed adequacy polynomial which is the invariant of alternating link families. Adequacy polynomial distinguishes (up to mutation) all families of alternating knots and links whose generating link has at most $n=12$ crossings.
doi_str_mv 10.48550/arxiv.0811.0081
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_0811_0081</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>0811_0081</sourcerecordid><originalsourceid>FETCH-LOGICAL-a651-c9b4cec828fb5d7da010820800d92913481cba1e1f346b2fea7ccbbc1fb66a93</originalsourceid><addsrcrecordid>eNotzjsPgjAUhuEuDgbddTH8AfCccisjIaImJA66k9PSJo3gBaKRf6-oy_duXx7GFgh-KKII1tS97NMHgejDZ6dsmdX6_iA1uFfjlvZydgtqbWN1P2MTQ02v5_867FhsTvnOKw_bfZ6VHsUReiqVodJKcGFkVCc1AYLgIADqlKcYhAKVJNRogjCW3GhKlJJSoZFxTGngsNXv9Surbp1tqRuqUViNwuANAwo0sQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Adequacy of Link Families</title><source>arXiv.org</source><creator>Jablan, Slavik</creator><creatorcontrib>Jablan, Slavik</creatorcontrib><description>Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number, and computed adequacy polynomial which is the invariant of alternating link families. Adequacy polynomial distinguishes (up to mutation) all families of alternating knots and links whose generating link has at most $n=12$ crossings.</description><identifier>DOI: 10.48550/arxiv.0811.0081</identifier><language>eng</language><subject>Mathematics - Geometric Topology</subject><creationdate>2008-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/0811.0081$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.0811.0081$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Jablan, Slavik</creatorcontrib><title>Adequacy of Link Families</title><description>Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number, and computed adequacy polynomial which is the invariant of alternating link families. Adequacy polynomial distinguishes (up to mutation) all families of alternating knots and links whose generating link has at most $n=12$ crossings.</description><subject>Mathematics - Geometric Topology</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzjsPgjAUhuEuDgbddTH8AfCccisjIaImJA66k9PSJo3gBaKRf6-oy_duXx7GFgh-KKII1tS97NMHgejDZ6dsmdX6_iA1uFfjlvZydgtqbWN1P2MTQ02v5_867FhsTvnOKw_bfZ6VHsUReiqVodJKcGFkVCc1AYLgIADqlKcYhAKVJNRogjCW3GhKlJJSoZFxTGngsNXv9Surbp1tqRuqUViNwuANAwo0sQ</recordid><startdate>20081101</startdate><enddate>20081101</enddate><creator>Jablan, Slavik</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20081101</creationdate><title>Adequacy of Link Families</title><author>Jablan, Slavik</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a651-c9b4cec828fb5d7da010820800d92913481cba1e1f346b2fea7ccbbc1fb66a93</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Mathematics - Geometric Topology</topic><toplevel>online_resources</toplevel><creatorcontrib>Jablan, Slavik</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Jablan, Slavik</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Adequacy of Link Families</atitle><date>2008-11-01</date><risdate>2008</risdate><abstract>Using computer calculations and working with representatives of pretzel tangles we established general adequacy criteria for different classes of knots and links. Based on adequate graphs obtained from all Kauffman states of an alternating link we defined a new numerical invariant: adequacy number, and computed adequacy polynomial which is the invariant of alternating link families. Adequacy polynomial distinguishes (up to mutation) all families of alternating knots and links whose generating link has at most $n=12$ crossings.</abstract><doi>10.48550/arxiv.0811.0081</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.0811.0081
ispartof
issn
language eng
recordid cdi_arxiv_primary_0811_0081
source arXiv.org
subjects Mathematics - Geometric Topology
title Adequacy of Link Families
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T23%3A48%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Adequacy%20of%20Link%20Families&rft.au=Jablan,%20Slavik&rft.date=2008-11-01&rft_id=info:doi/10.48550/arxiv.0811.0081&rft_dat=%3Carxiv_GOX%3E0811_0081%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true