<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=50457"><dc:title>On Groebner bases and their use in solving some practical problems</dc:title><dc:creator>Mencinger,	Matej	(Avtor)
	</dc:creator><dc:subject>polynomial system of (differential) equations</dc:subject><dc:subject>integer linear programming</dc:subject><dc:subject>chromatic number of a graph</dc:subject><dc:subject>polynomial rings</dc:subject><dc:subject>Groebner basis</dc:subject><dc:subject>CAS systems</dc:subject><dc:subject/><dc:description>Groebner basis are an important theoretical building block of modern (polynomial) ring theory. The origin of Groebner basis theory goes back to solving some theoretical problems concerning the ideals in polynomial rings, as well as solving polynomial systems of equations. In this article four practical applications of Groebner basis theory are considered; we use Groebner basis to solve the systems of nonlinear polynomial equations, to solve an integer programming problem, to solve the problem of chromatic number of a graph, and finally we consider an original example from the theory of systems of ordinary (polynomial) differential equations. For practical computations we use systems MATHEMATICA and SINGULAR .</dc:description><dc:date>2013</dc:date><dc:date>2015-07-10 12:40:10</dc:date><dc:type>Delo ni kategorizirano</dc:type><dc:identifier>50457</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
