The exact-variable Finiteness Conjecture for nonsingular unsatisfiable hitting clause-sets

Let [?][?] be the supremum of the number n(F)n(F) of variables among nonsingular unsatisfiable hitting clause-sets FF of deficiency kk:

\maxnhitdef(k)=sup{n(F):F\Uclashnsiδ=k}.\maxnhitdef(k)=\sup\{n(F):F\in\Uclashnsi{\delta=k}\}.

Exact-variable Finiteness Conjecture. For every kNk\in\mathbb{N},

\maxnhitdef(k)<+.\maxnhitdef(k)<+\infty.

This is the formal version of the Finiteness Conjecture for the nonsingular subclass. The paper’s abstract states that the case k=3k=3 is proved, with the cases k2k\leq 2 already known; the general assertion remains open.

Sources & referencesView supporting material

Primary source

Oliver Kullmann and Xishun Zhao, “Unsatisfiable hitting clause-sets with three more clauses than variables”, arXiv:1604.01288 (2016).

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.