2009/09/22 by Jørgen Cherly, Jorgen Cherly, Cherly, Jorgen
Computer Science · Mathematics · #Advanced Topics in Algebra #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Matrix Theory and Algorithms #math.CO
paper · pdf · doi:10.48550/arxiv.0909.4030
21 pages
arxiv created 2009/09/22 · openalex publication_date 2009/09/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we announce a conjecture concerning enumeration of n-times persymmetric matrices over F2 by rank. To justify our statement we remark that the formulas obtained are valid for n equal to one, two and three.