Given a finite set of terms U in n variables, we describe an algorithm which finds - if it exists - an ordering on the variables such that U is a complete set according to Janet involutive division. The algorithm, based on Bar Codes for monomial ideals, is able to adjust the variables ordering with a sort of backtracking technique, thus allowing to find the desired ordering without trying all the n! possible ones.
Applications of Bar Code to Involutive Divisions and a “Greedy” Algorithm for Complete Sets / Ceria, Michela. - In: MATHEMATICS IN COMPUTER SCIENCE. - ISSN 1661-8270. - STAMPA. - 16:4(2022). [10.1007/s11786-022-00548-1]
Applications of Bar Code to Involutive Divisions and a “Greedy” Algorithm for Complete Sets
Michela Ceria
2022-01-01
Abstract
Given a finite set of terms U in n variables, we describe an algorithm which finds - if it exists - an ordering on the variables such that U is a complete set according to Janet involutive division. The algorithm, based on Bar Codes for monomial ideals, is able to adjust the variables ordering with a sort of backtracking technique, thus allowing to find the desired ordering without trying all the n! possible ones.| File | Dimensione | Formato | |
|---|---|---|---|
|
2022_Applications_of_Bar_Code_to_involutive_divisions_preprint.pdf
accesso aperto
Descrizione: Preprint
Tipologia:
Documento in Pre-print
Licenza:
Tutti i diritti riservati
Dimensione
152.44 kB
Formato
Adobe PDF
|
152.44 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
