Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userThe Real-Rootedness and Log-concavities of Coordinator Polynomials of Weyl Group Lattices
244
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
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 log-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 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.
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.
Recently, Choi and Park introduced an invariant of a finite simple graph, called signed a-number, arising from computing certain topological invariants of some specific kinds of real toric manifolds. They also found the signed a-numbers of path graphs, cycle graphs, complete graphs, and star graphs. We introduce a signed a-polynomial which is a generalization of the signed a-number and gives a-, b-, and c-numbers. The signed a-polynomial of a graph $G$ is related to the Poincare polynomial $P_{M(G)}(z)$, which is the generating function for the Betti numbers of the real toric manifold $M(G)$. We give the generating functions for the signed a-polynomials of not only path graphs, cycle graphs, complete graphs, and star graphs, but also complete bipartite graphs and complete multipartite graphs. As a consequence, we find the Euler characteristic number and the Betti numbers of the real toric manifold $M(G)$ for complete multipartite graphs $G$.
Zeta functions of periodic cubical lattices are explicitly derived by computing all the eigenvalues of the adjacency operators and their characteristic polynomials. We introduce cyclotomic-like polynomials to give factorization of the zeta function in terms of them and count the number of orbits of the Galois action associated with each cyclotomic-like polynomial to obtain its further factorization. We also give a necessary and sufficient condition for such a polynomial to be irreducible and discuss its irreducibility from this point of view.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
