activity
20182026
collaborators
Showing math.GTShow all

6 papers · 1 filter

math.GT2026

Intrinsic linking of simplicial -complexes in : An additional minimal -complex

Ryo Nikkuni

For any positive integer , the author previously constructed several minimal simplicial -complexes which necessarily contain a non-splittable two-component link, consisting o…

math.GT2026

Intrinsic linking of a simplicial -complex embedded in

Ryo Nikkuni

We demonstrate the existence of minimal simplicial -complexes which inevitably contain a nonsplittable two-component link formed by an -sphere and an -sphere in any em…

math.GT2025

An intrinsically linked simplicial -complex

Ryo Nikkuni

For any positive integer , Segal--Spież, Lovász--Schrijver, Taniyama and Skopenkov provided examples of simplicial -complexes that inevitably contain a nonsplittable two-comp…

math.GT2025

A short proof of the generalized Conway--Gordon--Sachs theorem

Ryo Nikkuni

The famous Conway--Gordon--Sachs theorem for the complete graph on six vertices was extended to the general complete graph on vertices by Kazakov--Korablev as a congruence modu…

math.GT2020

Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs

Hiroko Morishita, Ryo Nikkuni

Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and Kazakov a…

math.GT2018

Generalizations of the Conway-Gordon theorems and intrinsic knotting on complete graphs

Hiroko Morishita, Ryo Nikkuni

In 1983, Conway and Gordon proved that for every spatial complete graph on six vertices, the sum of the linking numbers over all of the constituent two-component links is odd, and…