RO EN
Gröbner Basis Approach to Some Combinatorial Problems
Authors: V. Ufnarovski
Keywords: Gröbner basis, zero-dimensional ideal, finite configuration, complete symmetric polynomials.
– 0.14 Mb
Keywords: Gröbner basis, zero-dimensional ideal, finite configuration, complete symmetric polynomials.
Abstract
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.Centre for Mathematical Sciences, Mathematics,
Lund University, LTH
P.O. Box 118, SE-22100, Lund, Sweden
E-mail:
Lund University, LTH
P.O. Box 118, SE-22100, Lund, Sweden
E-mail:
Fulltext
– 0.14 Mb
Contents
- Toward the Soundness of Sense Structure Definitions in Thesaurus-Dictionaries. Parsing Problems and Solutions*
- Gröbner Basis Approach to Some Combinatorial Problems
- References and arrow notation instead of join operation in query languages
- Basics of Intensionalized Data: Presets, Sets, and Nominats
- P systems based on tag operations
- Static and Dynamic Membrane Structures
- Abstracts of Doctor Habilitatus Thesis
