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

DOI10.1134/S0361768809020030zbMath1185.68875OpenAlexW2045608916MaRDI QIDQ840089

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

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)

Uses Software

• Gfan

Cites Work

• Unnamed Item
• 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 Note on Solid Partitions
• A Convergent Series for the Partition Function p ( n )

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