Higher analogs of simplicial and combinatorial complexity
From MaRDI portal
Publication:2329338
Abstract: We introduce higher simplicial complexity of a simplicial complex and higher combinatorial complexity of a finite space (i.e. is a finite poset). We relate higher simplicial complexity with higher topological complexity of and higher combinatorial complexity with higher simplicial complexity of the order complex of .
Recommendations
- Higher dimensional simplicial complexity
- Simplicial approximation and refinement of monoidal topological complexity
- Higher Topological Complexity of Artin Type Groups
- Motion planning in connected sums of real projective spaces
- An upper bound for higher topological complexity and higher strongly equivariant complexity
- Discrete topological complexity
- Topological complexity of \(H\)-spaces
- A combinatorial description of topological complexity for finite spaces
- Motion planning algorithms for configuration spaces in the higher dimensional case
- Simplicial complexity: piecewise linear motion planning in robotics
Cites work
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- A combinatorial description of topological complexity for finite spaces
- Finite Topological Spaces
- Homotopy theory of finite and locally finite \(T_ 0\) spaces
- Invitation to topological robotics
- On higher analogs of topological complexity
- Simplicial complexity: piecewise linear motion planning in robotics
- Singular homology groups and homotopy groups of finite topological spaces
- Strong homotopy types, nerves and collapses
- Topological complexity of motion planning
Cited in
(15)- Topological representations of simplicial complexes and their applications
- On higher analogs of topological complexity
- Higher dimensional simplicial complexity
- Estimating the higher symmetric topological complexity of spheres
- Higher Topological Complexity of Artin Type Groups
- Higher topological complexity of a map
- ON SPACES OF TOPOLOGICAL COMPLEXITY TWO
- Combinatorics of past-similarity in higher dimensional transition systems
- Higher homotopic distance
- Higher analogues of discrete topological complexity
- Two robots moving geodesically on a tree
- Different types of topological complexity based on higher homotopic distance
- Simplicial and combinatorial versions of higher symmetric topological complexity
- A combinatorial description of topological complexity for finite spaces
- The higher topological complexity in digital images
This page was built for publication: Higher analogs of simplicial and combinatorial complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329338)