Strictness conjecture for constructible-sheaf quantifier levels

For each positive integer pp, let Λ(p)PR\boldsymbol{\Lambda}^{(p)}\boldsymbol{\mathcal{P}}_\mathbb{R} denote the pp-th sheaf-theoretic quantifier level built from PR\boldsymbol{\mathcal{P}}_\mathbb{R}. Constructible-sheaf hierarchy strictness conjecture. For every p>0p>0,

Λ(p)PRPR.\boldsymbol{\Lambda}^{(p)}\boldsymbol{\mathcal{P}}_\mathbb{R}\neq\boldsymbol{\mathcal{P}}_\mathbb{R}.

The source notes that this is a priori weaker than the standard conjecture separating the corresponding compact real BSS hierarchy levels from PRc\mathbf{P}_\mathbb{R}^c.

Sources & referencesView supporting material

Primary source

Saugata Basu, “A complexity theory of constructible functions and sheaves”, arXiv:1309.5905 (2017).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.