Intrinsic linking with linking numbers of specified divisibility

Abstract: Let

n

,

q

and

r

be positive integers, and let

K_{N}^{n}

be the

n

-skeleton of an

(N - 1)

-simplex. We show that for

N

sufficiently large every embedding of

K_{N}^{n}

in

m a t h b b R^{2 n + 1}

contains a link

L_{1} c u p c d o t s c u p L_{r}

consisting of

r

disjoint

n

-spheres, such that the linking number

l i n k (L_{i}, L_{j})

is a nonzero multiple of

q

for all

i e q j

. This result is new in the classical case

n = 1

(graphs embedded in

m a t h b b R^{3}

) as well as the higher dimensional cases

n g e q 2

; and since it implies the existence of a link

L_{1} c u p c d o t s c u p L_{r}

such that

| l i n k (L_{i}, L_{j}) | g e q q

for all

i e q j

, it also extends a result of Flapan et al. from

n = 1

to higher dimensions. Additionally, for

r = 2

we obtain an improved upper bound on the number of vertices required to force a two-component link

L_{1} c u p L_{2}

such that

l i n k (L_{1}, L_{2})

is a nonzero multiple of

q

. Our new bound has growth

O (n q^{2})

, in contrast to the previous bound of growth

O (s q r t n 4^{n} q^{n + 2})

.

Recommendations

Cites work

Cited in

(4)

This page was built for publication: Intrinsic linking with linking numbers of specified divisibility