Graobner Basis Approach to Some Combinatorial Problems
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
394 3
Ultima descărcare din IBN:
2017-04-27 21:52
Căutarea după subiecte
similare conform CZU
512.7+519.6 (3)
Algebră (233)
Matematică computațională. Analiză numerică. Programarea calculatoarelor (62)
SM ISO690:2012
UFNAROVSKI, Victor. Graobner Basis Approach to Some Combinatorial Problems. In: Computer Science Journal of Moldova. 2012, nr. 3(60), pp. 304-312. ISSN 1561-4042.
EXPORT metadate:
Google Scholar
Crossref
CERIF
BibTeX
DataCite
Dublin Core
Computer Science Journal of Moldova
Numărul 3(60) / 2012 / ISSN 1561-4042

Graobner Basis Approach to Some Combinatorial Problems

CZU: 512.7+519.6
Pag. 304-312

Ufnarovski Victor
 
Lund University, Sweden
 
Disponibil în IBN: 14 decembrie 2013


Rezumat

We consider several simple combinatorial problems and discuss diferent ways to express them using polynomial equations and try to describe the GrÄobner basis of the corresponding ideals.The main instruments are complete symmetric polynomials that help to express diferent conditions in rather compact way.

Cuvinte-cheie
Grobner basis, zero-dimensional ideal, finite configuration, complete symmetric polynomials.