Sammanfattning
We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the Gröbner basis of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express different conditions in rather compact way.
Originalspråk | engelska |
---|---|
Sidor (från-till) | 304-312 |
Tidskrift | Computer Science Journal of Moldova |
Volym | 60 |
Nummer | 3 |
Status | Published - 2012 |
Ämnesklassifikation (UKÄ)
- Matematik