Predicting the integer decomposition property via machine learning

DOI10.1142/9789811200489_0010zbMATH Open1477.68263arXiv1807.08399OpenAlexW2889077697MaRDI QIDQ5195201FDOQ5195201

Authors:

Publication date: 18 September 2019

Published in: Algebraic and Geometric Combinatorics on Lattice Polytopes (Search for Journal in Brave)

Abstract: In this paper we investigate the ability of a neural network to approximate algebraic properties associated to lattice simplices. In particular we attempt to predict the distribution of Hilbert basis elements in the fundamental parallelepiped, from which we detect the integer decomposition property (IDP). We give a gentle introduction to neural networks and discuss the results of this prediction method when scanning very large test sets for examples of IDP simplices.

Full work available at URL: https://arxiv.org/abs/1807.08399

Recommendations

• Hilbert series, machine learning, and applications to physics
• Getting CICY high
• Machine learning line bundle cohomologies of hypersurfaces in toric varieties
• Integer decomposition property of dilated polytopes
• Learning algebraic models of quantum entanglement

zbMATH Keywords

machine learningneural networkinteger decomposition propertyHilbert basis

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Cited In (1)

• Efficient prediction algorithms for binary decomposition techniques

This page was built for publication: Predicting the integer decomposition property via machine learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5195201)