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

An identity of Chung, Graham and Knuth involving binomial coefficients and Eulerian numbers motivates our study of a class of polynomials that we call binomial-Eulerian polynomials. These polynomials share several properties with the Eulerian polynomials. For one thing, they are $h$-polynomials of simplicial polytopes, which gives a geometric interpretation of the fact that they are palindromic and unimodal. A formula of Foata and Sch\"utzenberger shows that the Eulerian poly...

A random graph order is a partial order achieved by independently sprinkling relations on a vertex set (each with probability $p$) and adding relations to satisfy the requirement of transitivity. A \textit{post} is an element in a partially ordered set which is related to every other element. Alon et al.\ \cite{Alon} proved a result for the average number of posts among the elements $\{1,2,...,n\}$ in a random graph order on $\mathbb{Z}$. We refine this result by providing an...

In the present article, we introduce a $(p,q)$-analogue of the poly-Euler polynomials and numbers by using the $(p,q)$-polylogarithm function. These new sequences are generalizations of the poly-Euler numbers and polynomials. We give several combinatorial identities and properties of these new polynomials. Moreover, we show some relations with the $(p,q)$-poly-Bernoulli polynomials and $(p,q)$-poly-Cauchy polynomials. The $(p,q)$-analogues generalize the well-known concept of...

Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This universal order is a distributive lattice. We investigate some other properties, namely the infinite distributivity, the computation of infinite suprema and infima, and the complexity of certain decision problems involving the homomorphism...

We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizing the marked chain polytopes and marked order polytopes by putting them as extremal cases in an Ehrhart equivalent family. Some combinatorial properties of these polytopes are studied. This work is motivated by the framework of PBW degenerations in representation theory of Lie algebras.

We prove certain identities involving Euler and Bernoulli polynomials that can be treated as recurrences. We use these and also other known identities to indicate connection of Euler and Bernoulli numbers with entries of inverses of certain lower triangular built of binomial coefficients. Another words we interpret Euler and Bernoulli numbers in terms of modified Pascal matrices.

Let $A$ be a commutative $k$-algebra over a field of $k$ and $\Xi$ a linear operator defined on $A$. We define a family of $A$-valued invariants $\Psi$ for finite rooted forests by a recurrent algorithm using the operator $\Xi$ and show that the invariant $\Psi$ distinguishes rooted forests if (and only if) it distinguishes rooted trees $T$, and if (and only if) it is {\it finer} than the quantity $\alpha (T)=|\text{Aut}(T)|$ of rooted trees $T$. We also consider the generati...

The main purpose of this paper is to introduce and investigate a class of $q$-Bernoulli, $q$-Euler and $q$-Genocchi polynomials. The $q$-analogues of well-known formulas are derived. The $q$-analogue of the Srivastava--Pint\'er addition theorem is obtained. Some new identities involving $q$-polynomials are proved.

In this paper we study finite Eulerian posets which are binomial, Sheffer or triangular. These important classes of posets are related to the theory of generating functions and to geometry. The results of this paper are organized as follows: We completely determine the structure of Eulerian binomial posets and, as a conclusion, we are able to classify factorial functions of Eulerian binomial posets; We give an almost complete classification of factorial functions of Euler...

In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study their number theoretic properties, asymptotic properties, and study their combinatorial properties using the notion of barred preferential arrangements. We also proposed a generalisation of the classical Euler polynomials and show how thes...