A. Skopenkov

activity

20212026

most citedA quadratic estimation for the Kühnel conjecture on embeddings

1 citations · 1 across the 10 of their papers we have counts for

collaborators

Showing math.GTShow all

3 papers · 1 filter

math.GT2026

Linking invariants of spatial graphs

E. Alkin, Yu. Khromin, A. Skopenkov

We recall definitions of linking numbers and Wu--Simon numbers for spatial graphs. We expose a `converse' to the Conway--Gordon--Sachs theorem (i.e. description of linking function…

math.GT2024

Invariants of almost embeddings of graphs in the plane

E. Alkin, A. Miroshnikov, A. Skopenkov

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely,…

math.GT2021

Embeddings of $k$ -complexes in $2 k$ -manifolds and minimum rank of partial symmetric matrices

A. Skopenkov

Let $K$ be a $k$ -dimensional simplicial complex having $n$ faces of dimension $k$ , and $M$ a closed $(k - 1)$ -connected PL $2 k$ -dimensional manifold. We prove that for $k \geq 3$ odd $K…

Linking invariants of spatial graphs

Invariants of almost embeddings of graphs in the plane

Embeddings of k-complexes in 2k-manifolds and minimum rank of partial symmetric matrices

Embeddings of $k$ -complexes in $2 k$ -manifolds and minimum rank of partial symmetric matrices