License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-2889
URL: http://drops.dagstuhl.de/opus/volltexte/2006/288/

Yengui, Ihsen

A dynamical solution of Kronecker's problem

pdf-format:
Dokument 1.pdf (232 KB)


Abstract

In this paper, I present a new decision procedure for the ideal membership problem for polynomial rings over principal domains using discrete valuation domains. As a particular case, I solve a fundamental algorithmic question in the theory of multivariate polynomials over the integers called ``Kronecker's problem", that is the problem of finding a decision procedure for the ideal membership problem for $mathbb{Z}[X_1,ldots, X_n]$. The techniques utilized are easily generalizable to Dedekind domains. In order to avoid the expensive complete factorization in the basic principal ring, I introduce the notion of ``dynamical Gr"obner bases" of polynomial ideals over a principal domain. As application, I give an alternative dynamical solution to ``Kronecker's problem".

BibTeX - Entry

@InProceedings{yengui:DSP:2006:288,
  author =	{Ihsen Yengui},
  title =	{A dynamical solution of Kronecker's problem},
  booktitle =	{Mathematics, Algorithms, Proofs},
  year =	{2006},
  editor =	{Thierry Coquand and Henri Lombardi and Marie-Fran{\c{c}}oise Roy},
  number =	{05021},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2006/288},
  annote =	{Keywords: Dynamical Gr{\"o}bner basis, ideal membership problem, principal domains}
}

Keywords: Dynamical Gröbner basis, ideal membership problem, principal domains
Seminar: 05021 - Mathematics, Algorithms, Proofs
Issue date: 2006
Date of publication: 16.01.2006


DROPS-Home | Fulltext Search | Imprint Published by LZI