Search arXiv⌕ Search

arXiv · math/0702430

Approximate radical for clusters: a global approach using Gaussian elimination or SVD

Abstract

We present a method based on Dickson's lemma to compute the "approximate radical" of a zero dimensional ideal I in C[x1, . . ., xm] which has zero clusters: the approximate radical ideal has exactly one root in each cluster for sufficiently small clusters. Our method is "global" in the sense that it does not require any local approximation of the zero clusters: it reduces the problem to the computation of the numerical nullspace of the so called "matrix of traces", a matrix computable from the generating polynomials of I. To compute the numerical nullspace of the matrix of traces we propose to use Gaussian elimination with pivoting or singular value decomposition. We prove that if I has k distinct zero clusters each of radius at most epsilon in the max-norm, then k steps of Gauss elimination on the matrix of traces yields a submatrix with all entries asymptotically bounded by epsilon^2. We also show that the (k+1)-th singular value of the matrix of traces is O(epsilon^2). The resulting approximate radical has one root in each cluster with coordinates which are the arithmetic mean of the cluster, up to an error term asymptotically bounded by epsilon^2. In the univariate case our method gives an alternative to known approximate square-free factorization algorithms which is simpler and its accuracy is better understood.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Itnuit Janovitz-Freireich, Lajos Ronyai, Agnes Szanto. 2007-02-14. Approximate radical for clusters: a global approach using Gaussian elimination or SVD. https://arxiv.org/abs/math/0702430

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Geometric Detection and Finiteness of Log Crystalline Local Systems

We prove a geometric detection theorem for log crystalline local systems in the smooth proper setting with a normal crossings boundary. The associated special-fiber log $F$-isocrystal detects geometric absolute irreducibility and, modulo constant rank-one twists, determines the pullback to the geometric generic fiber. The main ingredient is a determinant argument combining a finite-order rank-one reduction, logarithmic period comparison, and the Plücker embedding. As an application, using Abe--Esnault's finiteness theorem and finiteness of stable lattices, we prove finiteness, up to geometrically constant rank-one twists, of geometrically absolutely irreducible log crystalline local systems of fixed rank. Coefficients may lie in any fixed finite extension of $\mathbb Q_p$, and no bound on the Hodge--Tate weights is imposed.

math.AG↗

Betti Numbers of Odd Biisotropic Symplectic Grassmannians

We compute the singular cohomology groups of odd biisotropic symplectic Grassmannians $\operatorname{S_2Gr}(k, 2n+1)$ by presenting an explicit dimension-preserving combinatorial bijection between the Bialynicki-Birula cells in $\operatorname{S_2Gr}(k, 2n+1)$ and the Schubert cells in $\operatorname{Gr}(k, 2n+2-k)$.

math.AG↗

Motivic $C_p$-power operations in $\mathrm{MGL}$

In this paper, we give a new proof of the Hopkins-Morel-Hoyois theorem for fields $k$ of characteristic unequal to $p$ containing all primitive $p$-power roots of unity for a fixed prime $p$. This new proof follows Quillen's proof for the structure of the homotopy groups of $\mathrm{MU}$ which utilizes topological power operations. To this end we define a motivic analog of the Steenrod power operations, using the theory of normed motivic spectra as developed by Bachmann--Hoyois and their application for the definition of motivic colimits as developed by Bachmann-Elmanto-Heller.

math.AG↗