OpenAlex ·

Real-rooted Eulerian polynomials from permutations, words, and paths

Per Alexandersson

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2609.07325
Original
Read it at the publisher
Topics
CombinatoricsNumerical AnalysisNumber Theory

Abstract

We study seven Eulerian-type polynomial families. We prove that the descent polynomials of derangements are real-rooted, settling the derangement part of a conjecture of S.~Fu, Z.~Lin, and J.~Zeng. We also resolve the real-rootedness conjecture in OEIS A335340, strengthen the known rowwise real-rootedness of an even-top descent family to consecutive strict interlacing, and prove real-rootedness, consecutive interlacing, and real-rooted gamma-polynomials for U.~Shankar's super-Eulerian polynomials. A differential recurrence gives consecutive weak interlacing for ternary words counted by increasing runs. We prove stability of the peak-value refinement and consecutive interleaving of its positive weighted diagonals, settling a conjecture of P.~Alexandersson and O.~Nabawanda. Finally, we prove that the zig-zag Eulerian polynomials, which enumerate swaps in alternating permutations, have simple negative roots, settling the real-rootedness conjecture of T.~Kyle Petersen and Y.~Zhuang.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Combinatorics

Get the few papers worth your time in Combinatorics every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics