A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms

We present a generic and executable formalization of signature-based algorithms (such as Faugère's \(F_5\)) for computing Gr\"obner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are currently the best known algorithms for computing Gr...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Author: Maletzky, Alexander
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 03.12.2020
Subjects:
Algorithms
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract We present a generic and executable formalization of signature-based algorithms (such as Faugère's \(F_5\)) for computing Gr\"obner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are currently the best known algorithms for computing Gr\"obner bases in terms of computational efficiency. The formal development attempts to be as generic as possible, generalizing most known variants of signature-based algorithms, but at the same time the implemented functions are effectively executable on concrete input for efficiently computing mechanically verified Gr\"obner bases. Besides correctness the formalization also proves that under certain conditions the algorithms a-priori detect and avoid all useless reductions to zero, and return minimal signature Gr\"obner bases. To the best of our knowledge, the formalization presented here is the only formalization of signature-based Gr\"obner basis algorithms in existence so far.
AbstractList We present a generic and executable formalization of signature-based algorithms (such as Faugère's \(F_5\)) for computing Gr\"obner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are currently the best known algorithms for computing Gr\"obner bases in terms of computational efficiency. The formal development attempts to be as generic as possible, generalizing most known variants of signature-based algorithms, but at the same time the implemented functions are effectively executable on concrete input for efficiently computing mechanically verified Gr\"obner bases. Besides correctness the formalization also proves that under certain conditions the algorithms a-priori detect and avoid all useless reductions to zero, and return minimal signature Gr\"obner bases. To the best of our knowledge, the formalization presented here is the only formalization of signature-based Gr\"obner basis algorithms in existence so far.
Author Maletzky, Alexander
Author_xml – sequence: 1
  givenname: Alexander
  surname: Maletzky
  fullname: Maletzky, Alexander
BookMark eNotjcFKAzEURYMoWGs_wF3A9dTMyyTTLGtpq1Bw0e7LSyapKdNEkxkpfpg_4I91QFeXe-Cee0euQwyWkIeSTauZEOwJ09l_TYGVMGUAXF2REXBeFrMK4JZMcj4yxkDWIAQfke2crm2wyRuKoaHLszV9h7q1dBXTCVv_jZ2PgUZHt_4QsOuTLZ4x24au0--PHqZ0qD7TeXuIyXfvp3xPbhy22U7-c0x2q-Vu8VJs3tavi_mmQAGyMI2R0gnuNGu0AYZKmJmzqLStXa1q1KUpgQmGWqEVCkqtpAQUxjUDZHxMHv-0Hyl-9jZ3-2PsUxge91DJumaKVZJfAHf-VJ8
ContentType Paper
Copyright 2020. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2020. This work is published under http://creativecommons.org/licenses/by-nc-nd/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2012.02239
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database (ProQuest)
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a526-cdc66f53fb0dbc20a95c8fea9be7f797ab1c12050ab9ae5921b9662a5cfd50a03
IEDL.DBID M7S
IngestDate Mon Jun 30 09:18:19 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a526-cdc66f53fb0dbc20a95c8fea9be7f797ab1c12050ab9ae5921b9662a5cfd50a03
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2467709046?pq-origsite=%requestingapplication%
PQID 2467709046
PQPubID 2050157
ParticipantIDs proquest_journals_2467709046
PublicationCentury 2000
PublicationDate 20201203
PublicationDateYYYYMMDD 2020-12-03
PublicationDate_xml – month: 12
  year: 2020
  text: 20201203
  day: 03
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2020
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.7420125
SecondaryResourceType preprint
Snippet We present a generic and executable formalization of signature-based algorithms (such as Faugère's \(F_5\)) for computing Gr\"obner bases, as well as their...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Title A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms
URI https://www.proquest.com/docview/2467709046
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELWAgsSJXSyl8oGraeLUcX1CLWoBCaqI9lBOlVeIVNqSFMSX8QP8GOM0hQMSF46OlcSy5XmzvJlB6MxZgA0uNHGgWxO4iYwoaULiZFMKqiyzpkgUvuW9XnM4FEnpcMtLWuVSJhaC2ky195HXKXyHBwLMuYvZC_Fdo3x0tWyhsYoqvkpCWFD3-t8-Fhpz0JijRTCzKN1Vl9l7-uYZXfQc0CsSv0RwgSvdrf-uaBtVEjmz2Q5asZNdtFHwOXW-h_otXBSUTjWWE4M771a_zn2WFO56JXVcZl_iqcP99HFR3ZO0AdEMvso-PxS8imGY5rg1foSfzp-e83006HYGl9ek7J9AJKMx0UbHsWORU4FRmgZSMN10VgplueOCSxXqkAYskEpIywQNFdg-VDLtDDwMogO0NplO7CHCsRGRY9wwMM4a0kgJSkfAY6F1A_BdR0eoutyiUXkH8tHP_hz_PX2CNqm3Yj1JJKqitXn2ak_Run6bp3lWQ5V2p5fc14qjhVFyc5c8fAET5LDo
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V25TgMxEB1xCipuceMCSsPGi9dxgRBXABEipKSgi3yGlSCB3XB9FC0_wI8x3iRQINFRUK5XtmSPPfPGfjMDsOkdmg0hDfWIrSmeRE61siXqVVlJph13tggUroparXx9La-G4G0QCxNolQOdWChq2zHhjnyH4TgikujO7d8_0FA1KryuDkpo9LbFhXt9Rpct3zs_RvluMVY5aRyd0X5VAao4S6ixJkk8j72OrDYsUpKbsndKaie8kELpkimxiEdKS-W4ZCWNHgFT3HiLjVGMww7DKKIIJgumYP3rSoclAgF63Hs7LTKF7ajsJX0KBDK2jcYylj80fmHGKlP_bAGmYfRK3btsBoZcexbGC7aqyeegfkCKdNmpIaptycmLM4_dEANGKgGC3_ZjS0nHk3ra6uUupYdory05zT7eNXYl-Jnm5OC2hXPs3tzl89D4i2kswEi703aLQBIrY8-F5eh67iqrFEKqSCTSmF1ELyZegtWBRJr9E543v8Wx_PvvDZg4a1xWm9Xz2sUKTLLgrwc6TLwKI93s0a3BmHnqpnm2XuwmAs0_Ft4nvFMMHA
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Generic+and+Executable+Formalization+of+Signature-Based+Gr%C3%B6bner+Basis+Algorithms&rft.jtitle=arXiv.org&rft.au=Maletzky%2C+Alexander&rft.date=2020-12-03&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2012.02239