Global bound for the constructed maximal commutative system

Let n=4k+9n=4k+9 with k2k\geq 2, and define

Kn:=C2n2,K_n:=\frac{|\mathcal{C}|}{2^{n-2}},

where C\mathcal{C} is the constructed maximal commutative algebraic system. KnK_n bound conjecture. Is Kn<1K_n<1 for all n=4k+9n=4k+9 with k2k\geq 2? Numerical verification in the source establishes the inequality for n<1000n<1000. The conjecture extends that verified finite range to every n=4k+9n=4k+9 with k2k\geq 2.

Sources & referencesView supporting material

Primary source

Victor A. Bovdi and Ho-Hon Leung, “Maximal commutative subalgebras of a Grassmann algebra”, arXiv:1803.03457 (2018).

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.