Related papers: Lower bounds for topological complexity
In this note I use cup-products and higher Massey products to find topological lower bounds on the number of geometrically distinct critical points of any closed 1-form in a given cohomology class.
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
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 compute the topological complexity of Eilenberg-Mac Lane spaces associated to the group of automorphisms of a finitely generated free group which act by conjugation on a given basis, and to certain subgroups.
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…
A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…
We present two models for the space of knots which have endpoints at fixed boundary points in a manifold with boundary, one model defined as an inverse limit of spaces of maps between configuration spaces and another which is cosimplicial.…
Bialgebroids, separable bialgebroids, and weak Hopf algebras are compared from a categorical point of view. Then properties of weak Hopf algebras and their applications to finite index and finite depth inclusions of von Neumann algebras are…
We introduce the notion of topological entropy of a formal languages as the topological entropy of the minimal topological automaton accepting it. Using a characterization of this notion in terms of approximations of the Myhill-Nerode…
In this paper, we define homeology group, reduced homeology group, cohomeology group and reduced cohomeology group on finite simpicial complexes and prove that these groups are homeomorphism invariants of polyhedra. We also define homeotopy…
Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…
We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…
In this paper, we obtain an upper bound on the higher topological complexity of the total spaces of fibrations. As an application, we improve the usual dimensional upper bound on higher topological complexity of total spaces of some sphere…
This paper lays the foundations of an approach to applying Gromov's ideas on quantitative topology to topological data analysis. We introduce the "contiguity complex", a simplicial complex of maps between simplicial complexes defined in…
We introduce the notion of symplectic microfolds and symplectic micromorphisms between them. They form a monoidal category, which is a version of the "category" of symplectic manifolds and canonical relations obtained by localizing them…
We construct an explicit semifree model for the fiber join of two fibrations p: E --> B and p': E' --> B from semifree models of p and p'. Using this model, we introduce a lower bound of the sectional category of a fibration p which can be…
We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these…
We prove lower bounds on the density of regular minimal cones of dimension less than seven provided the complements of the cones are topologically nontrivial.
We construct some new cohomology theories for topological groups and Lie groups and study some of its basic properties. For example, we introduce a cohomology theory based on measurable cochains which are continuous in a neighbourhood of…