The classical Schottky problem is concerned with characterization of Jacobian varieties of compact Riemann surfaces among all abelian varieties, or the identifi
The sparse linear programming(SLP) is a linear programming problem equipped with a sparsity constraint, which is nonconvex, discontinuous and generally NP-hard
Given a switched system,we introduce weakly mixing sets of type 1,2 and Xiong chaotic sets of type 1,2 with respect to a given set and show that they are equiva