Scholarlink

<p>We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety <i>V</i> defined over a perfect field <i>k</i>. The variety <i>V</i> is the Zariski closure of the set of common zeros <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\{F_1=0,\ldots ,F_r=0,G\not =0\}\)</EquationSource> </InlineEquation> of multivariate polynomials <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(F_1,\ldots ,F_r\in k[X_1,\ldots ,X_n]\)</EquationSource> </InlineEquation> outside a prescribed hypersurface <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\{G=0\}\)</EquationSource> </InlineEquation>. We assume that <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(F_1,\ldots ,F_r\)</EquationSource> </InlineEquation> satisfy natural geometric conditions, such as regularity and radicality, in the localization <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(k[X_1,\ldots ,X_n]_G\)</EquationSource> </InlineEquation>. Our approach combines homotopic deformation techniques with symbolic Newton–Hensel lifting and elimination. We discuss the concept of lifting curves as intermediate geometric objects that enable efficient computation.</p><p>The complexity of the algorithm is expressed in terms of the degrees and arithmetic size of the input and achieves soft-quadratic complexity in these parameters. We provide detailed complexity analyses for arbitrary perfect fields, as well as for two important cases in computer algebra: finite fields and the field of rational numbers. For each case, we obtain sharp bounds on the size of the base field or required primes.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A Kronecker algorithm for locally closed sets over a perfect field

  • 期刊论文

  • 发表日期：

    2026年3月1日

查看全文
  • Nardo Giménez,
  • Joos Heintz,
  • Guillermo Matera,
  • Luis Miguel Pardo,
  • Mariana Pérez,
  • Melina Privitelli

摘要

We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety V defined over a perfect field k. The variety V is the Zariski closure of the set of common zeros \(\{F_1=0,\ldots ,F_r=0,G\not =0\}\) of multivariate polynomials \(F_1,\ldots ,F_r\in k[X_1,\ldots ,X_n]\) outside a prescribed hypersurface \(\{G=0\}\) . We assume that \(F_1,\ldots ,F_r\) satisfy natural geometric conditions, such as regularity and radicality, in the localization \(k[X_1,\ldots ,X_n]_G\) . Our approach combines homotopic deformation techniques with symbolic Newton–Hensel lifting and elimination. We discuss the concept of lifting curves as intermediate geometric objects that enable efficient computation.

The complexity of the algorithm is expressed in terms of the degrees and arithmetic size of the input and achieves soft-quadratic complexity in these parameters. We provide detailed complexity analyses for arbitrary perfect fields, as well as for two important cases in computer algebra: finite fields and the field of rational numbers. For each case, we obtain sharp bounds on the size of the base field or required primes.