Prasad and Ram's subspace enumeration formula for three equal parts

From papers

Let qq be a prime power, let mm be a non-negative integer, and let TM3m(Fq)T\in M_{3m}(\mathbb{F}_q). For a triple j=(j1,j2,j3)\boldsymbol{j}=(j_1,j_2,j_3) of non-negative integers, write YjTY^T_{\boldsymbol{j}} for the number of TT-invariant chains of subspaces with successive dimension sequence j\boldsymbol{j}, and let ω\omega be a primitive cube root of unity. Define

g(j1,j2,j3)={2j2+j3,if j2+2j32(mod3),\j2+2j3,if j2+2j30,1(mod3).g(j_1,j_2,j_3)=\begin{cases}2j_2+j_3,&\text{if }j_2+2j_3\equiv2\pmod{3},\j_2+2j_3,&\text{if }j_2+2j_3\equiv0,1\pmod{3}. \end{cases}

Prasad and Ram's conjecture. For any TM3m(Fq)T\in M_{3m}(\mathbb{F}_q),

σ(m,m,m)T=qm2mj1+j2+j3=3mq13(i=13(ji2)g(j1,j2,j3))Y(j1,j2,j3)Tωj2+2j3.\sigma^T_{(m,m,m)}=q^{m^2-m}\sum_{j_1+j_2+j_3=3m}q^{\frac13\left(\sum_{i=1}^3\binom{j_i}{2}-g(j_1,j_2,j_3)\right)}Y^T_{(j_1,j_2,j_3)}\omega^{j_2+2j_3}.

Here σ(m,m,m)T\sigma^T_{(m,m,m)} counts the relevant chains of TT-invariant subspaces with three successive quotients of dimension mm. The formula is an unpublished conjecture arising from the universal formulas for subspace enumeration; the paper proves it through the corresponding scalar-matrix specialization and a more general bibasic double-sum identity.

Progress summary

Partially solved

The full conjecture remains unproved, although a 2026 paper proves its scalar-matrix special case and a related identity.

The conjecture predicts a uniform formula for the three-equal-parts subspace count for every operator TT on a space of dimension 3m3m. The underlying enumeration problem was posed by Bender, Coley, Robbins, and Rumsey, while Prasad and Ram formulated this case.

Known results

  • Ram previously solved the general universal-coefficient problem using symmetric functions, but this does not prove the stated formula for arbitrary TT.

May 2026 scalar-matrix specialization

Bhatnagar and Prasad proved the scalar-matrix specialization through a more general bibasic double-sum identity. Their paper explicitly identifies the arbitrary-TT statement as Conjecture 55 and says the corresponding Touchard--Riordan-type identity remains unproved.

Current status (as of August 2026): The arbitrary-TT conjecture remains open; only its scalar-matrix specialization and related identities are established.

Sources
Sources & referencesView supporting material

Primary source

Gaurav Bhatnagar and Amritanshu Prasad, “A bibasic double sum extension of a q-binomial theorem arising out of subspace enumeration”, arXiv:2605.01747 (2026).

Solutions 1

Counterexample

An infinite family disproving the Prasad–Ram invariant-flag formula

Source. Gaurav Bhatnagar and Amritanshu Prasad, A bibasic double sum extension of a q-binomial theorem arising out of subspace enumeration, Conjecture 5, equation (2.3). The distinct scalar-matrix specialization, Conjecture 1, is proved in that paper and is not disputed here.

The proposed formula fails for every prime power qq and every positive integer m3m\neq3. Indeed, every operator with irreducible characteristic polynomial of degree 3m3m is a counterexample. The smallest counterexample has q=2q=2 and m=1m=1. A second example with q=2q=2 and m=2m=2 avoids negative powers entirely: the conjectured integer is 168168, whereas the actual integer is 336336.

1. The source definitions

Let V=Fq3mV=\mathbb F_q^{3m} and TEndFq(V)T\in\operatorname{End}_{\mathbb F_q}(V). The quantity on the left side of the conjecture is the number of splitting subspaces

σ(m,m,m)T=#{WV:dimW=m,V=WT(W)T2(W)}.(1)\sigma^T_{(m,m,m)} = \#\left\{ W\leq V: \dim W=m,\quad V=W\oplus T(W)\oplus T^2(W) \right\}. \tag{1}

For nonnegative integers j1,j2,j3j_1,j_2,j_3 with sum 3m3m, the quantity on the right side is the number of invariant flags

Y(j1,j2,j3)T=#{0=W0W1W2W3=V:T(Wi)Wi,dim(Wi/Wi1)=ji}.(2)Y^T_{(j_1,j_2,j_3)} = \#\left\{ 0=W_0\subseteq W_1\subseteq W_2\subseteq W_3=V: T(W_i)\subseteq W_i,\quad \dim(W_i/W_{i-1})=j_i \right\}. \tag{2}

Zero increments are allowed, as required by the source's sum over all triples of nonnegative integers. Put

g(j1,j2,j3)={2j2+j3,j2+2j32(mod3),j2+2j3,j2+2j30,1(mod3).(3)g(j_1,j_2,j_3) = \begin{cases} 2j_2+j_3,&j_2+2j_3\equiv2\pmod3, \\ j_2+2j_3,&j_2+2j_3\equiv0,1\pmod3. \end{cases} \tag{3}

For a primitive complex cube root of unity ω\omega, the source conjectures

σ(m,m,m)T=qm2mj1+j2+j3=3mq13(i=13(ji2)g(j1,j2,j3))Y(j1,j2,j3)Tωj2+2j3.(4)\sigma^T_{(m,m,m)} = q^{m^2-m} \sum_{j_1+j_2+j_3=3m} q^{\frac13\left( \sum_{i=1}^3\binom{j_i}{2}-g(j_1,j_2,j_3) \right)} Y^T_{(j_1,j_2,j_3)} \omega^{j_2+2j_3}. \tag{4}

The left side counts splitting subspaces, not invariant chains; invariant chains occur only on the right.

2. Irreducible operators leave exactly three flags

Choose any monic irreducible polynomial of degree 3m3m over Fq\mathbb F_q, and let TT be its companion operator. Equivalently, identify

V=Fq3m,T(v)=αv,Fq(α)=Fq3m.(5)V=\mathbb F_{q^{3m}}, \qquad T(v)=\alpha v, \qquad \mathbb F_q(\alpha)=\mathbb F_{q^{3m}}. \tag{5}

If a nonzero subspace UVU\leq V is invariant under TT, then it is invariant under every polynomial in TT. Hence it is invariant under multiplication by every element of Fq[α]=Fq3m\mathbb F_q[\alpha]=\mathbb F_{q^{3m}}. Any nonzero uUu\in U then gives

V=Fq3muU,V=\mathbb F_{q^{3m}}u\subseteq U,

so U=VU=V. Therefore the only invariant subspaces are 00 and VV.

Consequently, the only nonzero flag counts are

Y(3m,0,0)T=Y(0,3m,0)T=Y(0,0,3m)T=1.(6)Y^T_{(3m,0,0)} = Y^T_{(0,3m,0)} = Y^T_{(0,0,3m)} =1. \tag{6}

Write

C=(3m2)=3m(3m1)2.C=\binom{3m}{2}=\frac{3m(3m-1)}2.

For the three triples in (6), respectively, the values of gg are 00, 3m3m, and 6m6m, and all three powers of ω\omega equal one. Thus the proposed right-hand side becomes

R(q,m)=qm2m(qC/3+q(C3m)/3+q(C6m)/3)=q(5m27m)/2(q2m+qm+1).(7)\begin{aligned} R(q,m) &= q^{m^2-m} \left( q^{C/3} +q^{(C-3m)/3} +q^{(C-6m)/3} \right) \\ &= q^{(5m^2-7m)/2} \left(q^{2m}+q^m+1\right). \end{aligned} \tag{7}

All exponents in the first line are integers. For m2m\geq2, all three source summands have nonnegative exponents.

3. The established splitting-subspace count gives a different answer

The splitting-subspace theorem of Eric Chen and Dennis Tseng, The Splitting Subspace Conjecture, Finite Fields and Their Applications 24 (2013), 15–28, Corollary 3.4, states that whenever Fq(α)=Fqmd\mathbb F_q(\alpha)=\mathbb F_{q^{md}}, the number of mm-dimensional subspaces satisfying

Fqmd=WαWαd1W\mathbb F_{q^{md}} = W\oplus\alpha W\oplus\cdots\oplus\alpha^{d-1}W

is

qmd1qm1qm(m1)(d1).(8)\frac{q^{md}-1}{q^m-1}\,q^{m(m-1)(d-1)}. \tag{8}

Applying this previously established theorem with d=3d=3 to (5), the actual left side of (4) is

σ(m,m,m)T=(q2m+qm+1)q2m(m1).(9)\sigma^T_{(m,m,m)} = \left(q^{2m}+q^m+1\right)q^{2m(m-1)}. \tag{9}

Comparing (9) with (7) gives the exact discrepancy

σ(m,m,m)TR(q,m)=qm(3m)/2.(10)\boxed{ \frac{\sigma^T_{(m,m,m)}}{R(q,m)} =q^{m(3-m)/2}. } \tag{10}

Since q>1q>1 and m1m\geq1, equality holds for this family precisely when m=3m=3. Therefore every irreducible operator of degree 3m3m disproves (4) whenever m3m\neq3. Irreducible polynomials exist in every positive degree over every finite field, so the counterexamples cover every prime power and every such dimension.

4. The smallest counterexample needs no external enumeration theorem

Take q=2q=2, m=1m=1, and the irreducible polynomial X3+X+1X^3+X+1. In the basis 1,α,α21,\alpha,\alpha^2, multiplication by α\alpha is

T=(001101010).(11)T= \begin{pmatrix} 0&0&1 \\ 1&0&1 \\ 0&1&0 \end{pmatrix}. \tag{11}

For every nonzero vF23v\in\mathbb F_2^3, the vectors

v,T(v),T2(v)v,\quad T(v),\quad T^2(v)

are linearly independent: any dependence would give a nonzero annihilating polynomial for vv of degree at most two, contradicting the irreducibility of X3+X+1X^3+X+1. Every one-dimensional subspace therefore splits. Since F23\mathbb F_2^3 has seven one-dimensional subspaces,

σ(1,1,1)T=7.(12)\sigma^T_{(1,1,1)}=7. \tag{12}

By (6), the only invariant flags have increment triples

(3,0,0),(0,3,0),(0,0,3).(3,0,0),\qquad(0,3,0),\qquad(0,0,3).

Their respective contributions to the source formula are

2,1,12.2,\qquad1,\qquad\frac12.

Hence (4) predicts

R(2,1)=2+1+12=727.(13)R(2,1)=2+1+\frac12=\frac72\neq7. \tag{13}

More generally, the same elementary cyclic-vector argument works for every prime power when m=1m=1, giving

σ(1,1,1)T=q2+q+1,R(q,1)=q+1+q1.(14)\sigma^T_{(1,1,1)}=q^2+q+1, \qquad R(q,1)=q+1+q^{-1}. \tag{14}

5. An integral counterexample eliminates negative-exponent concerns

Take instead q=2q=2, m=2m=2, and the irreducible polynomial

X6+X+1F2[X].(15)X^6+X+1\in\mathbb F_2[X]. \tag{15}

The three flag contributions in (7) are all positive integers:

R(2,2)=27+25+23=168.(16)R(2,2)=2^7+2^5+2^3=168. \tag{16}

On the other hand, (9) gives

σ(2,2,2)T=(24+22+1)24=336.(17)\sigma^T_{(2,2,2)} =(2^4+2^2+1)2^4 =336. \tag{17}

This value can also be checked without invoking (8): there are exactly

[62]2=651\begin{bmatrix}6\\2\end{bmatrix}_2 =651

two-dimensional subspaces of F26\mathbb F_2^6, and direct Gaussian elimination shows that exactly 336336 satisfy

F26=WT(W)T2(W).(18)\mathbb F_2^6=W\oplus T(W)\oplus T^2(W). \tag{18}

Thus the failure is substantive even when every term of the conjectural formula is an integer. The scalar specialization proved in the source remains correct; what fails is its proposed extension to arbitrary operators.

Conclusion: Source Conjecture 5 is DISPROVED for every prime power qq and every positive dimension parameter m3m\neq3.

0 endorsements
Shivam Patel ·