Related papers: Topological complexity of n points on a tree
Network or graph structures are ubiquitous in the study of complex systems. Often, we are interested in complexity trends of these system as it evolves under some dynamic. An example might be looking at the complexity of a food web as…
Transitivity, the existence of periodic points and positive topological entropy can be used to characterize complexity in dynamical systems. It is known that for graphs that are not trees, for every $\varepsilon>0,$ there exist (complicate)…
We study the parameterized complexity of maximum temporal connected components (tccs) in temporal graphs, i.e., graphs that deterministically change over time. In a tcc, any pair of vertices must be able to reach each other via a…
We provide an upper bound on the topological complexity of twisted products. We use it to give an estimate $$TC(X)\le TC(\pi_1(X))+\dim X$$ of the topological complexity of a space in terms of its dimension and the complexity of its…
We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…
We define and develop a homotopy invariant notion for the sequential topological complexity of a map $f:X\to Y,$ denoted $TC_{r}(f)$, that interacts with $TC_{r}(X)$ and $TC_{r}(Y)$ in the same way Jamie Scott's topological complexity map…
Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…
The $s$-th higher topological complexity of a space $X$, $TC_s(X)$, can be estimated from above by homotopical methods, and from below by homological methods. We give a thorough analysis of the gap between such estimates when $X=RP^m$, the…
A model of topological field theory is presented in which the vacuum coupling constants are topological invariants of the four-dimensional spacetime. Thus the coupling constants are theoretically computable, and they indicate the…
Considerable efforts in modern statistical physics is devoted to the study of networked systems. One of the most important example of them is the brain, which creates and continuously develops complex networks of correlated dynamics. An…
We define a new version of Topological Complexity (TC) of a space, denoted as $\text{dTC}$, which, we think, fits better for motion planning for some autonomous systems. Like Topological complexity, \text{dTC} is also a homotopy invariant.…
The complexity of highly interconnected systems is rooted in the interwoven architecture defined by its connectivity structure. In this paper, we develop matrix energy of the underlying connectivity structure as a measure of topological…
A topology on a nonempty set $X$ specifies a natural subset of $\mathcal{P}(X)$. By identifying $\mathcal{P}(\mathcal{P}(X))$ with the totally disconnected compact Hausdorff space $2^{\mathcal{P}(X)}$, the lattice $Top(X)$ of all topologies…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
Some of the basic concepts of topology are explored through known physics problems. This helps us in two ways, one, in motivating the definitions and the concepts, and two, in showing that topological analysis leads to a clearer…
We develop the properties of the $n$-th sequential topological complexity $TC_n$, a homotopy invariant introduced by the third author as an extension of Farber's topological model for studying the complexity of motion planning algorithms in…
We introduce the higher topological complexity (TC_{n}) of a fibration in two ways: the higher homotopic distance and the Schwarz genus. Then we have some results on this notion related to TC, TC_{n} or cat of a topological space or a…
We introduce a bivariate version of topological complexity, $\mathrm{TC}(f,g)$, associated with two continuous maps $f\colon X\to Z$ and $g\colon Y\to Z$. This invariant measures the minimal number of continuous motion planning rules…
Farber introduced a notion of topological complexity $\TC(X)$ that is related to robotics. Here we introduce a series of numerical invariants $\TC_n(X), n=1,2, ...$ such that $\TC_2(X)=\TC(X)$ and $\TC_n(X)\le \TC_{n+1}(X)$. For these…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…