Dice Question Streamline Icon: https://streamlinehq.com

Improving the lower bound N_n ≥ C_{n−1}

Improve the general lower bound N_n ≥ C_{n−1} for the number of ~-equivalence classes of n×n strictly lower triangular matrices over any field of characteristic ≠ 2, seeking a sharper bound valid for all n.

Information Square Streamline Icon: https://streamlinehq.com

Background

Using the newly introduced invariants (Wall and Measure sequence), the authors prove a lower bound N_n ≥ C_{n−1}. They further show that this bound is strict for n ≥ 4, i.e., N_n > C_{n−1}, which indicates room for strengthening the bound.

They explicitly state that improving this lower bound is an open problem.

References

Unfortunately, this lower bound is in general strict, in Subsection (v) and \ref{ssec-strict-for-n4}, we show that N_n>C_{n-1} for each n\geq4. This fact opens the problem of improving this lower bound.

Invariants for isomorphism classes in the category $\bcalNT$ (2508.00084 - Maturana, 31 Jul 2025) in Introduction (Section 1)