From algebraic sets to monomial linear bases by means of combinatorial algorithms
From MaRDI portal
Publication:1893979
DOI10.1016/0012-365X(94)00126-4zbMath0834.13019MaRDI QIDQ1893979
Marina Mureddu, Luigi Cerlienco
Publication date: 14 April 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Combinatorics in computer science (68R05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (21)
FINITE SETS OF AFFINE POINTS WITH UNIQUE ASSOCIATED MONOMIAL ORDER QUOTIENT BASES ⋮ On the unique minimal monomial basis of Birkhoff interpolation problem ⋮ The big mother of all dualities. 2: Macaulay bases ⋮ Vector space bases associated to vanishing ideals of points ⋮ An algorithm for the discretization of an ideal projector ⋮ Towards a Gröbner-free approach to coding ⋮ Applications of bar code to involutive divisions and a ``greedy algorithm for complete sets ⋮ Stable monomial basis for multivariate Birkhoff interpolation problems ⋮ A fast algorithm for the multivariate Birkhoff interpolation problem ⋮ The lex game and some applications ⋮ Expected term bases for generic multivariate Hermite interpolation ⋮ 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 Vanishing Ideal of a Finite Set of Points with Multiplicity Structures ⋮ The discretization for bivariate ideal interpolation ⋮ HELP: a sparse error locator polynomial for BCH codes ⋮ Bar code: a visual representation for finite sets of terms and its applications ⋮ Multivariate interpolation and standard bases for Macaulay modules ⋮ Degröbnerization: a political manifesto ⋮ Boolean ideals and their varieties ⋮ A fast algorithm for multivariate Hermite interpolation
Cites Work
This page was built for publication: From algebraic sets to monomial linear bases by means of combinatorial algorithms
