From algebraic sets to monomial linear bases by means of combinatorial algorithms

DOI10.1016/0012-365X(94)00126-4MaRDI QIDQ1893979zbMATH OpenFDO

Authors Luigi Cerlienco, Marina Mureddu

Publication date 14 April 1996

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ferrers diagramalgebraic multisetminimal monomial linear baseGröbner basis

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Recommendations

• scientific article; zbMATH DE number 3876580
• Some combinatorial applications of Gröbner bases
• Some meeting points of Gröbner bases and combinatorics
• The vanishing ideal of a finite set of closed points in affine space
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points

Cites work

• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• scientific article; zbMATH DE number 3941661 (Why is no real title available?)
• scientific article; zbMATH DE number 108068 (Why is no real title available?)
• scientific article; zbMATH DE number 3288410 (Why is no real title available?)
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• On the continuous dual of a polynomial bialgebra

Cited in

(21)

• The lex game and some applications
• Finite sets of affine points with unique associated monomial order quotient bases
• Vector space bases associated to vanishing ideals of points
• Towards a Gröbner-free approach to coding
• An algorithm for the discretization of an ideal projector
• The vanishing ideal of a finite set of points with multiplicity structures
• Boolean ideals and their varieties
• On the existence of certain error formulas for a special class of ideal projectors
• A bivariate preprocessing paradigm for the Buchberger-Möller algorithm
• The discretization for bivariate ideal interpolation
• On the unique minimal monomial basis of Birkhoff interpolation problem
• Stable monomial basis for multivariate Birkhoff interpolation problems
• A fast algorithm for the multivariate Birkhoff interpolation problem
• Expected term bases for generic multivariate Hermite interpolation
• HELP: a sparse error locator polynomial for BCH codes
• The big mother of all dualities. 2: Macaulay bases
• A fast algorithm for multivariate Hermite interpolation
• 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
• Degröbnerization: a political manifesto
• Multivariate interpolation and standard bases for Macaulay modules

This page was built for publication: From algebraic sets to monomial linear bases by means of combinatorial algorithms

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