Search arXivSearch

arXiv · 2302.00754

On the real-rootedness of the Eulerian transformation

Abstract

The Eulerian transformation is the linear operator on polynomials in one variable with real coefficients which maps the powers of this variable to the corresponding Eulerian polynomials. The derangement transformation is defined similarly. Brändén and Jochemko have conjectured that the Eulerian transforms of a class of polynomials with nonnegative coefficients, which includes those having all their roots in the interval $[-1,0]$, have only real zeros. This conjecture is proven in this paper. More general transformations are introduced in the combinatorial-geometric context of uniform triangulations of simplicial complexes, where Eulerian and derangement transformations arise in the special case of barycentric subdivision, and are shown to have strong unimodality and gamma-positivity properties. General real-rootedness conjectures for these transformations, which unify various results and conjectures in the literature, are also proposed.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christos A. Athanasiadis. 2025-02-18. On the real-rootedness of the Eulerian transformation. https://doi.org/10.1112/jlms.70083

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

KEEP EXPLORING

Related papers

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO