SearcharxivSearch

arXiv subjects

Zhi-Hong Yang

Publications and source records attributed to Zhi-Hong Yang.

3 recordsLinked to original sources

Whitney Stratification of Algebraic Boundaries of Convex Semi-algebraic Sets

Algebraic boundaries of convex semi-algebraic sets are closely related to polynomial optimization problems. Building upon Rainer Sinn's work, we refine the stratification of iterated singular loci to a Whitney (a) stratification, which gives a list of candidates of varieties whose dual is an irreducible component of the algebraic boundary of the dual convex body. We also present an algorithm based on Teissier's criterion to compute Whitney (a) stratifications, which employs conormal spaces and prime decomposition.

math.OC

The integral closure of a primary ideal is not always primary

In 1936, Krull asked if the integral closure of a primary ideal is still primary. Fifty years later, Huneke partially answered this question by giving a primary polynomial ideal whose integral closure is not primary in a regular local ring of characteristic $p=2$. We provide counterexamples to Krull's question regarding polynomial rings with any characteristics. We also find that the Jacobian ideal $J$ of the polynomial $f = x^6 + y^6 + x^4 z t + z^3$ given by Briançon and Speder in 1975 is a counterexample to Krull's question. Let $V_1$ be the hypersurface defined by $f = 0$ and $V_2$ be its singular locus. Briançon and Speder proved that Whitney equisingularity does not imply Zariski equisingularity by showing that the pair $(V_1 \setminus V_2,\ V_2)$ satisfies Whitney's conditions around the origin but fails Zariski's equisingular conditions. We discover that the pair $(V_1 \setminus V_2,\ V_2)$ fails Whitney's conditions at the variety of the embedded prime of the integral closure $\bar{J}$, which means that $V_1$ is not Whitney regular along $V_2$. Moreover, we also show that Whitney stratification of this hypersurface is different from the stratification of isosingular sets given by Hauenstein and Wampler, which is related to Thom-Boardman singularity.

math.AC

Sparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding

We present sparse interpolation algorithms for recovering a polynomial with $\le B$ terms from $N$ evaluations at distinct values for the variable when $\le E$ of the evaluations can be erroneous. Our algorithms perform exact arithmetic in the field of scalars $\mathsf{K}$ and the terms can be standard powers of the variable or Chebyshev polynomials, in which case the characteristic of $\mathsf{K}$ is $\ne 2$. Our algorithms return a list of valid sparse interpolants for the $N$ support points and run in polynomial-time. For standard power basis our algorithms sample at $N = \lfloor \frac{4}{3} E + 2 \rfloor B$ points, which are fewer points than $N = 2(E+1)B - 1$ given by Kaltofen and Pernet in 2014. For Chebyshev basis our algorithms sample at $N = \lfloor \frac{3}{2} E + 2 \rfloor B$ points, which are also fewer than the number of points required by the algorithm given by Arnold and Kaltofen in 2015, which has $N = 74 \lfloor \frac{E}{13} + 1 \rfloor$ for $B = 3$ and $E \ge 222$. Our method shows how to correct $2$ errors in a block of $4B$ points for standard basis and how to correct $1$ error in a block of $3B$ points for Chebyshev Basis.

cs.SC