Related papers: Lower bounds for topological complexity

Using known results about their integral cohomology ring, we prove that the topological complexity of the space of n-gons in R^3 with prescribed side lengths equals 2n-5, assuming that the space is nonempty and does not contain any…

This paper investigates the extension complexity of polytopes by exploiting the correspondence between non-negative factorizations of slack matrices and randomized communication protocols. We introduce a geometric characterization of…

One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…

We consider aspects of the geometry and topology of nilpotent orbits in finite-dimensional complex simple Lie algebras. In particular, we give the equivariant cohomologies of the regular and minimal nilpotent orbits with respect to the…

For a smooth, closed $n$-manifold $M$, we define an upper semi-continuous integer-valued complexity function on $H^1(M;{\mathbb R})$ using Morse theory. This measures how far an integral class is from being a fiber of a fibration. The fact…

The topological (resp. geodesic) complexity of a topological (resp. metric) space is roughly the smallest number of continuous rules required to choose paths (resp. shortest paths) between any points of the space. We prove that the geodesic…

For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We…

Monoidal width was recently introduced by the authors as a measure of the complexity of decomposing morphisms in monoidal categories. We have shown that in a monoidal category of cospans of graphs, monoidal width and its variants can be…

Using each node's degree as a proxy for its importance, the topological hierarchy of a complex network is introduced and quantified. We propose a simple dynamical process used to construct networks which are either maximally or minimally…

Let (P1) be certain elliptic free-boundary problem on a Riemannian manifold (M,g). In this paper we study the restrictions on the topology and geometry of the fibres (the level sets) of the solutions f to (P1). We give a technique based on…

In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of a closed 3--manifold, as well as a characterisation of manifolds realising our complexity bounds. As an application, we obtain the first…

The notions Golodness and tightness for simplicial complexes come from algebra and geometry, respectively. We prove these two notions are equivalent for 3-manifold triangulations, through a topological characterization of a polyhedral…

For a closed orientable connected 3-manifold $M$, its complexity $\boldsymbol{T}(M)$ is defined to be the minimal number of tetrahedra in its triangulations. Under the assumption that $M$ is prime (but not necessarily atoroidal), we…

Parametrized motion planning algorithms have high degree of flexibility and universality, they can work under a variety of external conditions, which are viewed as parameters and form part of the input of the algorithm. In this paper we…

We compute the cohomology of the right generalised projective Stiefel manifolds and use it to find bounds on the rank of the complementary bundle for certain vector bundles. Further the cohomology computations are also used to find bounds…

We define the notion of near geodesic between points of a metric space when no geodesic exists, and use this to extend Recio-Mitter's notion of geodesic complexity to non-geodesic spaces. This has potential application to topological…

Let $G$ be a simply connected solvable Lie group with a lattice $\Gamma$ and $N$ the nilradical of $G$. For a complex valued representation $\rho: G\to GL(V_{\rho})$ such that the restriction $\rho_{|_{N}}$ is unipotent, as an advanced…

We introduce a new simplicial nerve of higher dimensional automata whose homology groups yield a new definition of the globular homology. With this new definition, the drawbacks noticed with the construction of math.CT/9902151 disappear.…

We give a topological bound on the number of minimal models of a class of three dimensional log smooth pairs of general type.

In a previous paper we have suggested a number of ideas to attack circuit size complexity with cohomology. As a simple example, we take circuits that can only compute the AND of two inputs, which essentially reduces to SET COVER. We show a…