A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions

DOI10.37236/10862zbMath1492.05156arXiv2105.05292OpenAlexW3163469492MaRDI QIDQ2153399

A. J. Bu

Publication date: 4 July 2022

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2105.05292

zbMATH Keywords

homogeneous symmetric polynomialMaple functions

Mathematics Subject Classification ID

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

Uses Software

• Maple

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial proof of Newton's identities
• On the Gröbner bases of some symmetric systems and their application to coding theory.
• Ordered set partitions, generalized coinvariant algebras, and the delta conjecture
• Invariants of Finite Groups Generated by Reflections
• Algorithms in invariant theory

This page was built for publication: A combinatorial approach to the Groebner bases for ideals generated by elementary symmetric functions