A New Bound on Odd Multicrossing Numbers of Knots and Links

نویسندگان

چکیده

An n-crossing projection of a link L is onto plane such that n points on are superimposed top each other at every crossing. We prove for all k?? and links L, the inequality c2k+1(L)?2g(L)+r(L)?1k2 holds, where c2k+1(L), g(L) r(L) (2k+1)-crossing number, 3-genus, number components respectively. This result used to new bound odd crossing numbers torus knots generalizes Jablonowski (see [M. Jab?onowski, Triple-crossing genus knot or knots, Topology Appl.285 (2020) 107389]). also upper 5-crossing 2-torus links. Furthermore, we improve lower bounds 82 with 2-crossing most 12. Finally, 7-crossing 5

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

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

منابع مشابه

Stick Numbers of 2-bridge Knots and Links

Negami found an upper bound on the stick number s(K) of a nontrivial knot K in terms of the minimal crossing number c(K) of the knot, which is s(K) ≤ 2c(K). Furthermore, McCabe proved that s(K) ≤ c(K) + 3 for a 2-bridge knot or link, except in the cases of the unlink and the Hopf link. In this paper we construct any 2-bridge knot or link K of at least six crossings by using only c(K) + 2 straig...

متن کامل

An Upper Bound for Odd Perfect Numbers

If N is an odd perfect number with k distinct prime factors then we show that N < 2 k . If some of the small prime factors of N are known then this bound can be further improved.

متن کامل

on the comparison of keyword and semantic-context methods of learning new vocabulary meaning

the rationale behind the present study is that particular learning strategies produce more effective results when applied together. the present study tried to investigate the efficiency of the semantic-context strategy alone with a technique called, keyword method. to clarify the point, the current study seeked to find answer to the following question: are the keyword and semantic-context metho...

15 صفحه اول

A Lower Bound for the Set of Odd Perfect Numbers

It is proved here that if n is odd and perfect, then n > 10s0. Whether or not the set of odd perfect numbers is empty is still an open, and apparently very difficult, question. However, many properties of the elements of this set have been determined. For example, it is well known that if n is both odd and perfect, then (1) n = po Pi • • • p, where the/», are distinct primes, pa = a0 = 1 (mod 4...

متن کامل

On Free Knots and Links

Both classical and virtual knots arise as formal Gauss diagrams modulo some abstract moves corresponding to Reidemeister moves. If we forget about both over/under crossings structure and writhe numbers of knots modulo the same Reidemeister moves, we get a dramatic simplification of virtual knots, which kills all classical knots. However, many virtual knots survive after this simplification. We ...

متن کامل

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


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

ژورنال

عنوان ژورنال: Journal of Knot Theory and Its Ramifications

سال: 2022

ISSN: ['1793-6527', '0218-2165']

DOI: https://doi.org/10.1142/s0218216522500080