Bar code for monomial ideals

DOI10.1016/J.JSC.2018.06.012MaRDI QIDQ1994120zbMATH OpenOpenAlexFDO

Authors 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, http://hdl.handle.net/2434/608279

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)

Abstract: Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite set of terms $M$ and allowing to desume many properties of the corresponding monomial ideal $I$, if $M$ is an order ideal. Then, we use it to give a connection between (strongly) stable monomial ideals and integer partitions, thus allowing to count them via known determinantal formulas.

Recommendations

• Strongly stable ideals and Hilbert polynomials
• Bar code: a visual representation for finite sets of terms and its applications
• Algorithms for strongly stable ideals
• Monomial ideals and \(n\)-lists
• Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial

Cites work

• scientific article; zbMATH DE number 3651027 (Why is no real title available?)
• scientific article; zbMATH DE number 4214181 (Why is no real title available?)
• scientific article; zbMATH DE number 4076472 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3465689 (Why is no real title available?)
• scientific article; zbMATH DE number 1222942 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 2024859 (Why is no real title available?)
• scientific article; zbMATH DE number 2166957 (Why is no real title available?)
• scientific article; zbMATH DE number 3373899 (Why is no real title available?)
• 0-Borel fixed ideals
• A Borel open cover of the Hilbert scheme
• A criterion for detecting m-regularity
• A proof of the ``Axis of Evil Theorem for distinct points
• Algorithms for strongly stable ideals
• An efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
• Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
• Cutting corners
• De nugis Groebnerialium. II: Applying Macaulay's trick in order to easily write a Gröbner basis
• Flat families by strongly stable ideals and a generalization of Gröbner bases
• Generating functions for plane partitions of a given shape
• Generating functions for shifted plane partitions
• Koszul cycles and Eliahou-Kervaire type resolutions
• Maximum betti numbers of homogeneous ideals with a given hilbert function
• Minimal resolutions of some monomial ideals
• On the functoriality of marked families
• Quasi-stable ideals and Borel-fixed ideals with a given Hilbert polynomial
• Segments and Hilbert schemes of points
• Solving polynomial equation systems. Vol. IV. Buchberger theory and beyond
• Term-ordering free involutive bases
• The lex game and some applications
• Upgraded methods for the effective computation of marked schemes on a strongly stable ideal
• Upper bounds for the betti numbers of a given hilbert function
• Vector space bases associated to vanishing ideals of points
• \(p\)-Borel principal ideals

Cited in

(11)

• Strongly stable ideals and Hilbert polynomials
• Towards a Gröbner-free approach to coding
• Toward involutive bases over effective rings
• Recursive structures in involutive bases theory
• Oracle-supported drawing of the Gröbner \textit{escalier}
• HELP: a sparse error locator polynomial for BCH codes
• Bar code and Janet-like division
• Bar code: a visual representation for finite sets of terms and its applications
• Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets
• A general framework for Noetherian well ordered polynomial reductions
• Degröbnerization: a political manifesto

Describes a project that uses

Uses Software

• StronglyStableIdeals
• OEIS
• SINGULAR

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1994120)