Prasad and Ram's subspace enumeration formula for three equal parts
Prasad and Ram's subspace enumeration formula for three equal parts
Let be a prime power, let be a non-negative integer, and let . For a triple of non-negative integers, write for the number of -invariant chains of subspaces with successive dimension sequence , and let be a primitive cube root of unity. Define
Prasad and Ram's conjecture. For any ,
Here counts the relevant chains of -invariant subspaces with three successive quotients of dimension . 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
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 on a space of dimension . 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 .
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- statement as Conjecture and says the corresponding Touchard--Riordan-type identity remains unproved.
Current status (as of August 2026): The arbitrary- 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
Sign in to submit a solution.
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 and every positive integer . Indeed, every operator with irreducible characteristic polynomial of degree is a counterexample. The smallest counterexample has and . A second example with and avoids negative powers entirely: the conjectured integer is , whereas the actual integer is .
1. The source definitions
Let and . The quantity on the left side of the conjecture is the number of splitting subspaces
For nonnegative integers with sum , the quantity on the right side is the number of invariant flags
Zero increments are allowed, as required by the source's sum over all triples of nonnegative integers. Put
For a primitive complex cube root of unity , the source conjectures
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 over , and let be its companion operator. Equivalently, identify
If a nonzero subspace is invariant under , then it is invariant under every polynomial in . Hence it is invariant under multiplication by every element of . Any nonzero then gives
so . Therefore the only invariant subspaces are and .
Consequently, the only nonzero flag counts are
Write
For the three triples in (6), respectively, the values of are , , and , and all three powers of equal one. Thus the proposed right-hand side becomes
All exponents in the first line are integers. For , 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 , the number of -dimensional subspaces satisfying
is
Applying this previously established theorem with to (5), the actual left side of (4) is
Comparing (9) with (7) gives the exact discrepancy
Since and , equality holds for this family precisely when . Therefore every irreducible operator of degree disproves (4) whenever . 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 , , and the irreducible polynomial . In the basis , multiplication by is
For every nonzero , the vectors
are linearly independent: any dependence would give a nonzero annihilating polynomial for of degree at most two, contradicting the irreducibility of . Every one-dimensional subspace therefore splits. Since has seven one-dimensional subspaces,
By (6), the only invariant flags have increment triples
Their respective contributions to the source formula are
Hence (4) predicts
More generally, the same elementary cyclic-vector argument works for every prime power when , giving
5. An integral counterexample eliminates negative-exponent concerns
Take instead , , and the irreducible polynomial
The three flag contributions in (7) are all positive integers:
On the other hand, (9) gives
This value can also be checked without invoking (8): there are exactly
two-dimensional subspaces of , and direct Gaussian elimination shows that exactly satisfy
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 and every positive dimension parameter .