Pith. sign in

REVIEW 1 cited by

Cluster Algebras: Network Science and Machine Learning

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 2203.13847 v2 pith:ATHS3GIC submitted 2022-03-25 math.CO cs.LGhep-thmath.AG

classification math.COcs.LGhep-thmath.AG
keywords algebrasclusterlearningdatamachinenetworkscienceanalysis
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network analysis methods are applied to the exchange graphs for cluster algebras of varying mutation types. The analysis indicates that when the graphs are represented without identifying by permutation equivalence between clusters an elegant symmetry emerges in the quiver exchange graph embedding. The ratio between number of seeds and number of quivers associated to this symmetry is computed for finite Dynkin type algebras up to rank 5, and conjectured for higher ranks. Simple machine learning techniques successfully learn to classify cluster algebras using the data of seeds. The learning performance exceeds 0.9 accuracies between algebras of the same mutation type and between types, as well as relative to artificially generated data.

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. Metaheuristic Generation of Brane Tilings

    hep-th 2024-12 conditional novelty 6.0 of 10

    Simulated annealing over permutation tuples can generate consistent brane tilings, yielding a 26-field example not present in catalogues that stop at 24 fields.

Pith tools