Search arXivSearch

arXiv · 2306.15556

The Primitive Eulerian polynomial

Abstract

We introduce the Primitive Eulerian polynomial $P_{\cal A}(z)$ of a central hyperplane arrangement ${\cal A}$. It is a reparametrization of its cocharacteristic polynomial. Previous work of the first author implicitly show that, for simplicial arrangements, $P_{\cal A}(z)$ has nonnegative coefficients. For reflection arrangements of type A and B, the same work interprets the coefficients of $P_{\cal A}(z)$ using the (flag)excedance statistic on (signed) permutations. The main result of this article is to provide an interpretation of the coefficients of $P_{\cal A}(z)$ for all simplicial arrangements only using the geometry and combinatorics of ${\cal A}$. This new interpretation sheds more light to the case of reflection arrangements and, for the first time, gives combinatorial meaning to the coefficients of the Primitive Eulerian polynomial of the reflection arrangement of type D. In type B, we find a connection between the Primitive Eulerian polynomial and the $1/2$-Eulerian polynomial of Savage and Viswanathan (2012). We present some real-rootedness results and conjectures for $P_{\cal A}(z)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jose Bastidas, Christophe Hohlweg, Franco Saliola. 2023-06-27. The Primitive Eulerian polynomial. https://doi.org/10.5070/c64163853

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO