User Tools

Site Tools


Michael Dobbins (Binghamton)

A Universality Theorem for Nested Polytopes

Abstract for the Combinatorics Seminar 2018 September 18

Given a polytope S, a polytope P containing S, and a number k, the Nested Polytope problem asks whether there is a polytope Q with at most k vertices that contains S and is contained in P. We show that the Nested Polytope problem is ETR-complete.

This is joint work with Andreas Holmsen and Tillmann Miltzow.

seminars/comb/abstract.201809dob.txt · Last modified: 2020/01/29 14:03 (external edit)