Abstract

A lattice polytope mathscr {P} subset mathbb {R}^d is called a locally anti-blocking polytope if for any closed orthant {mathbb R}^d_{varepsilon } in mathbb {R}^d, mathscr {P} cap mathbb {R}^d_{varepsilon } is unimodularly equivalent to an anti-blocking polytope by reflections of coordinate hyperplanes. We give a formula for the h^*-polynomials of locally anti-blocking lattice polytopes. In particular, we discuss the gamma -positivity of h^*-polynomials of locally anti-blocking reflexive polytopes.

Highlights

  • A lattice polytope is a convex polytope all of whose vertices have integer coordinates

  • We investigate the h∗-polynomials of locally anti-blocking lattice polytopes

  • Enriched chain polytopes are unconditional and reflexive, and their h∗-polynomials are always γ -positive. Combining these facts and Theorem 1.1, we know that, for a locally anti-blocking reflexive polytope P, if every P ∩ Rdε is the intersection of Rdε and either an enriched chain polytope or a symmetric edge reflexive polytope of type B, the h∗-polynomial of P is γ -positive (Corollary 4.2)

Read more

Summary

Introduction

A lattice polytope is a convex polytope all of whose vertices have integer coordinates. Enriched chain polytopes are unconditional and reflexive, and their h∗-polynomials are always γ -positive Combining these facts and Theorem 1.1, we know that, for a locally anti-blocking reflexive polytope P, if every P ∩ Rdε is the intersection of Rdε and either an enriched chain polytope or a symmetric edge reflexive polytope of type B, the h∗-polynomial of P is γ -positive (Corollary 4.2). By using this result, we show that the h∗-polynomials of several classes of reflexive polytopes are γ -positive.

Ehrhart Theory and Reflexive Polytopes
Classes of Anti-Blocking Polytopes and Unconditional Polytopes
Stable Set Polytopes
Chain Polytopes and Enriched Chain Polytopes
Symmetric Edge Polytopes of Type B
Symmetric Edge Polytopes of Type A
Pseudo-Symmetric Simplicial Reflexive Polytopes
Twinned Chain Polytopes
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call