56 citations · 489 across the 89 of their papers we have counts for
118 papers
When does the table theorem imply a solution to the square peg problem?
Stefan Friedl, Kenan İnce
We will explain the relationship between one of the most beautiful theorems in topology, namely Fenn's Table Theorem, and one of the most famous open problems in topology, namely t…
Blanchfield pairings and Gordian distance
Stefan Friedl, Takahiro Kitayama, Masaaki Suzuki
A lower bound of the Gordian distance is presented in terms of the Blanchfield pairing. Our approach, in particular, allows us to show at least for 195 pairs of unoriented nontrivi…
Rational homology ribbon cobordism is a partial order
Stefan Friedl, Filip Misev, Raphael Zentner
We show that ribbon rational homology cobordism is a partial order within the class of irreducible 3-manifolds. This makes essential use of the methods recently employed by Ian Ago…
Canonical decompositions and algorithmic recognition of spatial graphs
Stefan Friedl, Lars Munser, José Pedro Quintanilha +1
We prove that there exists an algorithm for determining whether two piecewise-linear spatial graphs are isomorphic. In its most general form, our theorem applies to spatial graphs…
Epimorphism testing with virtually Abelian targets
Stefan Friedl, Clara Loeh
We show that the epimorphism problem is solvable for targets that are virtually cyclic or a product of an Abelian group and a finite group.
Homotopy ribbon concordance, Blanchfield pairings, and twisted Alexander polynomials
Stefan Friedl, Takahiro Kitayama, Lukas Lewark +2
We establish homotopy ribbon concordance obstructions coming from the Blanchfield form and Levine-Tristram signatures. Then, as an application of twisted Alexander polynomials, we…