Exact rank and Smith profile of affine incidence over
For , the normalized distinct-row matrix equals up to row and column ordering. For every prime , The paper also determines the complete -primary Smith profile of…
combinatorics / Finite geometry; Smith normal forms
For , the normalized distinct-row matrix equals up to row and column ordering. For every prime , The paper also determines the complete -primary Smith profile of : its exponent is , and all six multiplicities are explicit for every prime. The repeated-row Łaba–Trainor matrix has the same -rank, but the integral Smith claim applies only to . Arbitrary depth, higher dimension, projective Hjelmslev incidence and the generalized-polynomial characterization remain open. Finite computations certify exceptional cases; they do not prove the uniform formulas.
Temporal state
No reconciled state yet.
Append-only history
For , the normalized distinct-row matrix equals up to row and column ordering. For every prime , The paper also determines the complete -primary Smith profile of…
Research memory
For , the normalized distinct-row matrix equals up to row and column ordering. For every prime , The paper also determines the complete -primary Smith profile of : its exponent is , and all six multiplicities are explicit for every prime. The repeated-row Łaba–Trainor matrix has the same -rank, but the integral Smith claim applies only to . Arbitrary depth, higher dimension, projective Hjelmslev incidence and the generalized-polynomial characterization remain open. Finite computations certify exceptional cases; they do not prove the uniform formulas.
For , the normalized distinct-row matrix equals up to row and column ordering. For every prime , The paper also determines the complete -primary Smith profile of : its exponent is , and all six multiplicities are explicit for every prime. The repeated-row Łaba–Trainor matrix has the same -rank, but the integral Smith claim applies only to . Arbitrary depth, higher dimension, projective Hjelmslev incidence and the generalized-polynomial characterization remain open. Finite computations certify exceptional cases; they do not prove the uniform formulas.
Evidence graph
parent of · event · claim reported
parent of · claim · theorem