Related papers: Lower bounds for topological complexity
We prove that the geodesic complexity of a regular tetrahedron exceeds its topological complexity by 1 or 2. The proof involves a careful analysis of minimal geodesics on the tetrahedron.
We study a probabilistic variant of the r-th sequential parametrized topological complexity, which bounds this classical invariant from below and measures the difficulty in constructing permissive parametrized motion planning algorithms. On…
We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…
We provide lower bounds on the connectivity of the independence complexes of hypergraphs. Additionally, we compute the homotopy types of the independence complexes of $d$-uniform properly-connected triangulated hypergraphs.
Polynomial solving algorithms are essential to applied mathematics and the sciences. As such, reduction of their complexity has become an incredibly important field of topological research. We present a topological approach to constructing…
We give lower bounds for genera of components of fiber products of holomorphic maps between compact Riemann surfaces, extending results on genera of components of algebraic curves of the form $A(x)-B(y)=0,$ where $A$ and $B$ are rational…
We derive Moore-type upper bounds for regular simplicial complexes and present logarithmic lower bounds on their diameter based on minimum degree.
The notion of parametrized topological complexity, introduced by Cohen, Farber and Weinberger, is extended to fibrewise spaces which are not necessarily Hurewicz fibrations. After exploring some formal properties of this extension we also…
We point out a simple characterisation of topological amenability in terms of bounded cohomology, following Johnson's reformulation of amenability.
We initiate the study of higher dimensional topological finiteness properties of monoids. This is done by developing the theory of monoids acting on CW complexes. For this we establish the foundations of $M$-equivariant homotopy theory…
The polytopic definition introduced recently describing the topology of manifolds is used to formulate a generating function pertinent to its topological properties. In particular, a polynomial in terms of one variable and a tori underlying…
We determine topological complexity of a series of finite spaces which is weakly homotopy equivalent to a circle $S^1$, and give a finite space $X$ satisfying the inequality tc$(X) <$ cat$(X {\times} X)$. This answers two conjectures on…
One major open problem in network coding is to characterize the capacity region of a general multi-source multi-demand network. There are some existing computational tools for bounding the capacity of general networks, but their…
We introduce and study the sequential analogue of Grant's parametrized topological complexity of group epimorphisms, which generalizes the sequential topological complexity of groups. We derive bounds for sequential parametrized topological…
We introduce monoidal width as a measure of the difficulty of decomposing morphisms in monoidal categories. For graphs, we show that monoidal width and two variations capture existing notions, namely branch width, tree width and path width.…
We establish a relationship between the word complexity and the number of generalized diagonals for a polygonal billiard. We conclude that in the rational case the complexity function has cubic upper and lower bounds. In the tiling case the…
In this paper we shall investigate the concepts of cofiniteness of local cohomology modules and Abelian categories of cofinite modules over arbitrary Noetherian rings. Then we shall improve some of the results given in the literature.
The paper is devoted to an approach to the bounded cohomology theory based on the theories of simplicial sets and Postnikov systems. In particular, the main results of the bounded cohomology theory of topological spaces are extended to…
The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…
Restriction categories were established to handle maps that are partially defined with respect to composition. Tensor topology realises that monoidal categories have an intrinsic notion of space, and deals with objects and maps that are…