Related papers: On Targeted Complexity of Discrete Motion
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
Given two finite abstract simplicial complexes A and B, one can define a new simplicial complex on the set of simplicial maps from A to B. After adding two technicalities, we call this complex Homsc(A, B). We prove the following dichotomy:…
In this paper, we investigate automorphisms of compact K\"ahler manifolds with different levels of topological triviality. In particular, we provide several examples of smooth complex projective surfaces X whose groups of…
In this paper, we give a topological version of Scott convergence theorem for locally hypercompact spaces. We introduce the notion of $\mathcal{S}^*_X$-convergence on a $T_0$ topological space $X$, and define the notion of finitely…
In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong…
Autonomous motion of a system (robot) is controlled by a motion planning algorithm. A sequential parametrized motion planning algorithm \cite{FP22} works under variable external conditions and generates continuous motions of the system to…
We introduce the constrained topological sorting problem (CTS): given a regular language K and a directed acyclic graph G with labeled vertices, determine if G has a topological sort that forms a word in K. This natural problem applies to…
Increasingly stringent throughput requirements in the industry necessitate the need for lightweight design of high-precision motion systems to allow for high accelerations, while still achieving accurate positioning of the moving-body. The…
When planning motions in a configuration space that has underlying symmetries (e.g. when manipulating one or multiple symmetric objects), the ideal planning algorithm should take advantage of those symmetries to produce shorter…
We introduce a canonical, compact topology, which we call weakly causal, naturally generated by the causal site of J. D. Christensen and L. Crane, a pointless algebraic structure motivated by certain problems of quantum gravity. We show…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…
This paper explores further the computation of the twisted K-theory and K-homology of compact simple Lie groups, previously studied by Hopkins, Moore, Maldacena-Moore-Seiberg, Braun, and Douglas, with a focus on groups of rank 2. We give a…
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…
Given $q\in\mathbb{N}$, let $(X,T)$ be a $\mathbb{Z}^q$-system, $\vec{v}\in\mathbb{R}^q\setminus\{\vec{0}\}$ be a direction vector and $\textbf{b}\in\mathbb{R}_+^{q-1}$. We study $(X,T)$ that has bounded complexity with respect to three…
Let $\mathcal{C}(n,k)$ be the set of $k$-dimensional simplicial complexes $C$ over a fixed set of $n$ vertices such that: (1) $C$ has a complete $k-1$-skeleton; (2) $C$ has precisely ${{n-1}\choose {k}}$ $k$-faces; (3) the homology group…
Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…
A simplicial complex is a generalization of a graph: a collection of n-ary relationships (instead of binary as the edges of a graph), named simplices. In this paper, we develop a new tool to study the structure of simplicial complexes: we…
We generalize some homotopy calculation techniques such as splittings and matching trees that are introduced for the computations in the case of the independence complexes of graphs to arbitrary simplicial complexes, and exemplify their…
Let G/H be a pseudo-Riemannian semisimple symmetric space. The tangent bundle T(G/H) contains a maximal G-invariant neighbourhood of the zero section where the adapted complex structure exists. Such neighbourhood is endowed with a canonical…