Grobner Basis Approach to Some Combinatorial Problems
We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the \GB of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express different conditions in rather compact way.
Main Author: | Victor Ufnarovski |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2012-10-01
|
Series: | Computer Science Journal of Moldova |
Subjects: | |
Online Access: | http://www.math.md/files/csjm/v20-n3/v20-n3-(pp304-312).pdf |
Similar Items
-
Gröbner Basis Cryptanalysis of Ciminion and Hydra
by: Matthias Johann Steiner
Published: (2025-03-01) -
Algorithms for computing Gröbner bases of ideal interpolation
by: Xue Jiang, et al.
Published: (2024-06-01) -
Some improvements for the algorithm of Gröbner bases over dual valuation domain
by: Licui Zheng, et al.
Published: (2023-05-01) -
An introduction to Grobner bases /
by: 172017 Adams, William W., et al.
Published: (1994) -
Arf numerical semigroups with high multiplicity via Gröbner basis
by: Belgin Özer
Published: (2023-12-01)