Rational topological complexity

Jessup, Barry; Murillo, Aniceto; Parent, Paul-Eugène

doi:10.2140/agt.2012.12.1793

Algebr. Geom. Topol.

2012

DOI: 10.2140/agt.2012.12.1793

|View full text |Cite

Rational topological complexity

Barry Jessup¹,

Aniceto Murillo²,

Paul-Eugène Parent³

Abstract: We give a new upper bound for Farber's topological complexity for rational spaces in terms of Sullivan models. We use it to determine the topological complexity in some new cases, and to prove a Ganea-type formula in these and other cases. 55M30, 55P62

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2019

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Topological complexity of the work map

Murillo

2019

J. Topol. Anal.

Self Cite

View full text Add to dashboard Cite

We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the task for which the system has been designed. From a purely topological point of view, this is a homotopy invariant of a map which generalizes the classical topological complexity of a space.

show abstract

Topological complexity of the work map

Murillo

2019

J. Topol. Anal.

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Rational topological complexity

Abstract: We give a new upper bound for Farber's topological complexity for rational spaces in terms of Sullivan models. We use it to determine the topological complexity in some new cases, and to prove a Ganea-type formula in these and other cases. 55M30, 55P62

Cited by 1 publication

References 18 publications

Topological complexity of the work map

Topological complexity of the work map

Contact Info

Product

Resources

About