Intrinsic linking and knotting are arbitrarily complex

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

18 pages, 5 figures. Proposition 2 has been strengthened, and Corollary 1 and Proposition 3 have been added to answer a questi

Scientific paper

We show that, given any $n$ and $\alpha$, every embedding of any sufficiently
large complete graph in $\mathbb{R}^3$ contains an oriented link with
components $Q_1$, ..., $Q_n$ such that for every $i\not =j$,
$|\lk(Q_i,Q_j)|\geq\alpha$ and $|a_2(Q_i)|\geq\alpha$, where $a_{2}(Q_i)$
denotes the second coefficient of the Conway polynomial of $Q_i$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Intrinsic linking and knotting are arbitrarily complex does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Intrinsic linking and knotting are arbitrarily complex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Intrinsic linking and knotting are arbitrarily complex will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-390652

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.