Related papers: Relative Topological Complexity and Configuration …
Linear topological spaces with partial ordering (linear kinematics) are studied. They are defined by a set of 8 axioms implying that topology, linear structure and ordering are compatible with each other. Most of the results are valid for…
This paper studies the C-compact-open topology on the set C(X) of all realvalued continuous functions on a Tychonov space X and compares this topology with several well-known and lesser known topologies. We investigate the properties…
Let X, Y, and Z be topological modules over a topological ring $R$. In the first part of the paper, we introduce three different classes of bounded bigroup homomorphisms from $X\times Y$ into $Z$ with respect to the three different uniform…
Topological complexity is a numerical homotopy invariant that measures the instability of motion planning in a space. To study the topological complexity of non-simply connected spaces, Costa and Farber introduced a cohomology class whose…
Function space topologies are developed for EC(Y,Z), the class of equi-continuous mappings from a topological space Y to a uniform space Z. Properties such as splittingness, admissibility etc. are defined for such spaces. The net theoretic…
We introduce \emph{local Urysohn width}, a complexity measure for classification problems on metric spaces. Unlike VC dimension, fat-shattering dimension, and Rademacher complexity, which characterize the richness of hypothesis…
Let $X$ be a topological space. A subset of $C(X)$, the space of continuous real-valued functions on $X$, is a partially ordered set in the pointwise order. Suppose that $X$ and $Y$ are topological spaces, and $A(X)$ and $A(Y)$ are subsets…
Temporal graphs arise when modeling interactions that evolve over time. They usually come in several flavors, depending on the number of parameters used to describe the temporal aspects of the interactions: time of appearance, duration,…
We use Brown-Peterson cohomology to obtain lower bounds for the higher topological complexity, TC_k(RP^n), of real projective spaces, which are often much stronger than those implied by ordinary mod-2 cohomology.
In this paper, we focus on qualitative temporal sequences of topological information. We firstly consider the context of topological temporal sequences of length greater than 3 describing the evolution of regions at consecutive time points.…
The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…
In this paper, we introduce the notion of transversal topological complexity (TTC) for a smooth manifold $X$ with respect to a submanifold of codimension 1 together with basic results about this numerical invariant. In addition, we present…
In this short note we observe that the higher topological complexity of an iterated connected sum of real projective spaces is maximal possible. Unlike the case of regular TC, the result is accessible through easy mod 2 zero-divisor…
The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T. We study the computational complexity of CSP$(T_1…
We define the topological complexity sequence of a group as the sequence of topological complexities of its Milnor constructions. This sequence may be regarded as an intrinsic refinement of the topological complexity of a group and, unlike…
The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…
Topological spaces - such as classifying spaces, configuration spaces and spacetimes - often admit extra temporal structure. Qualitative invariants on such directed spaces often are more informative yet more difficult to calculate than…
We study the higher (or sequential) topological complexity $\mathrm{TC}_s$ of manifolds with abelian fundamental group. We give sufficient conditions for $\mathrm{TC}_s$ to be non-maximal in both the orientable and non-orientable cases. In…
We introduce the geodesic complexity of a metric space, inspired by the topological complexity of a topological space. Both of them are numerical invariants, but, while the TC only depends on the homotopy type, the GC is an invariant under…
We define a simpler notion of symmetric topological complexity more ad hoc to the motion planning problem which was the original motivation for the definition of topological complexity. This is a homotopy invariant that we call…