Real-rootedness of reduced multiset Schett polynomials

Prove that every nonzero reduced multiset Schett polynomial \(\widehat S_{M,i}(t)=\sum_{T\in\mathcal{T}_M,\,\lfloor\mathsf{ee}(T)/2\rfloor=i} t^{\lfloor\mathsf{oe}(T)/2\rfloor}\), where \(\mathsf{ee}(T)\) and \(\mathsf{oe}(T)\) count nodes of even outdegree at even and odd levels, respectively, has only real zeros, and develop a tractable insertion operator for these statistics.

Background

The paper identifies a related conjecture concerning reduced multiset Schett polynomials introduced by Lin and Ma. For a weakly increasing tree TT, the statistics ee(T)\mathsf{ee}(T) and oe(T)\mathsf{oe}(T) record nodes of even outdegree at even and odd levels, respectively. The conjectured polynomials refine the tree enumeration by fixing ⌊ee(T)/2⌋=i\lfloor\mathsf{ee}(T)/2\rfloor=i and using ⌊oe(T)/2⌋\lfloor\mathsf{oe}(T)/2\rfloor as the exponent.

The authors explain that their maximal-label deletion method for Eulerian–Narayana polynomials does not directly apply because it does not preserve degree parity at each base vertex or level parity in the attached forests. They therefore identify finding a tractable insertion operator for these statistics as a natural extension, leaving the stated real-zero conjecture unresolved.

References

Lin and MaConjecture~5.1 posed a related real-zero question for reduced multiset Schett polynomials. Let $\mathsf{ee}(T)$ and $\mathsf{oe}(T)$ count the nodes of even outdegree at even and odd levels, respectively, with the root at level $0$. Their conjecture concerns the polynomials

\widehat S_{M,i}(t)= \sum_{\substack{T\in_M\lfloor\mathsf{ee}(T)/2\rfloor=i} t{\lfloor\mathsf{oe}(T)/2\rfloor},

and asserts that every nonzero such polynomial has only real zeros.

— Zeros and interlacing for multiset Eulerian-Narayana polynomials  (2610.00966 - Zhang et al., 1 Oct 2026) in Section 5, Further remarks