English
Related papers

Related papers: Lower bounds for topological complexity

200 papers

We define generalised higher Whitehead maps between polyhedral products. By investigating the interplay between the homotopy-theoretic properties of polyhedral products and the combinatorial properties of simplicial complexes, we describe…

Algebraic Topology · Mathematics 2026-03-04 Jelena Grbic , George Simmons , Matthew Staniforth

For an associative ring $R$, the projective level of a complex $F$ is the smallest number of mapping cones needed to build $F$ from projective $R$-modules. We establish lower bounds for the projective level of $F$ in terms of the vanishing…

Commutative Algebra · Mathematics 2017-10-05 Hannah Altmann , Eloísa Grifo , Jonathan Montaño , William Sanders , Thanh Vu

In this paper, we examine how topological complexity, simplicial complexity, discrete topological complexity, and combinatorial complexity compare when applied to models of $S^1$. We prove that the topological complexity of non-minimal…

Algebraic Topology · Mathematics 2018-12-20 Shelley Kandola

Digital topological methods are often used on computing the topological complexity of digital images. We give new results on the relation between reducibility and digital contractibility in order to determine the topological complexity of a…

General Topology · Mathematics 2022-10-05 Melih İs , İsmet Karaca

In this paper, we define and study an equivariant analogue of Cohen, Farber and Weinberger's parametrized topological complexity. We show that several results in the non-equivariant case can be extended to the equivariant case. For example,…

Algebraic Topology · Mathematics 2024-11-27 Navnath Daundkar

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

Combinatorics · Mathematics 2009-06-04 Michael Goff

In this paper we introduce the concepts of higher equivariant and invariant topological complexity; and study their properties. Then we compare them with equivariant LS-category. We give lower and upper bounds for these new invariants. We…

Algebraic Topology · Mathematics 2018-04-24 Marzieh Bayeh , Soumen Sarkar

The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X.…

Algebraic Topology · Mathematics 2007-07-07 Michael Farber , Mark Grant

This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…

Computational Complexity · Computer Science 2007-05-23 Joel Friedman

For some exact monoidal categories, we describe explicitly a connection between topological and algebraic definitions of the Lie bracket on the extension algebra of the unit object. The topological definition, due to Schwede and Hermann,…

Rings and Algebras · Mathematics 2025-01-03 Yury Volkov , Sarah Witherspoon

The homology groups of a manifold are important topological invariants that provide an algebraic summary of the manifold. These groups contain rich topological information, for instance, about the connected components, holes, tunnels and…

Machine Learning · Statistics 2013-07-30 Sivaraman Balakrishnan , Alessandro Rinaldo , Aarti Singh , Larry Wasserman

We provide a short introduction to the field of topological data analysis and discuss its possible relevance for the study of complex systems. Topological data analysis provides a set of tools to characterise the shape of data, in terms of…

Data Analysis, Statistics and Probability · Physics 2018-12-05 Vsevolod Salnikov , Daniele Cassese , Renaud Lambiotte

This work solves the problem of elaborating Ganea and Whitehead definitions for the tangential category of a foliated manifold. We develop these two notions in the category $\Tops$ of stratified spaces, that are topological spaces $X$…

Algebraic Topology · Mathematics 2025-03-11 Jean-Paul Doeraene , Enrique Macias-Virgós , Daniel Tanré

We present an algebraic framework for the computation of low-degree cohomology of a class of bigraded complexes which arise in Poisson geometry around (pre)symplectic leaves. We also show that this framework can be applied to the more…

Symplectic Geometry · Mathematics 2019-03-06 Andrés Pedroza , Eduardo Velasco-Barreras , Yury Vorobiev

We show that the parametrised topological complexity of Cohen, Farber and Weinberger gives an invariant of group epimorphisms. We extend various bounds for the topological complexity of groups to obtain bounds for the parametrised…

Algebraic Topology · Mathematics 2021-10-28 Mark Grant

We study Farber's topological complexity for monotone symplectic manifolds. More precisely, we estimate the topological complexity of 4-dimensional spherically monotone manifolds whose Kodaira dimension is not $-\infty$.

Algebraic Topology · Mathematics 2025-04-25 Ryuma Orita

A detailed comparison is made between the field-theoretic and geometric definitions of topological charge density on the lattice. Their renormalizations with respect to continuum are analysed. The definition of the topological…

High Energy Physics - Lattice · Physics 2008-11-26 B. Alles , M. D'Elia , A. Di Giacomo , R. Kirchner

We consider the maximal number of arbitrary points in a special fibre that can be simultaneously approached by points in one sequence of general fibres. Several results about this topological invariant and their applications describe the…

alg-geom · Mathematics 2008-02-03 Michal Kwiecinski , Piotr Tworzewski

We use ku-cohomology to determine lower bounds for the topological complexity of 2-torsion lens spaces. In the process, we give an almost-complete description of the tensor product of two copies of the ku-homology of infinite mod 2^e lens…

Algebraic Topology · Mathematics 2015-02-13 Donald M. Davis

We prove a complexity lower bound on deciding membership in a semialgebraic set for arithmetic networks in terms of the sum of Betti numbers with respect to "ordinary" (singular) homology. This result complements a similar lower bound by…

Computational Complexity · Computer Science 2016-07-14 Andrei Gabrielov , Nicolai Vorobjov