Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
Résumé
Gröbner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases, the polynomial systems coming from applications have some kind of structure. For example , several problems in computer-aided design, robotics, vision, biology , kinematics, cryptography, and optimization involve sparse systems where the input polynomials have a few non-zero terms. Our approach to exploit sparsity is to embed the systems in a semigroup algebra and to compute Gröbner bases over this algebra. Up to now, the algorithms that follow this approach benefit from the sparsity only in the case where all the polynomials have the same sparsity structure, that is the same Newton polytope. We introduce the first algorithm that overcomes this restriction. Under regularity assumptions, it performs no redundant computations. Further, we extend this algorithm to compute Gröbner basis in the standard algebra and solve sparse polynomials systems over the torus $(C^*)^n$. The complexity of the algorithm depends on the Newton polytopes.
Fichier principal
sparseF5.pdf (298.99 Ko)
Télécharger le fichier
ACM-Reference-Format.bbx (17.99 Ko)
Télécharger le fichier
ACM-Reference-Format.cbx (100 B)
Télécharger le fichier
ACM-Reference-Format.dbx (647 B)
Télécharger le fichier
acmart.dtx (214.71 Ko)
Télécharger le fichier
acmart.ins (1016 B)
Télécharger le fichier
makefile (1.1 Ko)
Télécharger le fichier
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...