2000 character limit reached
Jacobi identity in polyhedral products
Published 23 Nov 2021 in math.AT and math.CO | (2111.12199v1)
Abstract: We show that a relation among minimal non-faces of a fillable complex $K$ yields an identity of iterated (higher) Whitehead products in a polyhedral product over $K$. In particular, for the $(n-1)$-skeleton of a simplicial $n$-sphere, we always have such an identity, and for the $(n-1)$-skeleton of a $(n+1)$-simplex, the identity is the Jacobi identity of Whitehead products ($n=1$) and Hardie's identity of higher Whitehead products ($n\ge 2$).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.