Testing idealness in the filter oracle model

Abstract

A filter oracle for a clutter consists of a finite set $V$ along with an oracle which, given any set $X\subseteq V$, decides in unit time whether or not $X$ contains a member of the clutter. Let ${\mathfrak{A}}_{2n}$ be an algorithm that, given any clutter $\mathcal{C}$ over $2n$ elements via a filter oracle, decides whether or not $\mathcal{C}$ is ideal. We prove that in the worst case, ${\mathfrak{A}}_{2n}$ must make at least $2^n$ calls to the filter oracle. Our proof uses the theory of cuboids.