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.

Bibliographic Details
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
_version_ 1828741666736963584
author Victor Ufnarovski
author_facet Victor Ufnarovski
author_sort Victor Ufnarovski
collection DOAJ
description 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.
first_indexed 2024-04-13T01:04:11Z
format Article
id doaj.art-44c41c8cdb8a44529655ab43e5e9e3b1
institution Directory Open Access Journal
issn 1561-4042
language English
last_indexed 2024-04-13T01:04:11Z
publishDate 2012-10-01
publisher Vladimir Andrunachievici Institute of Mathematics and Computer Science
record_format Article
series Computer Science Journal of Moldova
spelling doaj.art-44c41c8cdb8a44529655ab43e5e9e3b12022-12-22T03:09:23ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422012-10-01203(60)304312Grobner Basis Approach to Some Combinatorial ProblemsVictor Ufnarovski0Centre for Mathematical Sciences, Mathematics, Lund University, LTH P.O. Box 118, SE-22100, Lund, SwedenWe 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.http://www.math.md/files/csjm/v20-n3/v20-n3-(pp304-312).pdfzero-dimensional idealfinite configurationGrobner basiscomplete symmetric polynomials
spellingShingle Victor Ufnarovski
Grobner Basis Approach to Some Combinatorial Problems
Computer Science Journal of Moldova
zero-dimensional ideal
finite configuration
Grobner basis
complete symmetric polynomials
title Grobner Basis Approach to Some Combinatorial Problems
title_full Grobner Basis Approach to Some Combinatorial Problems
title_fullStr Grobner Basis Approach to Some Combinatorial Problems
title_full_unstemmed Grobner Basis Approach to Some Combinatorial Problems
title_short Grobner Basis Approach to Some Combinatorial Problems
title_sort grobner basis approach to some combinatorial problems
topic zero-dimensional ideal
finite configuration
Grobner basis
complete symmetric polynomials
url http://www.math.md/files/csjm/v20-n3/v20-n3-(pp304-312).pdf
work_keys_str_mv AT victorufnarovski grobnerbasisapproachtosomecombinatorialproblems