Computer verification of the claims in the article "Explicit maximal totally real embeddings"
Nefton Pali, Bruno Salvy · HAL (Le Centre pour la Communication Scientifique Directe) · 2024
We provide Maple verification of the main arguments present in theproof of the main statement in our recent article ”Explicit maximal totallyreal embeddings” as well as verification of the vanishingof the integrability equations there up to a certain order. The presentnote provide also a useful synthesis of the main arguments in our article.The note is written in an independent fashion with respect to the article. Therefore it can be read by computer programmers withoutdifferential geometry background. We keep the notations here as muchclose as possible to the notations in the article. In this note weshow that the explicit formula for the complex structure given in the articleallows very fast computer verification of the vanishing of its integrabilityequations up to the order k = 7.