Some `converses' to intrinsic linking theorems

08/06/2020
by   R. Karasev, et al.
0

A low-dimensional version of our main result is the following `converse' of the Conway-Gordon-Sachs Theorem on intrinsic linking of the graph K_6 in 3-space: For any integer z there are 6 points 1,2,3,4,5,6 in 3-space, of which every two i,j are joint by a polygonal line ij, the interior of one polygonal line is disjoint with any other polygonal line, the linking coefficient of any pair disjoint 3-cycles except for {123,456} is zero, and for the exceptional pair {123,456} is 2z+1. We prove a higher-dimensional analogue, which is a `converse' of a lemma by Segal-Spież.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/25/2018

A short exposition of S. Parsa's theorems on intrinsic linking and non-realizability

We present a short exposition of the following results by S. Parsa. Le...
research
08/25/2018

A short exposition of S. Parsa's theorem on intrinsic linking and non-realizability

We present a short statement and proof of the following result by S. Par...
research
08/11/2019

Linking of three triangles in 3-space

Two triples of pairwise disjoint triangles in 3-space are combinatoriall...
research
08/23/2018

Asymmetric linkages: maxmin vs. reflected maxmin copulas

In this paper we introduce some new copulas emerging from shock models, ...
research
02/17/2020

A Note on Arc-Disjoint Cycles in Bipartite Tournaments

We show that for each non-negative integer k, every bipartite tournament...
research
01/16/2013

Marginalization in Composed Probabilistic Models

Composition of low-dimensional distributions, whose foundations were lai...

Please sign up or login with your details

Forgot password? Click here to reset