Related papers: Topological complexity of generic hyperplane arran…
We perform a refined complexity-theoretic analysis of three classical problems in the context of Hierarchical Task Network Planning: the verification of a provided plan, whether an executable plan exists, and whether a given state can be…
We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated by evaluation of so-called rank estimators used in robust…
We study the topological complexity, in the sense of Smale, of three enumerative problems in algebraic geometry: finding the 27 lines on cubic surfaces, the 28 bitangents and the 24 inflection points on quartic curves. In particular, we…
We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves…
We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…
In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…
We construct "higher" motion planners for automated systems whose space of states are homotopy equivalent to a polyhedral product space $Z(K,\{(S^{k_i},\star)\})$, e.g. robot arms with restrictions on the possible combinations of…
We prove that the ordered configuration spaces of planar graphs have the highest possible topological complexity generically, as predicted by a conjecture of Farber. Our argument establishes the same generic maximality for all higher…
We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…
We introduce and study the proper topological complexity of a given configuration space, a version of the classical invariant for which we require that the algorithm controlling the motion is able to avoid any possible choice of ``unsafe''…
In this paper we combine a survey of the most important topological properties of kinematic maps that appear in robotics, with the exposition of some basic results regarding the topological complexity of a map. In particular, we discuss…
In this paper we study paramertized motion planning algorithms which provide universal and flexible solutions to diverse motion planning problems. Such algorithms are intended to function under a variety of external conditions which are…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We compute the cohomology with group ring coefficients of the complement of a finite collection of affine hyperplanes in a finite dimensional complex vector space. It is nonzero in exactly one degree, namely the degree equal to the rank of…
For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…
We introduce a greedy algorithm optimizing arrangements of lines with respect to a property. We apply this algorithm to the case of simpliciality: it recovers all known simplicial arrangements of lines in a very short time and also produces…
We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…
We give an upper bound on the topological complexity of varieties $\mathcal{V}$ obtained as complements in $\mathbb{C}^m$ of the zero locus of a polynomial. As an application, we determine the topological complexity of unordered…
We compute the degree complexity of a family of birational mappings of the plane with high order singularities.
The dynamical system on T^2 which is a group extension over an irrational rotation on T^1 is investigated. The criterion when the extension is minimal, a system of order 2 and when the maximal equicontinuous factor is the irrational…