Critical threshold formula for higher critical number

Let NN be a simple binary matroid of critical number c2c\geq 2. A kk-codimensional subspace of NN is obtained by intersecting its ground set, in a projective-geometry representation, with a flat of rank r(N)kr(N)-k. Let N0\mathcal{N}_0, N1/4\mathcal{N}_{1/4}, and N1/2\mathcal{N}_{1/2} be the subclasses of critical-number-two simple binary matroids defined in the source. Higher-critical-number threshold conjecture. The critical threshold of NN is

1(1δ)22c,1-(1-\delta)2^{2-c},

where δ{0,14,12}\delta\in\{0,\tfrac14,\tfrac12\} is minimal such that NSNδN|S\in\mathcal{N}_\delta for some (c2)(c-2)-codimensional subspace SS of NN. This conjecture is stated to imply the simplified threshold-values conjecture and remains open in the source.

Sources & referencesView supporting material

Primary source

Jim Geelen and Peter Nelson, “The critical number of dense triangle-free binary matroids”, arXiv:1406.2588 (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.