اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFlag Descents and Eulerian Polynomials for Wreath Product Quotients
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the $alpha$-colored Eulerian polynomials and a notion of descents introduced in a recent paper of Hedmark and show that such polynomials can be computed as a polynomial encoding descents computed over a quotient of the wreath product $mathbb{Z}_alphawrmathfrak{S}_n$. Moreover, we consider the flag descent statistic computed over this same quotient and find that the flag Eulerian polynomial remains palindromic. We prove that the flag descent polynomial is palindromic over this same quotient by giving a combinatorial proof that the flag descent statistic is symmetrically distributed over the collection of colored permutations with fixed last color by way of a new combinatorial tool, the colored winding number of a colored permutation. We conclude with some conjectures, observations, and open questions.
قيم البحث
اقرأ أيضاً
In this paper we present grammatical interpretations of the alternating Eulerian polynomials of types A and B. As applications, we derive several properties of the type B alternating Eulerian polynomials, including combinatorial expansions, recurrenc
e relations and generating functions. We establish an interesting connection between alternating Eulerian polynomials of type B and left peak polynomials of permutations in the symmetric group, which implies that the type B alternating Eulerian polynomials have gamma-vectors alternate in sign.
In this paper, we study Eulerian polynomials for permutations and signed permutations of the multiset ${1,1,2,2,ldots,n,n}$. Properties of these polynomials, including recurrence relations and unimodality are discussed. In particular, we give a unifi
ed proof of the fact that these polynomials are unimodal with modes in the middle.
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 exce
dances 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.
The closed cone of flag vectors of Eulerian partially ordered sets is studied. It is completely determined up through rank seven. Half-Eulerian posets are defined. Certain limit posets of Billera and Hetyei are half-Eulerian; they give rise to extrem
e rays of the cone for Eulerian posets. A new family of linear inequalities valid for flag vectors of Eulerian posets is given.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
