Gröbner bases of ideals defined by functionals with an application to ideals of projective points

DOI10.1007/BF01386834zbMath0785.13009OpenAlexW2079751279MaRDI QIDQ2366274

Maria Grazia Marinari, Hans-Michael Möller, Ferdinando Mora

Publication date: 29 June 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01386834

zbMATH Keywords

projective ideals computation of a Gröbner basis for 0-dimensional ideals Gröbner set Gröbner-basis for simple projective points

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

Computing PUR of zero-dimensional ideals of breadth at most one ⋮ FINITE SETS OF AFFINE POINTS WITH UNIQUE ASSOCIATED MONOMIAL ORDER QUOTIENT BASES ⋮ The structure of a second-degree \(D\)-invariant subspace and its application in ideal interpolation ⋮ The close relation between border and Pommaret marked bases ⋮ Finite sets of \(d\)-planes in affine space ⋮ A new framework for computing Gröbner bases ⋮ The Big Mother of all Dualities: Möller Algorithm ⋮ From algebraic sets to monomial linear bases by means of combinatorial algorithms ⋮ Border bases for lattice ideals ⋮ The big mother of all dualities. 2: Macaulay bases ⋮ الگوریتمی برای محاسبه ی ایده آل های مرتب نقاط و کاربردهای آن در مدل های زیست شناسی ⋮ Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis ⋮ Toric eigenvalue methods for solving sparse polynomial systems ⋮ Computing syzygies in finite dimension using fast linear algebra ⋮ A two-dimensional improvement for Farr-Gao algorithm ⋮ An algorithm for the discretization of an ideal projector ⋮ Towards a Gröbner-free approach to coding ⋮ An FGLM-like algorithm for computing the radical of a zero-dimensional ideal ⋮ The proper interpolation space for multivariate Birkhoff interpolation ⋮ Multiplication matrices and ideals of projective dimension zero ⋮ Computational aspects of retrieving a representation of an algebraic geometry code ⋮ The discretization for a special class of ideal projectors ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Maximal rank and minimal generation of some parametric varieties. ⋮ Gröbner bases, H–bases and interpolation ⋮ Stable monomial basis for multivariate Birkhoff interpolation problems ⋮ The multiplicity of zeros of algebraic system in eigenvalue method ⋮ A fast algorithm for the multivariate Birkhoff interpolation problem ⋮ Interpolation in list decoding of Reed-Solomon codes ⋮ List decoding of Reed-Solomon codes from a Gröbner basis perspective ⋮ An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms ⋮ Computing zero-dimensional schemes ⋮ Irreducible decomposition of polynomial ideals ⋮ On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals ⋮ Gröbner basis approach to list decoding of algebraic geometry codes ⋮ Fast amortized multi-point evaluation ⋮ Gröbner bases and generalized Padé approximation ⋮ Parametric FGLM algorithm ⋮ Some Combinatorial Applications of Gröbner Bases ⋮ A general framework for Noetherian well ordered polynomial reductions ⋮ Implicitization of a general union of parametric varieties ⋮ Deterministic normal position transformation and its applications ⋮ Multivariate polynomial system solving using intersections of eigenspaces. ⋮ Flat families by strongly stable ideals and a generalization of Gröbner bases ⋮ A bivariate preprocessing paradigm for the Buchberger-Möller algorithm ⋮ The Vanishing Ideal of a Finite Set of Points with Multiplicity Structures ⋮ Approximate computation of zero-dimensional polynomial ideals ⋮ The discretization for bivariate ideal interpolation ⋮ An algorithm for implicit interpolation ⋮ Newton basis for multivariate Birkhoff interpolation ⋮ On a Gröbner bases structure associated to linear codes ⋮ Noetherian operators and primary decomposition ⋮ Some properties of Borel ideals ⋮ Minimally generating ideals of rational parametric curves in polynomial time ⋮ Computing ideals of points ⋮ Computing Gröbner bases by FGLM techniques in a non-commutative setting ⋮ Degröbnerization: a political manifesto ⋮ Effective algorithm for computing Noetherian operators of zero-dimensional ideals ⋮ Co-generators for algebras over fields and commutative applications ⋮ A fast algorithm for multivariate Hermite interpolation ⋮ A characterization of stable and Borel ideals

Cites Work