Unlinking numbers of links with crossing number 10

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unlinking Number and Unlinking Gap

After introducing the Bernhard-Jablan Conjecture, we computed rational links with an unlinking gap for n ≤ 16 crossings. Several new infinite multi-parameter families of rational knots and links with unlinking gap are described. The general principle for the construction of infinite families of links with an unlinking gap is proposed. New infinite families of polyhedral alternating links with u...

متن کامل

Unlinking via Simultaneous Crossing Changes

Given two distinct crossings of a knot or link projection, we consider the question: Under what conditions can we obtain the unlink by changing both crossings simultaneously? More generally, for which simultaneous twistings at the crossings is the genus reduced? Though several examples show that the answer must be complicated, they also suggest the correct necessary conditions on the twisting n...

متن کامل

Triple Crossing Number of Knots and Links

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove that every knot and link has a triple crossing projection and then investigate c3(K), which is the minimum number of triple crossings in a projection of K. We o...

متن کامل

Boundary Slopes of 2-Bridge Links Determine the Crossing Number

A diagonal surface in a link exterior M is a properly embedded, incompressible, boundary incompressible surface which furthermore has the same number of boundary components and same slope on each component of ∂M . We derive a formula for the boundary slope of a diagonal surface in the exterior of a 2-bridge link which is analogous to the formula for the boundary slope of a 2-bridge knot found b...

متن کامل

Unknotting number and number of Reidemeister moves needed for unlinking

Article history: Received 25 April 2011 Received in revised form 11 January 2012 Accepted 11 January 2012

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Involve, a Journal of Mathematics

سال: 2018

ISSN: 1944-4184,1944-4176

DOI: 10.2140/involve.2018.11.335