For example :
32 3200 M
1 1 345
1 2 -23
2 1 77
2 200 31
30 3101 11
0 0 0
denotes a 32 by 3200 matrix with 5 non-zero entries, three of which are clustered at the top left.
- Forests and trees from Nicolas M. Thiery.
- G5: Decomposable subspaces at degree d of the invariant ring of G5 from Nicolas M. Thiery.
- Kocay: Brute force disjoint product matrices in the tree algebra on n nodes (linked with Kocay reconstruction conjecture) from Nicolas M. Thiery.
- Polynomial matrices from Florent Hivert.
- Relations from Florent Hivert.
- CAG from Michael Monagan.
- Margulies from Susan Margulies.
- Taha from Abdul Salam Jarrah.
- GL7d: differentials of the Voronoï complex of the perfect forms of rank 7 modulo GL_7(Z) equivalences (related to the cohomology of GL_7(Z) and the K-theory of Z) from Philippe Elbaz-Vincent.
- GL6.
- SL6.
- SPG: Symmetric Powers of Graphs from Gordon Royle.
- BasisLIB: rational sparse linear systems arising in linear programming applications from Dan Steffy.
- Mgn: homology of the moduli space of smooth algebraic curves Mg,n using the Penner fatgraph complex. Since there is no canonical labeling of the graphs, the matrices are well-defined up to a permutation of rows and columns. The matrix labelled "Mg,n-Dk" relates graphs having k+1 edges with graphs having k edges; some matrices have been omitted since they are null. From Riccardo Murri.
- Prym-can: On the Koszul cohomology of canonical and Prym-canonical binary curves by Elisabetta Colombo and Paola Frediani.
- Smooshed: Boundary matrices from smooshed CW complexes. The complexes themselves are alexander duals of independence complexes of hypergraphs. From Oliver Thistlethwaite.
- Tsuchioka. From Shunsuke Tsuchioka.
- DFA: motif statistics from the human proteome (DFA/PROSITE), the human chromosome 10 (DFA/CHR10) or toy examples (DFA/Toy) from Grégory Nuel.
- RSA 155, RSA 220 (Factorisation of RSA-220 with CADO-NFS), by Shi Bai, Pierrick Gaudry, Alexander Kruppa, Emmanuel Thomé and Paul Zimmermann.
- P 1024, A kilobit hidden SNFS discrete logarithm computation, by Joshua Fried, Pierrick Gaudry, Nadia Heninger and Emmanuel Thomé.
- Ding-Yuan: adjacency matrices of strongly 3-regular graphs by B. David Saunders.
- LinBox: algorithms and software for symbolic linear algebra.
- FFLAS-FFPACK: Finite field linear algebra subroutines/package.
- GBLA library for matrices generated during Gröbner basis computations in algorithms like F4 or F5.
- SMaSTo: Sparse MAtrix Storage TOols. From Riccardo Murri.
- SpaSM: Sparse direct Solver Modulo p. From Charles Bouillaguet.
- SimpHom: Compute Homology and Smith Forms from Gap.