<?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-08-10T13:32:00Z</responseDate>
  <request identifier="278" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:278</identifier>
        <datestamp>2024-03-06T11: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 Nilregular Element Property</dc:title>
          <dc:creator>Coquand, Thierry</dc:creator>
          <dc:creator>Lombardi, Henri</dc:creator>
          <dc:creator>Schuster, Peter</dc:creator>
          <dc:subject>Lists of generators</dc:subject>
          <dc:subject>polynomial ideals</dc:subject>
          <dc:subject>Krull dimension</dc:subject>
          <dc:subject>Zariski topology</dc:subject>
          <dc:subject>commutative Noetherian rings</dc:subject>
          <dc:subject>constructive algebra</dc:subject>
          <dc:description>An element or an ideal of a commutative ring is nilregular if and only if &#13;
it is regular modulo the nilradical. We prove that if the ring is &#13;
Noetherian, then every nilregular ideal contains a nilregular element. In&#13;
constructive mathematics, this proof can then be seen as an algorithm to&#13;
produce nilregular elements of nilregular ideals whenever the ring is coherent,&#13;
Noetherian, and discrete. As an application, we give a constructive proof of&#13;
the Eisenbud--Evans--Storch theorem that every algebraic set in &#13;
$n$--dimensional affine space is the intersection of $n$ hypersurfaces. &#13;
The input of the algorithm is an arbitrary finite list of polynomials, &#13;
which need not arrive in a special form such as a Gr"obner basis. &#13;
We dispense with prime ideals when defining concepts or carrying out proofs.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Thierry Coquand and Henri Lombardi and Peter Schuster</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.4</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-2784</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.4</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>
