The Big Mother of all Dualities: Möller Algorithm

DOI10.1081/AGB-120017343MaRDI QIDQ4801395zbMATH OpenOpenAlexFDO

Authors Maria Grazia Marinari, M. E. Alonso, Ferdinando Mora

Publication date 7 April 2003

Published in Communications in Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1081/agb-120017343

zbMATH Keywords

dualityGröbner baseMöller algorithmpoint-evaluation of commutative polynomials

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Commutative Artinian rings and modules, finite-dimensional algebras (13E10) Polynomials and finite commutative rings (13M10)

Recommendations

• Some algorithms based on the dual of Dilworth's theorem
• The big mother of all dualities. 2: Macaulay bases
• On the complexity of the dualization problem
• The optimality of Moore-Hodgson algorithm
• The duoplex-algorithm
• Asymptotically optimal dualization algorithms
• The dual Kaczmarz algorithm
• scientific article; zbMATH DE number 2128136
• The computational complexity of duality
• scientific article; zbMATH DE number 1254265

Cites work

• scientific article; zbMATH DE number 3876580 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases (F₄)
• An algorithm for the construction of matrix representations for finitely presented non-commutative algebras
• An introduction to commutative and noncommutative Gröbner bases
• Computation of minimal generators of ideals of fat points
• Computing Gröbner bases by FGLM techniques in a non-commutative setting
• Computing ideals of points
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Gröbner bases of ideals defined by functionals with an application to ideals of projective points
• Ideal basis and primary decompositions: case of two variables
• Isolated points, duality and residues
• Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems
• On multiplicities in polynomial system solving

Cited in

(10)

• Gröbner basis approach to list decoding of algebraic geometry codes
• The vanishing ideal of a finite set of closed points in affine space
• Finite sets of d-planes in affine space
• On inverse systems and squarefree decomposition of zero-dimensional polynomial ideals
• On the Gröbner bases of some symmetric systems and their application to coding theory.
• An FGLM-like algorithm for computing the radical of a zero-dimensional ideal
• Oracle-supported drawing of the Gröbner \textit{escalier}
• The big mother of all dualities. 2: Macaulay bases
• Computing syzygies in finite dimension using fast linear algebra
• Eliminating dual spaces

Describes a project that uses

Uses Software

• FGb

This page was built for publication: The Big Mother of all Dualities: Möller Algorithm

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