Metraipolis › archive › dc_f79bd0f61cd2

Solving Square-Submatrix Equation Systems — arXiv:2608.13408

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.13408
License (as archived)
CC0-1.0
Archived
2026-10-19T04:57:00.340Z
SHA-256 of the archived text
1dc8f790086ea370e91927fe29c68b4b4e1a71a9fe6878dab133c5a8ef1032d6
Stable URL of this page
https://metraipolis.com/documento/dc_f79bd0f61cd2

How to cite

Solving Square-Submatrix Equation Systems — arXiv:2608.13408 — arXiv (en), https://arxiv.org/abs/2608.13408 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f79bd0f61cd2 (Metraipolis archive dc_f79bd0f61cd2, sha256 1dc8f790086ea370e91927fe29c68b4b4e1a71a9fe6878dab133c5a8ef1032d6)
BibTeX
@misc{dcf79bd0f61cd2,
  title = {Solving Square-Submatrix Equation Systems — arXiv:2608.13408},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.13408},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f79bd0f61cd2; sha256 1dc8f790086ea370e91927fe29c68b4b4e1a71a9fe6878dab133c5a8ef1032d6},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13408. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We consider systems of submatrix equations, that is, sets of equality constraints over square submatrices of the input. By generalising the recursive algorithm of Gawrychowski et al. [Universal reconstruction of a string, Theoretical Computer Science 2020] to two dimensions, we obtain a linear-time procedure that finds a solution for any such input system. As an immediate by-product, this yields an optimal-time algorithm for decompressing any two-dimensional macro scheme based on copy operations of sub-squares.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.13408 — 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-19T04:52:49.857Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).