Metraipolis › archive › dc_bc96e03ecc25

Learning Almost Complex and Complex Structures — arXiv:2611.03872

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03872
License (as archived)
CC0-1.0
Archived
2026-11-04T21:52:44.209Z
SHA-256 of the archived text
11397a8726d5700915724f772efda9b8396f3090bc77add6c574ff2c0cfc44a9
Stable URL of this page
https://metraipolis.com/documento/dc_bc96e03ecc25

How to cite

Learning Almost Complex and Complex Structures — arXiv:2611.03872 — arXiv (en), https://arxiv.org/abs/2611.03872 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bc96e03ecc25 (Metraipolis archive dc_bc96e03ecc25, sha256 11397a8726d5700915724f772efda9b8396f3090bc77add6c574ff2c0cfc44a9)
BibTeX
@misc{dcbc96e03ecc25,
  title = {Learning Almost Complex and Complex Structures — arXiv:2611.03872},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03872},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bc96e03ecc25; sha256 11397a8726d5700915724f772efda9b8396f3090bc77add6c574ff2c0cfc44a9},
  year = {2026}
}

Archived text

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

We study the numerical constructions of almost complex and complex structures on spheres and products of spheres up to real dimension six. Our general set-up parametrises almost complex structures via a global matrix field in an ambient Euclidean space, compressed by the tangent projector. The projector's algebraic residual measures the almost complex condition, while its Nijenhuis tensor is evaluated in the intrinsic norm of the round product metric. Polynomial features and neural networks are trained without prescribed targets to perform general searches for these structures. The almost complex search passes numerical admissibility checks on all nine examples that admit such structures and rejects $S^4$, where a topological obstruction is known. A matrix correction then enforces the almost complex identity, subject to a novel uniform admissibility condition. For integrability, a free polynomial representation with Levenberg-Marquardt optimisation learns the complex structures on $S^2\times S^2$, $S^3\times S^1$, $S^3\times S^3$ and $S^5\times S^1$, with the largest Nijenhuis norms found by adversarial search all below $10^{-9}$. These general searches were unsuccessful on $S^6$, $S^4\times S^2$ and $S^4\times T^2$. Therefore, for these three cases direct numerical reconstructions were built in torus-fibred coordinates. They are integrable by construction, satisfy their compatibility conditions to better than $10^{-11}$, and corroborate the recent constructions on $S^6$ and $S^4\times S^2$.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Complex Variables (math.CV) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.03872 — 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-11-04T21:38:49.788Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).