Sign inGet started
Paper · arXiv

A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks

In this work, we present a general Graph Neural Network (GNN) framework for learning algebraic properties of finite groups from their Cayley graph representations. The framework provides a unified computational pipeline consisting of a common graph construction procedure, feature representation, training methodology, and GNN architecture, with only the target labeling function varying across classification tasks. To demonstrate the generality of the proposed approach, we consider three representative algebraic properties: abelianity, nilpotency, and solvability. Experiments were conducted on a benchmark of 176 finite groups drawn from several classical families, with all groups included i...

AuthorsTal Weissblat
Primary categorycs.LG
Published24 June 2026
Last updated at source24 July 2026
cs.LGmath.GR
Embed this entry
<iframe src="https://silytics.si/embed/item/e8901d4a-6bca-486c-99b5-a798800c5c35" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.