اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the real-rootedness of the local $h$-polynomials of edgewise subdivisions
96
0
0.0
(
0
)
تأليف
Philip B. Zhang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 polynomials related to the desired local $h$-polynomial is interlacing and hence confirm Athanasiadis conjecture.
قيم البحث
اقرأ أيضاً
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}.
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 polynom
ials 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.
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.
We describe various aspects of the Al-Salam-Chihara $q$-Laguerre polynomials. These include combinatorial descriptions of the polynomials, the moments, the orthogonality relation and a combinatorial interpretation of the linearization coefficients. I
t is remarkable that the corresponding moment sequence appears also in the recent work of Postnikov and Williams on enumeration of totally positive Grassmann cells.
In recent joint work (2021), we introduced a novel multivariate polynomial attached to every metric space - in particular, to every finite simple connected graph $G$ - and showed it has several attractive properties. First, it is multi-affine and rea
l-stable (leading to a hitherto unstudied delta-matroid for each graph $G$). Second, the polynomial specializes to (a transform of) the characteristic polynomial $chi_{D_G}$ of the distance matrix $D_G$; as well as recovers the entire graph, where $chi_{D_G}$ cannot do so. Third, the polynomial encodes the determinants of a family of graphs formed from $G$, called the blowups of $G$. In this short note, we exhibit the applicability of these tools and techniques to other graph-matrices and their characteristic polynomials. As a particular case, we will see that the adjacency characteristic polynomial $chi_{A_G}$ is in fact the shadow of a richer multivariate blowup-polynomial, which is similarly multi-affine and real-stable. Moreover, this polynomial encodes not only the aforementioned three properties, but also yields additional information for specific families of graphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
