A New Approach to Order Polynomials of Labeled Posets and Their Generalizations

Authors John Shareshian, David Wright, Wenhua Zhao

Publication date 24 November 2003

Combinatorics of partially ordered sets (06A07) Algebraic aspects of posets (06A11) Bernoulli and Euler numbers and polynomials (11B68)

Abstract: In this paper, we first give formulas for the order polynomial

O m e g a (P w; t)

and the Eulerian polynomial

e (P w; l a m b d a)

of a finite labeled poset

(P, o m e g a)

using the adjacency matrix of what we call the

o m e g a

-graph of

(P, o m e g a)

. We then derive various recursion formulas for

O m e g a (P w; t)

and

e (P w; l a m b d a)

and discuss some applications of these formulas to Bernoulli numbers and Bernoulli polynomials. Finally, we give a recursive algorithm using a single linear operator on a vector space. This algorithm provides a uniform method to construct a family of new invariants for labeled posets

(P w)

, which includes the order polynomial

O m e g a (P w; t)

and the invariant

i l d e e (P w; l a m b d a) = f r a c e (P w; l a m b d a) (1 - l a m b d a)^{| P | + 1}

. The well-known quasi-symmetric function invariant of labeled posets and a further generalization of our construction are also discussed.

This page was built for publication: A New Approach to Order Polynomials of Labeled Posets and Their Generalizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6473385)