On FGLM Algorithms with Tate Algebras
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Centre National de la Recherche Scientifique [CNRS] | |
| hal.structure.identifier | Lithe and fast algorithmic number theory [LFANT] | |
| dc.contributor.author | CARUSO, Xavier | |
| hal.structure.identifier | XLIM [XLIM] | |
| dc.contributor.author | VACCON, Tristan | |
| hal.structure.identifier | University of Linz - Johannes Kepler Universität Linz [JKU] | |
| dc.contributor.author | VERRON, Thibaut | |
| dc.contributor.editor | Frédéric Chyzak, George Labahn and Marc Mezzarobba | |
| dc.date.accessioned | 2024-04-04T02:47:26Z | |
| dc.date.available | 2024-04-04T02:47:26Z | |
| dc.date.conference | 2021-07-18 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/191638 | |
| dc.description.abstractEn | Tate introduced in [Ta71] the notion of Tate algebras to serve, in the context of analytic geometry over the-adics, as a counterpart of polynomial algebras in classical algebraic geometry. In [CVV19, CVV20] the formalism of Gröbner bases over Tate algebras has been introduced and advanced signature-based algorithms have been proposed. In the present article, we extend the FGLM algorithm of [FGLM93] to Tate algebras. Beyond allowing for fast change of ordering, this strategy has two other important benefits. First, it provides an efficient algorithm for changing the radii of convergence which, in particular, makes effective the bridge between the polynomial setting and the Tate setting and may help in speeding up the computation of Gröbner basis over Tate algebras. Second, it gives the foundations for designing a fast algorithm for interreduction, which could serve as basic primitive in our previous algorithms and accelerate them significantly. | |
| dc.description.sponsorship | Correspondance de Langlands p-adique : une approche constructive et algorithmique - ANR-18-CE40-0026 | |
| dc.language.iso | en | |
| dc.publisher | ACM | |
| dc.subject.en | Algorithms | |
| dc.subject.en | Gröbner bases | |
| dc.subject.en | Tate algebra | |
| dc.subject.en | FGLM algorithm | |
| dc.subject.en | p-adic precision | |
| dc.title.en | On FGLM Algorithms with Tate Algebras | |
| dc.type | Communication dans un congrès | |
| dc.subject.hal | Informatique [cs]/Calcul formel [cs.SC] | |
| dc.identifier.arxiv | 2102.05324 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.conference.title | International Symposium on Symbolic and Algebraic Computation — ISSAC 2021 | |
| bordeaux.country | RU | |
| bordeaux.conference.city | Virtual event | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-03133590 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.conference.end | 2021-07-23 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-03133590v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.au=CARUSO,%20Xavier&VACCON,%20Tristan&VERRON,%20Thibaut&rft.genre=unknown |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||