Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.07325

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

Per Alexandersson
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study six 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. The proof uses a compatible-pair recursion and finite-symbol stability. We also resolve the real-rootedness conjecture in OEIS \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. Finally, 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.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Per Alexandersson. 2026-09-07. Real-rooted Eulerian polynomials from permutations, words, and paths. https://arxiv.org/abs/2609.07325

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗