Subevent of Graphs Session #3
‟An intrinsically linked simplicial $n$-complex” by Ryo Nikkuni <nick@lab.twcu.ac.jp>, Tokyo Woman's Christian University
Abstract:
We say that a simplicial $n$-complex is intrinsically linked if every embedding of its polyhedron into $(2n+1)$-dimensional Euclidean space contains a pair of disjoint $n$-spheres with a nonzero linking number. Several examples of intrinsically linked $n$-complexes are known. In this talk, we present a new example of such an $n$-complex.