activity
20192024
most citedSparse Interpolation With Errors in Chebyshev Basis Beyond Redundant-Block Decoding

3 citations · 3 across the 5 of their papers we have counts for

collaborators

5 papers

math.OC2024

Whitney Stratification of Algebraic Boundaries of Convex Semi-algebraic Sets

Zihao Dai, Zijia Li, Zhi-Hong Yang +1

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 iterat…

cs.PL2023

Synthesizing Invariants for Polynomial Programs by Semidefinite Programming

Hao Wu, Qiuye Wang, Bai Xue +3

Constraint-solving-based program invariant synthesis takes a parametric invariant template and encodes the (inductive) invariant conditions into constraints. The problem of charact…

math.AC2022

The integral closure of a primary ideal is not always primary

Nan Li, Zijia Li, Zhi-Hong Yang +1

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 wh…

cs.SC2019★ 3 cited

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

Erich L. Kaltofen, Zhi-Hong Yang

We present sparse interpolation algorithms for recovering a polynomial with terms from evaluations at distinct values for the variable when of the evaluations c…

eess.SY2019

Synthesizing Invariant Clusters for Polynomial Programs by Semidefinite Programming

Qiuye Wang, Lihong Zhi, Naijun Zhan +2

In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structu…