vix.ing · top · new · best · stats · spec

Term rewriting on nestohedra

2024/03/24 by Curien, Pierre-Louis, Laplante-Anfossi, Guillaume
#52B11 (Secondary) #68Q42 (Primary) 18N20 #Algebraic Topology (math.AT) #Category Theory (math.CT) #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Logic in Computer Science (cs.LO)

paper · doi:10.48550/arxiv.2403.15987

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.

Related