Related papers: Relative Topological Complexity and Configuration …
Many mechanical systems have configuration spaces that admit symmetries. Mathematically, such symmetries are modelled by the action of a group on a topological space. Several variations of topological complexity have emerged that take…
We investigate instability phenomena for linear evolution equations within the framework of $C_0$--semigroups on infinite--dimensional spaces. We show that Devaney chaos, being formulated in purely topological terms, may depend on the…
How hard is it to program $n$ robots to move about a long narrow aisle such that only $w$ of them can fit across the width of the aisle? In this paper, we answer that question by calculating the topological complexity of $\text{conf}(n,w)$,…
Although random cell complexes occur throughout the physical sciences, there does not appear to be a standard way to quantify their statistical similarities and differences. The various proposals in the literature are usually motivated by…
$c$-realcompact spaces are introduced by Karamzadeh and Keshtkar in Quaest. Math. 41(8), 2018, 1135-1167. We offer a characterization of these spaces $X$ via $c$-stable family of closed sets in $X$ by showing that $X$ is $c$-realcompact if…
We characterize embedded $\C^1$ hypersurfaces of $\R^n$ as the only locally closed sets with continuously varying flat tangent cones whose measure-theoretic-multiplicity is at most $m<3/2$. It follows then that any (topological)…
Topological complexity for spaces was introduced by M. Farber as a minimal number of continuity domains for motion planning algorithms. It turns out that this notion can be extended to the case of not necessarily commutative C*-algebras.…
This paper studies the computational difficulty of clustering problems that are defined directly on a continuous probability density. Rather than working with finite samples, we assume the density is given as a polynomial and ask whether it…
This paper aims to examine the version of the topological group structure in proximity and especially descriptive proximity spaces, that is, the concepts of proximal group and descriptive proximal group are introduced. In addition, the…
In this paper we prove the probabilistic continuous complexity conjecture. In continuous complexity theory, this states that the complexity of solving a continuous problem with probability approaching 1 converges (in this limit) to the…
We study the question of what is computable by Turing machines equipped with time travel into the past; i.e., with Deutschian closed timelike curves (CTCs) having no bound on their width or length. An alternative viewpoint is that we study…
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…
Relatively extremal knots are the relative minima of the ropelength functional in C^1 topology. On the set curves of fixed length, they are the relative maxima of thickness (normal injectivity radius) functional, including the ideal knots.…
We study the topological dynamics by iterations of a piecewise continuous, non linear and locally contractive map in a real finite dimensional compact ball. We consider those maps satisfying the "separation property": different continuity…
We study the topology of a class of proper submodules and some of its distinguished subclasses and call them structure spaces. We give several criteria for the quasi-compactness of these structure spaces. We study $T_0$ and $T_1$ separation…
The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…
Topology of urban environments can be represented by means of graphs. We explore the graph representations of several compact urban patterns by random walks. The expected time of recurrence and the expected first passage time to a node…
We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
This paper introduces the structure and axioms for a temporal digital topology (TDT) with the focus on digital connectedness, continuity and proximities in TDT spaces. Results are given for temporal digital adjacencies, connectedness and…
Let $X$ and $Y$ be topological spaces, let $Z$ be a metric space, and let $f: X\times Y\to Z$ be a mapping. It is shown that when $Y$ has a countable base $\mathcal B$, then under a rather general condition on the set-valued mappings $X\ni…