activity
20062026
most citedDarboux cyclides and webs from circles

43 citations · 163 across the 20 of their papers we have counts for

collaborators
Showing math.GTShow all

7 papers · 1 filter

math.GT2011

When is the set of embeddings finite up to isotopy?

Mikhail Skopenkov

Given a manifold N and a number m, we study the following question: is the set of isotopy classes of embeddings N->S^m finite? In case when the manifold N is a sphere the answer wa…

math.GT2008

On the Pontryagin-Steenrod-Wu theorem

Dušan Repovš, Mikhail Skopenkov, Fulvia Spaggiari

This paper is on homotopy classification of maps of (n+1)-dimensional manifolds into the n-dimensional sphere. For a continuous map f of an (n+1)-manifold into the n-sphere define…

math.GT2008

Embedding products of graphs into Euclidean spaces

Mikhail Skopenkov

For any collection of graphs we find the minimal dimension d such that the product of these graphs is embeddable into the d-dimensional Euclidean space. In particular, we prove tha…

math.GT2008

On approximability by embeddings of cycles in the plane

Mikhail Skopenkov

We obtain a criterion for approximability by embeddings of piecewise linear maps of a circle to the plane, analogous to the one proved by Minc for maps of a segment to the plane. T…

math.GT2008★ 6 cited

Homotopy type of the complement of an immersion and classification of embeddings of tori

M. Cencelj, D. Repovš, M. Skopenkov

This paper is devoted to the classification of embeddings of higher dimensional manifolds. We study the case of embeddings , which we call knotted tori. The s…

math.GT2007★ 1 cited

Classification of framed links in 3-manifolds

M. Cencelj, D. Repovš, M. Skopenkov

We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let be a connected or…