Topological complexity of graphic arrangements

DOI10.1090/conm/702/14113zbMath1385.52018OpenAlexW2791165195MaRDI QIDQ4608466

Nathan Fieldsteel

Publication date: 16 March 2018

Published in: Topological Complexity and Related Topics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0ba447b3b6498356077a23fd04608981f3989374

zbMATH Keywords

motion planningtopological complexitygraphic arrangements

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Relations of low-dimensional topology with graph theory (57M15) Artificial intelligence for robotics (68T40) Classical topics in algebraic topology (55M99)

Related Items

Topological complexity of classical configuration spaces and related objects

Cites Work

• Higher topological complexity of subcomplexes of products of spheres and related polyhedral product spaces
• Combinatorics and topology of complements of hyperplanes
• Topological complexity of motion planning
• On higher analogs of topological complexity
• Edge-Disjoint Spanning Trees of Finite Graphs
• Motion planning in tori
• Topological complexity of collision-free multi-tasking motion planning on orientable surfaces
• Higher Topological Complexity of Artin Type Groups
• Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
• Decomposition of Finite Graphs Into Forests
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item