Search arXiv⌕ Search

arXiv · 2610.06419

Magic positivity for polar duals of pseudo-symmetric smooth Fano polytopes

Abstract

Motivated by Gal's conjecture, Ferroni and Higashitani conjectured that the $h^*$-polynomial of any Gorenstein lattice polytope admitting a quadratic triangulation is $γ$-positive. Together with conjectures predicting quadratic properties of toric ideals of smooth lattice polytopes, this suggests that smooth Gorenstein lattice polytopes should have $γ$-positive $h^*$-polynomials. In this paper, we prove that the Ehrhart polynomial of the polar dual of every pseudo-symmetric simplicial reflexive polytope is magic positive. For pseudo-symmetric smooth Fano polytopes, we prove the stronger statement that all magic coefficients are strictly positive. Consequently, for every pseudo-symmetric simplicial reflexive polytope, its polar dual is Ehrhart positive and has a real-rooted and $γ$-positive $h^*$-polynomial. We also prove that the Ehrhart polynomial of the polar dual of the symmetric edge polytope of every cycle is magic positive. This gives an affirmative answer to a question of Konoike, who had previously proved partial positivity results for this family.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hidefumi Ohsugi, Akiyoshi Tsuchiya. 2026-10-05. Magic positivity for polar duals of pseudo-symmetric smooth Fano polytopes. https://arxiv.org/abs/2610.06419

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

KEEP EXPLORING

Related papers

Entropy and the growth rate of universal covering trees

This work studies the relation between two graph parameters, $ρ$ and $Λ$. For an undirected graph $G$, $ρ(G)$ is the growth rate of its universal covering tree, while $Λ(G)$ is a weighted geometric average of the vertex degree minus one, corresponding to the rate of entropy growth for the non-backtracking random walk (NBRW). It is well known that $ρ(G) \geq Λ(G)$ for all graphs, and that graphs with $ρ=Λ$ exhibit some special properties. In this work we derive an easy to check, necessary and sufficient condition for the equality to hold. Furthermore, we show that the variance of the number of random bits used by a length $\ell$ NBRW is $O(1)$ if $ρ= Λ$ and $Ω(\ell)$ if $ρ> Λ$. As a consequence we exhibit infinitely many non-trivial examples of graphs with $ρ= Λ$.

math.CO↗

A tight single-change covering design with block size 6

We give a tight single-change covering design with $v=26$ and $k=6$. This answers Problem 1 of the Nineteenth British Combinatorial Conference, which asked whether such a design exists with block size greater than $5$. We also describe the satisfiability search that found the design, including negative search results at the smallest admissible order $v=21$.

math.CO↗

Hall's universal group does not have finite big Ramsey degrees

In this paper we show that the Hall's universal group does not have finite big Ramsey degrees. Our strategy consists of piggybacking on the recent result of Hubička, Konečný, Todorčević and Zucker (announced at EUROCOMB 2025) that the random edge-labelled graph (the Fraïssé limit of the class of all finite complete edge-labelled graphs where the set of labels is countably infinite) does not have finite big Ramsey degrees. We then use the machinery of category theory to transport this result from the context of edge-labelled graphs to the context of groups. The main step in the process is the construction of a functor from the category of edge-labelled graphs and embeddings to the category of groups and group embeddings which takes finite graphs to finite groups. This makes is possible for us to build a subgroup of the Hall's universal group which encodes the random edge-labelled graph. Our main result shows that several families finite groups, including non-cyclic abelian groups, do not have finite big Ramsey degrees in the Hall's universal group. Actually, we show that all potential candidates for groups with finite big Ramsey degrees have to be solvable.

math.CO↗