Enumerative combinatorics
Upper binomial posets and signed permutation statistics
European Journal of Combinatorics
Tchebyshev triangulations of stable simplicial complexes
Journal of Combinatorial Theory Series A
Finite Eulerian posets which are binomial, Sheffer or triangular
Journal of Combinatorial Theory Series A
| Hi-index | 0.00 |
We introduce an operation that assigns to each binomial poset a partially ordered set for which the number of saturated chains in any interval is a function of two parameters. We develop a corresponding theory of generating functions involving noncommutative formal power series modulo the closure of a principal ideal, which may be faithfully represented by the limit of an infinite sequence of lower triangular matrix representations. The framework allows us to construct matrices of formal power series whose inverse may be easily calculated using the relation between the Möbius and zeta functions, and to find a unified model for the Tchebyshev polynomials of the first kind and for the derivative polynomials used to express the derivatives of the secant function as a polynomial of the tangent function.