Search arXivSearch

arXiv · 1911.01650

Eulerian polynomials for subarrangements of Weyl arrangements

Abstract

Let $\mathcal{A}$ be a Weyl arrangement. We introduce and study the notion of $\mathcal{A}$-Eulerian polynomial producing an Eulerian-like polynomial for any subarrangement of $\mathcal{A}$. This polynomial together with shift operator describe how the characteristic quasi-polynomial of a new class of arrangements containing ideal subarrangements of $\mathcal{A}$ can be expressed in terms of the Ehrhart quasi-polynomial of the fundamental alcove. The method can also be extended to define two types of deformed Weyl subarrangements containing the families of the extended Shi, Catalan, Linial arrangements and to compute their characteristic quasi-polynomials. We obtain several known results in the literature as specializations, including the formula of the characteristic polynomial of $\mathcal{A}$ via Ehrhart theory due to Athanasiadis (1996), Blass-Sagan (1998), Suter (1998) and Kamiya-Takemura-Terao (2010); and the formula relating the number of coweight lattice points in the fundamental parallelepiped with the Lam-Postnikov Eulerian polynomial due to the third author.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ahmed Umer Ashraf, Tan Nhat Tran, Masahiko Yoshinaga. 2020-04-30. Eulerian polynomials for subarrangements of Weyl arrangements. https://doi.org/10.1016/j.aam.2020.102064

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

KEEP EXPLORING

Related papers

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

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