Search arXivSearch

arXiv · 2504.21395

On the magic positivity of Ehrhart polynomials of dilated polytopes

Abstract

A polynomial $f(x)$ of degree $d$ is said to be magic positive if all the coefficients are non-negative when $f(x)$ is expanded with respect to the basis $\{x^i(x+1)^{d-i}\}_{i=0}^d$. It is known that if $f(x)$ is magic positive, then the polynomial appearing in the numerator of its generating function is real-rooted. In this paper, we show that for a polynomial $f(x)$ with positive real coefficients, there exists a positive real number $k$ such that $f(k'x)$ is magic positive for any $k' \geq k$. Furthermore, for any integer $d\geq3$, we show the existence of a $d$-dimensional polytope $P$ such that the Ehrhart polynomial of $kP$ is not magic positive for a given integer $k$. Finally, we investigate how much certain polytopes need to be dilated to make their Ehrhart polynomials magic positive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Masato Konoike. 2025-04-30. On the magic positivity of Ehrhart polynomials of dilated polytopes. https://arxiv.org/abs/2504.21395

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