Related papers: A study of the Ganea conjecture for topological co…
We give bounds for the module sectional category of products of maps which generalise a theorem of Jessup for Lusternik-Schnirelmann category. We deduce also a proof of a Ganea type conjecture for topological complexity. This is a first…
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…
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…
The Weak Gravity Conjecture imposes stringent constraints on effective field theories to allow for an ultraviolet completion within quantum gravity. While substantial evidence supports the conjecture across broad classes of string…
For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…
In this paper, using Sullivan's approach to rational homotopy theory of simply-connected finite type CW complexes, we endow the $\mathbb{Q}$-vector space $\mathcal{E}xt_{C^{\ast}(X;\mathbb{Q})}(\mathbb{Q},C^{\ast}(X;\mathbb{Q}))$ with a…
In this paper we consider the classification of minimal cellular structures of spaces of topological complexity two under some hypotheses on there graded cohomological algebra. This continues the method used by M.Grant et al. in [1].
We present some results supporting the Iwase-Sakai conjecture about coincidence of the topological complexity $TC(X)$ and monoidal topological complexity $TC^M(X)$. Using these results we provide lower and upper bounds for the topological…
To clarify the method behind the paper "Ganea's conjecture on Lusternik-Schnirelman category" by the author, a generalisation of Berstein-Hilton Hopf invariants is defined as `higher Hopf invariants'. They detect the higher homotopy…
We introduce and study the proper topological complexity of a given configuration space, a version of the classical invariant for which we require that the algorithm controlling the motion is able to avoid any possible choice of ``unsafe''…
In math.GT/0106017 it was shown that thin position on Heegaard spines can be a useful tool for analyzing the topology of knots in 3-space. The proof there (specifically, of the Goda-Teragaito conjecture) requires masses of technical detail;…
We study the Weak Gravity Conjecture in the presence of scalar fields. The Weak Gravity Conjecture is a consistency condition for a theory of quantum gravity asserting that for a U(1) gauge field, there is a particle charged under this…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
We analyze infrared consistency conditions of 3D and 4D effective field theories with massive scalars or fermions charged under multiple $U(1)$ gauge fields. At low energies, one can integrate out the massive particles and thus obtain a…
We introduce a notion of discrete topological complexity in the setting of simplicial complexes, using only the combinatorial structure of the complex by means of the concept of contiguous simplicial maps. We study the links of this new…
In his 1979 paper Trotman proves, using the techniques of the Thom transversality theorem, that under some conditions on the dimensions of the manifolds under consideration, openness of the set of maps transverse to a stratification in the…
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…
We prove that the topological complexity of (a motion planning algorithm on) the complement of generic complex essential hyperplane arrangement of $n$ hyperplanes in an $r$-dimensional linear space is min$\{n+1,2r\}$.
We prove the Strengthened Hanna Neumann Conjecture, in its common graph theoretic formulation. Our original approach to this conjecture used cohomology of sheaves on graphs, although here we give a short combinatorial proof that we found in…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…