arXiv:2607. 11140v1 Announce Type: new Abstract: Determining whether one finite group is isomorphic to a subgroup of another is a fundamental problem in computational group theory.
By Tal Weissblat
arXiv:2606. 07619v1 Announce Type: new Abstract: We present a Graph Neural Network (GNN) framework for the classification of finite groups according to their solvability.
By Tal Weissblat
arXiv:2606. 26212v1 Announce Type: new Abstract: A Graph Neural Network (GNN) framework for predicting the solvability of finite groups from their Cayley graph representations was introduced in [1].
By Tal Weissblat
arXiv:2607. 12026v1 Announce Type: cross Abstract: Finite groups are rigid algebraic objects, whose Cayley graphs expose a rich network geometry through which group-theoretic structure can be measured, compared, and learned.
By Rashid Barket, Enrico Grimaldi, Yacoub Hendi, Edward Hirst, Adam Onus, Harmeet Singh
arXiv:2607. 03097v1 Announce Type: new Abstract: Heterogeneous Graph Neural Networks (HGNNs) have exhibited remarkable efficacy in modeling complex systems with multiple types of nodes and relations, yet their training on large-scale heterogeneous graphs remains computationally prohibitive.
By Fuyan Ou, Yulin Hu, Ye Yuan
arXiv:2608. 14823v1 Announce Type: new Abstract: Are heterophilic nodes in a graph harder to classify because they are heterophilic or because they are rare?
By Preben M. Ness, Fariz Ikhwantri, Dusica Marijan