Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets

DOI10.1007/s11786-022-00548-1arXiv1910.02802OpenAlexW2978224982MaRDI QIDQ6157639

Michela Ceria

Publication date: 22 June 2023

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

completenessbar codesjanet division

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (3)

Towards a Gröbner-free approach to coding ⋮ Recursive structures in involutive bases theory ⋮ Bar code: a visual representation for finite sets of terms and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Term-ordering free involutive bases
• Bar code: a visual representation for finite sets of terms and its applications
• Involutive bases of polynomial ideals
• Minimal involutive bases
• Multivariate interpolation and standard bases for Macaulay modules
• From algebraic sets to monomial linear bases by means of combinatorial algorithms
• Bar code for monomial ideals
• The lex game and some applications
• Über die Deformation isolierter Singularitäten analytischer Mengen
• Involutive Division Generated by an Antigraded Monomial Ordering
• A Survey on Stanley Depth
• Computer Algebra in Scientific Computing
• Computer Algebra in Scientific Computing
• Lectures on Curves on an Algebraic Surface. (AM-59)

This page was built for publication: Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets