Pith. sign in

REVIEW 1 cited by

Integrability ex machina

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2103.07475 v2 pith:POP7U3RB submitted 2021-03-12 nlin.SI hep-th

classification nlin.SIhep-th
keywords caseintegrabilityintegrablemethodpairsearchstructuressystem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Determining whether a dynamical system is integrable is generally a difficult task which is currently done on a case by case basis requiring large human input. Here we propose and test an automated method to search for the existence of relevant structures, the Lax pair and Lax connection respectively. By formulating this search as an optimization problem, we are able to identify appropriate structures via machine learning techniques. We test our method on standard systems of classical integrability and find that we can single out some integrable deformations of a system. Due to the ambiguity in defining a Lax pair our algorithm identifies novel Lax pairs which can be easily verified analytically.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Machine-Learning Search for Lax Connections

    hep-th 2026-08 conditional novelty 5.0 of 10

    An ML search for Lax connections recovers known spectral-parameter families in SU(2) PCM and S^2, but the low-loss candidate found for the non-symmetric coset T^{1,1} is a fake Lax connection, not a genuine integrabil...

Pith tools