Related papers: Sequential parametrized topological complexity of …

Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…

In this article, we investigate the higher topological complexity of oriented Seifert fibered manifolds that are Eilenberg--MacLane spaces $K(G,1)$ with infinite fundamental group $G$. We first refine the cohomological lower bounds for…

The Lusternik-Schnirelmann category of a space was introduced to obtain a lower bound on the number of critical points of a $C^1$-function on a given manifold. Related to Lusternik-Schnirelmann category and motivated by topological…

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

We prove Farber's conjecture on the stable topological complexity of configuration spaces of graphs. The conjecture follows from a general lower bound derived from recent insights into the topological complexity of aspherical spaces. Our…

We give simple upper bounds for rational sectional category and use them to compute invariants of the type of Farber's topological complexity of rational spaces. In particular we show that the sectional category of formal morphisms reaches…

We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…

We introduce a generalization of sequential compactness using barriers on $\omega$ extending naturally the notion introduced in [W. Kubi\'{s} and P. Szeptycki, On a topological Ramsey theorem, \emph{Canad. Math. Bull.}, 66 (2023),…

We survey two decades of work on the (sequential) topological complexity of configuration spaces of graphs (ordered and unordered), aiming to give an account that is unifying, elementary, and self-contained. We discuss the traditional…

We introduce fibrewise Whitehead- and fibrewise Ganea definitions of monoidal topological complexity. We then define several lower bounds for the topological complexity, which improve on the standard lower bound in terms of nilpotency of…

We present upper and lower bounds for symmetrized topological complexity $TC^\Sigma(X)$ in the sense of Basabe-Gonz\'alez-Rudyak-Tamaki. The upper bound comes from equivariant obstruction theory, and the lower bounds from the cohomology of…

In order to make the fundamental group, one of the most well known invariants in algebraic topology, more useful and powerful some researchers have introduced and studied various topologies on the fundamental group from the beginning of the…

Topological features based on persistent homology capture high-order structural information so as to augment graph neural network methods. However, computing extended persistent homology summaries remains slow for large and dense graphs and…

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some…

The mapping class group of a closed surface of genus $g$ is an extension of the Torelli group by the symplectic group. This leads to two natural problems: (a) compute (stably) the symplectic decomposition of the lower central series of the…

We prove that the complex surfaces parametrizing cuboids and face cuboids, as well as their minimal resolution of singularities, have trivial fundamental group. We then compute the fundamental group of certain open smooth subvarieties of…

In this article, we study the parameterized complexity of the Set Cover problem restricted to semi-ladder-free hypergraphs, a class defined by Fabianski et al. [Proceedings of STACS 2019]. We observe that two algorithms introduced by…

In this paper, we introduce a symmetric continuous cohomology of topological groups. This is obtained by topologizing a recent construction due to Staic (J. Algebra 322 (2009), 1360-1378), where a symmetric cohomology of abstract groups is…

It is important to classify covering subgroups of the fundamental group of a topological space using their topological properties in the topologized fundamental group. In this paper, we introduce and study some topologies on the fundamental…