Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases

DOI10.1134/S0361768809020030zbMATH Open1185.68875OpenAlexW2045608916MaRDI QIDQ840089FDOQ840089

Authors: N. E. Zubov 

Publication date: 4 September 2009

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768809020030

Recommendations

• The Gröbner fan of an ideal
• A combinatorial result on Gröbner fans with an application to universal Gröbner bases
• scientific article; zbMATH DE number 736946
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Admissible term orderings used in computer algebra systems

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Reverse search for enumeration
• Gröbner bases with respect to generalized term orders and their application to the modelling problem
• A Convergent Series for the Partition Function p ( n )
• A Note on Solid Partitions

Cited In (5)

• Combinatorial aspects of total weight orders over monomials of fixed degree
• Title not available (Why is that?)
• Monomial orderings, rewriting systems, and Gröbner bases for the commutator ideal of a free algebra
• Monomial bases related to the \(n!\) conjecture
• Elimination orderings in \(\mathbb{Z}^n\).

Uses Software

• Gfan

This page was built for publication: Enumeration of finite monomial orderings and combinatorics of universal Gröbner bases

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