A machine learning approach to commutative algebra: Distinguishing table vs non-table ideals
arXiv:2109.11417
Abstract
We propose a novel approach to distinguish table vs non-table ideals by using different machine learning algorithms. We introduce the reader to table ideals, assuming some knowledge on commutative algebra and describe their main properties. We create a data set containing table and non-table ideals, and we use a feedforward neural network model, a decision tree and a graph neural networks for the classification. Our results indicate that there exists an algorithm to distinguish table ideals from non-table ideals, and we prove it along some novel results on table ideals.
arXiv comment29 figures
References in corpus (6)
- Scikit-learn: Machine Learning in Python
- Fast Graph Representation Learning with PyTorch Geometric
- Machine Learning Lie Structures & Applications to Physics
- Machine Learning meets Number Theory: The Data Science of Birch-Swinnerton-Dyer
- On decomposing monomial algebras with the Lefschetz properties
- The weak Lefschetz property of Gorenstein algebras of codimension three associated to the Apéry sets