Related papers: Algorithmic solvability of the lifting-extension p…
A simplicial complex is d-collapsible if it can be reduced to an empty complex by repeatedly removing (collapsing) a face of dimension at most d-1 that is contained in a unique maximal face. We prove that the algorithmic question whether a…
The theory of lifting classes and the Reidemeister number of single-valued maps of a finite polyhedron $X$ is extended to $n$-valued maps by replacing liftings to universal covering spaces by liftings with codomain an orbit configuration…
Optimizing and certifying the positivity of polynomials are fundamental primitives across mathematics and engineering applications, from dynamical systems to operations research. However, solving these problems in practice requires large…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
If $\mathcal C$ is a class of complexes closed under taking full subcomplexes and covers and $\mathcal G$ is the class of groups admitting proper and cocompact actions on one-connected complexes in $\mathcal C$, then $\mathcal G$ is closed…
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
This thesis addresses the question of the maximal number of $d$-simplices for a simplicial complex which is embeddable into $\mathbb{R}^r$ for some $d \leq r \leq 2d$. A lower bound of $f_d(C_{r + 1}(n)) =…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
This paper proves that the homotopy type of a pointed, simply-connected, 2-reduced simplicial set is determined by the chain-complex augmented by functorial diagonal and higher diagonal maps (a simple generalization of the ones used to…
We introduce and analyze parallelizable algorithms to compress and accurately reconstruct finite simplicial complexes that have non-trivial automorphisms. The compressed data -- called a complex of groups -- amounts to a functor from (the…
We present a simple criterion for solvability of lattice spin systems on the basis of the graph theory and the simplicial homology. The lattice systems satisfy algebras with graphical representations. It is shown that the null spaces of…
A simplicial complex is a set equipped with a down-closed family of distinguished finite subsets. This structure, usually viewed as codifying a triangulated space, is used here directly, to describe "spaces" whose geometric realisation can…
We consider the embeddability problem of a graph G into a two-dimensional simplicial complex C: Given G and C, decide whether G admits a topological embedding into C. The problem is NP-hard, even in the restricted case where C is…
This paper provides a fixed point theorem and iterative construction of a common fixed point for a general class of nonlinear mappings in the setup of uniformly convex hyperbolic spaces. We translate a multi-step iteration, essentially due…
We study the computational complexity of the Word Problem (WP) in free solvable groups $S_{r,d}$, where $r \geq 2$ is the rank and $d \geq 2$ is the solvability class of the group. It is known that the Magnus embedding of $S_{r,d}$ into…
The problem of extending partial geometric graph representations such as plane graphs has received considerable attention in recent years. In particular, given a graph $G$, a connected subgraph $H$ of $G$ and a drawing $\mathcal{H}$ of $H$,…
We study the problem of lifting of polynomial symplectomorphisms in characteristic zero to automorphisms of the Weyl algebra by means of approximation by tame automorphisms. We utilize -- and reprove -- D. Anick's fundamental result on…
Given a generic PL map or a generic smooth fold map $f:N^n\to M^m$, where $m\ge n$ and $2(m+k)\ge 3(n+1)$, we prove that $f$ lifts to a PL or smooth embedding $N\to M\times\mathbb R^k$ if and only if its double point locus $\{(x,y)\in…
In a recent paper, it was shown that the problem of existence of a continuous map $X \to Y$ extending a given map $A \to Y$ defined on a subspace $A \subseteq X$ is undecidable, even for $Y$ an even-dimensional sphere. In the present paper,…
A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…