An algebra over the operad of posets and structural binomial identities

TL;DR

This paper explores the algebraic structure of order series of posets, connecting them to operads, Ehrhart theory, and binomial identities, providing new proofs and computational tools for poset invariants.

Contribution

It introduces an operad-based algebraic framework for order series of posets, enabling efficient identification of posets from generating functions and deriving new combinatorial identities.

Findings

Order series form a basis in the space of all order series.

A new proof of Stanley's reciprocity theorem is provided.

New identities for binomial coefficients and finite partitions are discovered.

Abstract

We study generating functions of strict and non-strict order polynomials of series-parallel posets, called order series. These order series are closely related to Ehrhart series and h*-polynomials of the associated order polytopes. We explain how they can be understood as algebras over a certain operad of posets. Our main results are based on the fact that the order series of chains form a basis in the space of order series. This allows to reduce the search space of an algorithm that finds for a given power series f, if possible, a poset P such that f is the generating function of the order polynomial of P. In terms of Ehrhart theory of order polytopes, the coordinates with respect to this basis describe the number of (internal) simplices in the canonical triangulation of the order polytope of P. Furthermore, we derive a new proof of the reciprocity theorem of Stanley. As an application, we find new identities for binomial coefficients and for finite partitions that allow for empty sets, and we describe properties of the negative hypergeometric distribution.