اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReal-rootedness of variations of Eulerian polynomials
92
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The binomial Eulerian polynomials, introduced by Postnikov, Reiner, and Williams, are $gamma$-positive polynomials and can be interpreted as $h$-polynomials of certain flag simplicial polytopes. Recently, Athanasiadis studied analogs of these polynomials for colored permutations. In this paper, we generalize them to $mathbf{s}$-inversion sequences and prove that these new polynomials have only real roots by the method of interlacing polynomials. Three applications of this result are presented. The first one is to prove the real-rootedness of binomial Eulerian polynomials, which confirms a conjecture of Ma, Ma, and Yeh. The second one is to prove that the symmetric decomposition of binomial Eulerian polynomials for colored permutations is real-rooted. Thirdly, our polynomials for certain $mathbf{s}$-inversion sequences are shown to admit a similar geometric interpretation related to edgewise subdivisions of simplexes.
قيم البحث
اقرأ أيضاً
In this paper, we prove the real-rootedness of two classes of generalized Narayana polynomials: one arising as the $h$-polynomials of the generalized associahedron associated to the finite Weyl groups, the other arising in the study of the infinite l
og-concavity of the Boros-Moll polynomials. For the former, Br{a}nd{e}n has already proved that these $h$-polynomials have only real zeros. We establish certain recurrence relations for the two classes of Narayana polynomials, from which we derive the real-rootedness. To prove the real-rootedness, we use a sufficient condition, due to Liu and Wang, to determine whether two polynomials have interlaced zeros. The recurrence relations are verified with the help of the Mathematica package textit{HolonomicFunctions}.
Athanasiadis conjectured that, for every positive integer $r$, the local $h$-polynomial of the $r$th edgewise subdivision of any simplex has only real zeros. In this paper, based on the theory of interlacing polynomials, we prove that a family of pol
ynomials related to the desired local $h$-polynomial is interlacing and hence confirm Athanasiadis conjecture.
It is well-known that the coordinator polynomials of the classical root lattice of type $A_n$ and those of type $C_n$ are real-rooted. They can be obtained, either by the Aissen-Schoenberg-Whitney theorem, or from their recurrence relations. In this
paper, we develop a trigonometric substitution approach which can be used to establish the real-rootedness of coordinator polynomials of type $D_n$. We also find the coordinator polynomials of type $B_n$ are not real-rooted in general. As a conclusion, we obtain that all coordinator polynomials of Weyl group lattices are log-concave.
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.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
