Related papers: Algorithmic solvability of the lifting-extension p…
We introduce a new algorithm for the structural analysis of finite abstract simplicial complexes based on local homology. Through an iterative and top-down procedure, our algorithm computes a stratification $\pi$ of the poset $P$ of…
We prove the first polynomial bound on the number of monotonic homotopy moves required to tighten a collection of closed curves on any compact orientable surface, where the number of crossings in the curve is not allowed to increase at any…
It is shown that if T is a connected nontrivial graph and X is an arbitrary finite simplicial complex, then there is a graph G such that the complex Hom(T,G) is homotopy equivalent to X. The proof is constructive, and uses a nerve lemma.…
We prove lifting theorems for complex representations $V$ of finite groups $G$. Let $\sigma=(\sigma_1,\dots,\sigma_n)$ be a minimal system of homogeneous basic invariants and let $d$ be their maximal degree. We prove that any continuous map…
The question if a given partial solution to a problem can be extended reasonably occurs in many algorithmic approaches for optimization problems. For instance, when enumerating minimal dominating sets of a graph $G=(V,E)$, one usually…
A polynomial homotopy is a family of polynomial systems in one parameter, which defines solution paths starting from known solutions and ending at solutions of a system that has to be solved. We consider paths leading to isolated singular…
We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…
We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph $G=(V,E)$ and a vertex set $U \subseteq V$, it is asked if there exists a minimal vertex cover (resp.\ maximal independent set)…
The paper presents a first step towards a family index theorem for classical self-adjoint boundary value problems. We address here the simplest non-trivial case of manifolds with boundary, namely the case of two-dimensional manifolds. The…
The realization problem asks: When does an algebraic complex arise, up to homotopy, from a geometric complex? In the case of 2- dimensional algebraic complexes, this is equivalent to the D2 problem, which asks when homological methods can…
We study the linear extension complexity of stable set polytopes of perfect graphs. We make use of known structural results permitting to decompose perfect graphs into basic perfect graphs by means of two graph operations: 2-join and skew…
We build free, bigraded bidifferential algebra models for the forms on a complex manifold, with respect to a strong notion of quasi-isomorphism and compatible with the conjugation symmetry. This answers a question of Sullivan. The resulting…
For any finite group $G$, we define the notion of a Bredon homotopy action of $G$, modelled on the diagram of fixed point sets $(X_H)_{H\leq G}$ for a $G$-space $X$, together with a pointed homotopy action of the group $N_{G}H/H$ on…
The problem of decomposing non-manifold object has already been studied in solid modeling. However, the few proposed solutions are limited to the problem of decomposing solids described through their boundaries. In this thesis we study the…
Let $X$ and $Y$ be finite complexes. When $Y$ is a nilpotent space, it has a rationalization $Y \to Y_{(0)}$ which is well-understood. Early on it was found that the induced map $[X,Y] \to [X,Y_{(0)}]$ on sets of mapping classes is…
For finite abstract simplicial complex $\Sigma$, initial realization $\alpha$ in $\mathbb{E}^d$, and desired edge lengths $L$, we give practical sufficient conditions for the existence of a non-self-intersecting perturbation of $\alpha$…
We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a field of characteristic zero \(k\). We focus on systems with a…
We give new polynomial-time algorithms for testing isomorphism of a class of groups given by multiplication tables (GpI). Two results (Cannon & Holt, J. Symb. Comput. 2003; Babai, Codenotti & Qiao, ICALP 2012) imply that GpI reduces to the…
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…
In recent work on holomorphic maps that are symmetric under certain complex reflection groups---generated by complex reflections through a set of hyperplanes, the author announced a general conjecture related to reflection groups. The claim…