<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-14T03:54:52Z</responseDate>
  <request identifier="288" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:288</identifier>
        <datestamp>2024-03-06T10:06:07Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>A dynamical solution of Kronecker's problem</dc:title>
          <dc:creator>Yengui, Ihsen</dc:creator>
          <dc:subject>Dynamical GrÃƒÂ¶bner basis</dc:subject>
          <dc:subject>ideal membership problem</dc:subject>
          <dc:subject>principal domains</dc:subject>
          <dc:description>In this paper,&#13;
I present a new   decision procedure for the ideal&#13;
membership problem for polynomial rings over principal domains&#13;
using discrete valuation domains. As a particular case, I solve a&#13;
fundamental algorithmic question in the theory of multivariate&#13;
polynomials over the integers called ``Kronecker's problem", that&#13;
is the problem of finding a decision procedure for the ideal&#13;
membership problem for $mathbb{Z}[X_1,ldots, X_n]$. The&#13;
techniques utilized are easily generalizable to Dedekind domains.&#13;
In order to avoid the expensive complete factorization in the&#13;
basic principal ring, I introduce the notion of ``dynamical&#13;
Gr"obner bases" of polynomial ideals over a principal domain. As&#13;
application, I  give an alternative dynamical solution to&#13;
``Kronecker's problem".</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Ihsen Yengui</dc:contributor>
          <dc:date>2006</dc:date>
          <dc:relation>Is Part Of Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/DagSemProc.05021.3</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-2889</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.3</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
