November 24, 2003
In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P, \omega)$. We then derive various recursion formulas for $\Omega (\Pw; t)$ and $e(\Pw; \lambda)$ 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 $(\Pw)$, which includes the order polynomial $\Omega (\Pw; t)$ and the invariant $\tilde e(\Pw; \lambda) =\frac {e(\Pw; \lambda)}{(1-\lambda)^{|P|+1}}$. The well-known quasi-symmetric function invariant of labeled posets and a further generalization of our construction are also discussed.
Similar papers 1
June 10, 2021
In this article, we introduce combinatorial models for poly-Bernoulli polynomials and poly-Euler numbers of both kinds. As their applications, we provide combinatorial proofs of some identities involving poly-Bernoulli polynomials.
May 11, 2022
We explore the operad of finite posets and its algebras. We use order polytopes to investigate the combinatorial properties of zeta values. By generalizing a family of zeta value identities, we demonstrate the applicability of this approach. In addition, we offer new proofs of some of Ramanujan's results on the properties of Eulerian numbers, interpreting his work as dealing with series inheriting the algebraic structure of disjoint unions of points. Finally, we establish a c...
March 11, 2024
For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of $P$-partitions. Here we study the $P$-Eulerian polynomial where $P$ is a naturally labeled zig-zag poset; we call these zig-zag Eulerian polynomials. A result of Br\"and\'en implies that these polynomials are gamma-nonnegative, and hence t...
September 22, 2019
In this paper we present several natural $q$-analogues of the poly-Bernoulli numbers arising in combinatorial contexts. We also recall some relating analytical results and ask for combinatorial interpretations.
February 28, 2016
In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show connections between the different areas where poly-Bernoulli numbers and their relatives appear and give examples how the combinatorial methods can be used for deriving formulas between integer arrays.
July 27, 2020
In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of further studies.
January 20, 2019
Motivated by Dohmen-P\"onitz-Tittmann's bivariate chromatic polynomial $\chi_G(x,y)$, which counts all $x$-colorings of a graph $G$ such that adjacent vertices get different colors if they are $\le y$, we introduce a bivarate version of Stanley's order polynomial, which counts order preserving maps from a given poset to a chain. Our results include decomposition formulas in terms of linear extensions, a combinatorial reciprocity theorem, and connections to bivariate chromatic...
October 4, 2023
The main object of this paper is to investigate a new class of the generalized Hurwitz type poly-Bernoulli numbers and polynomials from which we derive some algorithms for evaluating the Hurwitz type poly-Bernoulli numbers and polynomials. By introducing a new generalization of the Stirling numbers of the second kind, we succeed to establish some combinatorial formulas for the generalized Hurwitz type poly-Bernoulli numbers and polynomials with negative upper indices. Moreove...
July 14, 2012
A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection preserves not only the number of elements, but also much additional structure. Based on this correspondence, we calculate the generating functions and explicit formulas for the numbers of labeled and unlabeled $n$-element semiorders of length $H$. ...
August 13, 2019
We study the symmetric function and polynomial combinatorial invariants of Hopf algebras of permutations, posets and graphs. We investigate their properties and the relations among them. In particular, we show that the chromatic symmetric function and many other invariants have a property we call positively $h$-alternating. This property of positively $h$-alternating leads to Schur positivity and $e$-positivity when applying the operator $\nabla$ at $q=1$. We conclude by show...