Graph Neural Networks for Predicting Solvability of Finite Groups
Summary
This paper applies graph neural networks to predict the solvability of finite groups, demonstrating an AI-driven approach to a classic problem in group theory.
View Cached Full Text
Cached at: 06/09/26, 08:51 AM
# Graph Neural Networks for Predicting Solvability of Finite Groups Source: [https://arxiv.org/abs/2606.07619](https://arxiv.org/abs/2606.07619) Bibliographic Tools ## Bibliographic and Citation Tools Bibliographic Explorer Toggle Code, Data, Media ## Code, Data and Media Associated with this Article Demos ## Demos Related Papers ## Recommenders and Search Tools IArxiv recommender toggle About arXivLabs ## arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website\. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy\. arXiv is committed to these values and only works with partners that adhere to them\. Have an idea for a project that will add value for arXiv's community?[**Learn more about arXivLabs**](https://info.arxiv.org/labs/index.html)\.
Similar Articles
A General Framework for Learning Algebraic Properties from Cayley Graphs using Graph Neural Networks
This paper presents a general framework for using Graph Neural Networks to learn algebraic properties from Cayley graphs, offering a new approach to algebraic reasoning with GNNs.
EnSol: an environment-aware graph neural network for molecular solubility prediction
EnSol is an environment-aware graph neural network that predicts molecular solubility by representing solutes and solvents as graphs and using cross-attention to model interactions, with probabilistic outputs to capture temperature effects and experimental uncertainty. It achieves state-of-the-art performance on benchmark datasets, validated experimentally.
AutoGraphForge: Towards Automated Graph Theory Discovery
The article presents AutoGraphForge, a computational pipeline for automated graph theory discovery that generates conjectures, tests them against a large dataset, and uses neural provers for formal verification in Lean 4.
Amortizing Physics-Informed Neural Solvers via Graph Hypernetworks
This paper proposes using graph hypernetworks to explicitly represent relationships in PDEs for amortizing physics-informed neural networks, showing improved accuracy in solving coupled systems.
Graph Coloring Approach to Solving Sudoku with Oscillatory Neural Networks
This paper proposes an oscillatory neural network (ONN) based solver for Sudoku puzzles by formulating them as graph coloring problems, achieving high accuracy on 4x4 and 9x9 puzzles.