Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userNon-Eulerian Dehn-Sommerville relations
123
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The classical Dehn--Sommerville relations assert that the $h$-vector of an Eulerian simplicial complex is symmetric. We establish three generalizations of the Dehn--Sommerville relations: one for the $h$-vectors of pure simplicial complexes, another one for the flag $h$-vectors of balanced simplicial complexes and graded posets, and yet another one for the toric $h$-vectors of graded posets with restricted singularities. In all of these cases, we express any failure of symmetry in terms of errors coming from the links. For simplicial complexes, this further extends Klees semi-Eulerian relations.
rate research
Read More
In this paper, we characterize a duality relation between Eulerian recurrences and Eulerian recurrence systems, which generalizes and unifies Hermite-Biehler decompositions of several enumerative polynomials, including flag descent polynomials for hyperoctahedral group, flag ascent-plateau polynomials for Stirling permutations, up-down run polynomials for symmetric group and alternating run polynomials for hyperoctahedral group. As applications, we derive some properties of associated enumerative polynomials. In particular, we find that both the ascent-plateau polynomials and left ascent-plateau polynomials for Stirling permutations are alternatingly increasing, and so they are unimodal with modes in the middle.
Boolean, free and monotone cumulants as well as relations among them, have proven to be important in the study of non-commutative probability theory. Quite notably, Boolean cumulants were successfully used to study free infinite divisibility via the Boolean Bercovici--Pata bijection. On the other hand, in recent years the concept of infinitesimal non-commutative probability has been developed, together with the notion of infinitesimal cumulants which can be useful in the context of combinatorial questions. In this paper, we show that the known relations among free, Boolean and monotone cumulants still hold in the infinitesimal framework. Our approach is based on the use of Grassmann algebra. Formulas involving infinitesimal cumulants can be obtained by applying a formal derivation to known formulas. The relations between the various types of cumulants turn out to be captured via the shuffle algebra approach to moment-cumulant relations in non-commutative probability theory. In this formulation, (free, Boolean and monotone) cumulants are represented as elements of the Lie algebra of infinitesimal characters over a particular combinatorial Hopf algebra. The latter consists of the graded connected double tensor algebra defined over a non-commutative probability space and is neither commutative nor cocommutative. In this note it is shown how the shuffle algebra approach naturally extends to the notion of infinitesimal non-commutative probability space. The basic step consists in replacing the base field as target space of linear Hopf algebra maps by the Grassmann algebra over the base field. We also consider the infinitesimal analog of the Boolean Bercovici--Pata map.
A formula of Stembridge states that the permutation peak polynomials and descent polynomials are connected via a quadratique transformation. The aim of this paper is to establish the cycle analogue of Stembridges formula by using cycle peaks and excedances of permutations. We prove a series of new general formulae expressing polynomials counting permutations by various excedance statistics in terms of refined Eulerian polynomials. Our formulae are comparable with Zhuangs generalizations [Adv. in Appl. Math. 90 (2017) 86-144] using descent statistics of permutations. Our methods include permutation enumeration techniques involving variations of classical bijections from permutations to Laguerre histories, explicit continued fraction expansions of combinatorial generating functions in Shin and Zeng [European J. Combin. 33 (2012), no. 2, 111--127] and cycle version of modified Foata-Strehl action. We also prove similar formulae for restricted permutations such as derangements and permutations avoiding certain patterns. Moreover, we provide new combinatorial interpretations for the $gamma$-coefficients of the inversion polynomials restricted on $321$-avoiding permutations.
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
A ballot permutation is a permutation {pi} such that in any prefix of {pi} the descent number is not more than the ascent number. In this article, we obtained a formula in close form for the multivariate generating function of {A(n,d,j)}, which denote the number of permutations of length n with d descents and j as the first letter. Besides, by a series of calculations with generatingfunctionology, we confirm a recent conjecture of Wang and Zhang for ballot permutations.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
