Bar code for monomial ideals

DOI10.1016/j.jsc.2018.06.012zbMath1423.13104arXiv1701.01781OpenAlexW2900359373MaRDI QIDQ1994120

Michela Ceria

Publication date: 1 November 2018

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

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

zbMATH Keywords

integer partitionsdeterminantal formulas(strongly) stable idealspommaret basis

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (8)

Towards a Gröbner-free approach to coding ⋮ Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets ⋮ Recursive structures in involutive bases theory ⋮ A general framework for Noetherian well ordered polynomial reductions ⋮ Toward involutive bases over effective rings ⋮ HELP: a sparse error locator polynomial for BCH codes ⋮ Bar code: a visual representation for finite sets of terms and its applications ⋮ Degröbnerization: a political manifesto

Uses Software

• SINGULAR
• OEIS
• StronglyStableIdeals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the functoriality of marked families
• Term-ordering free involutive bases
• A criterion for detecting m-regularity
• Segments and Hilbert schemes of points
• Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
• Minimal resolutions of some monomial ideals
• Generating functions for shifted plane partitions
• \(p\)-Borel principal ideals
• De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
• 0-Borel fixed ideals
• Koszul cycles and Eliahou-Kervaire type resolutions
• Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
• A Borel open cover of the Hilbert scheme
• Flat families by strongly stable ideals and a generalization of Gröbner bases
• Generating functions for plane partitions of a given shape
• The lex game and some applications
• Vector space bases associated to vanishing ideals of points
• Algorithms for strongly stable ideals
• Solving Polynomial Equation Systems
• An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
• Upper bounds for the betti numbers of a given hilbert function
• Maximum betti numbers of homogeneous ideals with a given hilbert function
• Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
• Cutting corners

This page was built for publication: Bar code for monomial ideals