Topological complexity of graphic arrangements

DOI10.1090/CONM/702/14113MaRDI QIDQ4608466zbMATH OpenOpenAlexFDO

Authors 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

graphic arrangementsmotion planningtopological complexity

Mathematics Subject Classification ID

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

Recommendations

• The higher topological complexity of complement of fiber type arrangement
• Topological complexity of configuration spaces of fully articulated graphs and banana graphs
• Higher Topological Complexity of Artin Type Groups
• Topological complexity of unordered configuration spaces of certain graphs
• Topological criteria for \(\mathbf k\)-formal arrangements

Cites work

• Combinatorics and topology of complements of hyperplanes
• Decomposition of Finite Graphs Into Forests
• Edge-Disjoint Spanning Trees of Finite Graphs
• Higher Topological Complexity of Artin Type Groups
• Higher topological complexity of subcomplexes of products of spheres and related polyhedral product spaces
• scientific article; zbMATH DE number 3140164 (Why is no real title available?)
• scientific article; zbMATH DE number 52944 (Why is no real title available?)
• scientific article; zbMATH DE number 2145101 (Why is no real title available?)
• scientific article; zbMATH DE number 5250985 (Why is no real title available?)
• Motion planning in tori
• On higher analogs of topological complexity
• Pairwise disjoint maximal cliques in random graphs and sequential motion planning on random right angled Artin groups
• Topological complexity of collision-free multi-tasking motion planning on orientable surfaces
• Topological complexity of motion planning

Cited in

(8)

• The higher topological complexity of complement of fiber type arrangement
• Topological complexity of configuration spaces of fully articulated graphs and banana graphs
• Topological properties of graphical arrangements
• Topological complexity of classical configuration spaces and related objects
• The topological complexity of pure graph braid groups is stably maximal
• Graphical arrangements of compressed graphs
• scientific article; zbMATH DE number 5208754 (Why is no real title available?)
• Topological criteria for \(\mathbf k\)-formal arrangements

This page was built for publication: Topological complexity of graphic arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608466)