English

Term rewriting on nestohedra

Category Theory 2025-01-22 v2 Logic in Computer Science Algebraic Topology Combinatorics

Abstract

We define term rewriting systems on the vertices and faces of nestohedra, and show that the former are confluent and terminating. While the associated posets on vertices generalize Barnard--McConville's flip order for graph-associahedra, the preorders on faces generalize the facial weak order for permutahedra and the generalized Tamari order for associahedra. Moreover, we define and study contextual families of nestohedra, whose local confluence diagrams satisfy a certain uniformity condition. Among them are associahedra and operahedra, whose associated proofs of confluence for their rewriting systems reproduce proofs of categorical coherence theorems for monoidal categories and categorified operads.

Keywords

Cite

@article{arxiv.2403.15987,
  title  = {Term rewriting on nestohedra},
  author = {Pierre-Louis Curien and Guillaume Laplante-Anfossi},
  journal= {arXiv preprint arXiv:2403.15987},
  year   = {2025}
}

Comments

28 pages, 2 figures, 1 table. New order on vertices of nestohedra which recovers the facial weak order and generalized Tamari order as special cases. Minor corrections and improved exposition, to appear in Proceedings of the CATMI 2023 conference

R2 v1 2026-06-28T15:31:20.869Z