핵심 개념
Term rewriting systems on nestohedra provide insights into coherence theorems for various mathematical structures.
초록
The content discusses term rewriting systems on nestohedra, their confluence, and termination properties. It explores their applications in coherence theorems for monoidal categories and categorified operads. The article also delves into hypergraph polytopes, associating them with constructs and constructions to analyze their properties.
Introduction:
- Term rewriting systems on nestohedra explored.
- Applications in coherence theorems discussed.
Coherence and Polytopes:
- Topological proofs of coherence theorems highlighted.
- Mac Lane's coherence theorem explained using polytopal realizations.
Rewriting on Nestohedra:
- Positive answer to extending Huet's correspondence.
- Confluent and terminating term rewriting systems defined.
Hypergraph Polytopes:
- Definition of hypergraph polytopes outlined.
- Various families like simplices, cubes, associahedra, permutahedra, and operahedra discussed.
Anatomy of the 2-skeleton:
- Description of all possible 2-faces of a hypergraph polytope provided.
- Shapes of 2-faces detailed based on construct dimensions.
Data Extraction:
- "We define term rewriting systems on the vertices and faces of nestohedra" - Key metric supporting system definition.
통계
"We define term rewriting systems on the vertices and faces of nestohedra"