Antipode formulas for pattern Hopf algebras

TL;DR

This paper derives a cancellation-free antipode formula for the permutation pattern Hopf algebra, enabling new insights into polynomial invariants and reciprocity theorems, and introduces related pattern Hopf algebras.

Contribution

It provides the first explicit, cancellation-free antipode formula for the permutation pattern Hopf algebra and extends the framework to new pattern Hopf algebras.

Findings

Derived a cancellation-free antipode formula using sign-reversing involution.

Applied the formula to polynomial invariants and reciprocity theorems.

Introduced the packed word patterns Hopf algebra and discussed other pattern algebras.

Abstract

The permutation pattern Hopf algebra is a commutative filtered and connected Hopf algebra. Its product structure stems from counting patterns of a permutation, interpreting the coefficients as permutation quasi-shuffles. The Hopf algebra was shown to be a free commutative algebra and to fit into a general framework of pattern Hopf algebras, via species with restrictions. In this paper we introduce the cancellation-free and grouping-free formula for the antipode of the permutation pattern Hopf algebra. To obtain this formula, we use the popular sign-reversing involution method, by Benedetti and Sagan. This formula has applications on polynomial invariants on permutations, in particular for obtaining reciprocity theorems. On our way, we also introduce the packed word patterns Hopf algebra and present a formula for its antipode. Other pattern algebras are discussed here, notably on parking functions, which recovers notions recently studied by Adeniran and Pudwell, and by Qiu and Remmel.