An interlacing pattern between the types Cn and Dn coordinator polynomials
Jun-Ying Liu, Shi-Mei Ma
Abstract
The study of coordinator polynomials of Weyl group lattices was initiated by Conway and Sloane. In 2013, by using a trigonometric substitution approach, Wang and Zhao proved the real-rootedness of the type D coordinator polynomials. Subsequently, Xie and Zhang proved the compatibility between the types Cn and Dn coordinator polynomials. In this paper, we discover the interlacing pattern between the types Cn and Dn coordinator polynomials, which may be named as the second pattern of interlacing zeros.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato