3 papers
math.DG2026
SDP Feasibility Problems and sos Representation Ranks for OT-FKM Type Isoparametric Polynomials
Jianquan Ge, Kai Jia, Yuyang Zhao
Semidefinite programming (SDP) provides a fundamental framework for studying properties of sum-of-squares (sos) representations of nonnegative polynomials. In this paper we study t…
math.CA2021
On a Conjecture of Bahri-Xu
Hong Chen, Jianquan Ge, Kai Jia +1
In order to study the Yamabe changing-sign problem, Bahri and Xu proposed a conjecture which is a universal inequality for points in . They have verified the conje…
math.ST2019
Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes
Jing Zhang, Jin Xu, Kai Jia +2
Sliced Latin hypercube designs (SLHDs) are widely used in computer experiments with both quantitative and qualitative factors and in batches. Optimal SLHDs achieve better space-fil…