On a conjecture regarding enumeration of n-times persymmetric matrices over F_2 by rank
Jorgen Cherly

TL;DR
This paper presents a conjecture about counting n-times persymmetric matrices over F_2 based on rank, supported by verified formulas for small values of n.
Contribution
It introduces a new conjecture on the enumeration of n-times persymmetric matrices over F_2 by rank, extending known cases.
Findings
Formulas verified for n=1, 2, 3
Conjecture proposed for general n
Supports enumeration of matrices by rank over F_2
Abstract
In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F_2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Matrix Theory and Algorithms · Graph theory and applications
