Metraipolis › archive › dc_d0405cb8bd92
Factorisability of Low Dimensional Non-Negative Integer Matrices — arXiv:2609.26033
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.26033
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T16:33:31.433Z
- SHA-256 of the archived text
c96f95dbb20441838f220b9274a7af01c3061a8ca3b06d634414d9aab9f7f0d0- Stable URL of this page
https://metraipolis.com/documento/dc_d0405cb8bd92
How to cite
Factorisability of Low Dimensional Non-Negative Integer Matrices — arXiv:2609.26033 — arXiv (en), https://arxiv.org/abs/2609.26033 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d0405cb8bd92 (Metraipolis archive dc_d0405cb8bd92, sha256 c96f95dbb20441838f220b9274a7af01c3061a8ca3b06d634414d9aab9f7f0d0)
BibTeX
@misc{dcd0405cb8bd92,
title = {Factorisability of Low Dimensional Non-Negative Integer Matrices — arXiv:2609.26033},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.26033},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d0405cb8bd92; sha256 c96f95dbb20441838f220b9274a7af01c3061a8ca3b06d634414d9aab9f7f0d0},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26033. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.IT). Categorie arXiv: Discrete Mathematics (cs.DM) ; Data Structures and Algorithms (cs.DS); Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2609.26033 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-08T15:53:59.922Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).