SearcharxivSearch

arXiv subjects

Chufeng Cui

Publications and source records attributed to Chufeng Cui.

2 recordsLinked to original sources

On the SOS Rank of Simple and Diagonal Biquadratic Forms

We study the sum-of-squares (SOS) rank of simple and diagonal biquadratic forms. For simple biquadratic forms in $3 \times 3$ variables, we show that the maximum SOS rank is exactly $6$, attained by a specific six-term form. We further prove that for any $m \ge 3$, there exists an $m \times m$ simple biquadratic form whose SOS rank is exactly $2m$. Moreover, we show that for all $m, n \ge 3$, the maximum SOS rank over $m \times n$ simple biquadratic forms is at least $m+n$, which implies $\mathrm{BSR}(m,n) \ge m+n$. For diagonal biquadratic forms with nonnegative coefficients, we prove an SOS rank upper bound of $7$, improving the general bound of $8$ for $3 \times 3$ forms. These results provide new lower and upper bounds on the worst-case SOS rank of biquadratic forms and highlight the role of structure in reducing the required number of squares.

math.OC

Computing The Analytic Connectivity of A Uniform Hypergraph

The analytic connectivity, proposed as a substitute of the algebraic connectivity in the setting of hypergraphs, is an important quantity in spectral hypergraph theory. The definition of the analytic connectivity for a uniform hypergraph involves a series of optimization problems (POPs) associated with the Laplacian tensor of the hypergraph with nonnegativity constraints and a sphere constraint, which poses difficulties in computation. To reduce the involved computation, properties on the algebraic connectivity are further exploited, and several important structured uniform hypergraphs are shown to attain their analytic connectivities at vertices of the minimum degrees, hence admit a relatively less computation by solving a small number of POPs. To efficiently solve each involved POP, we propose a feasible trust region algorithm ({\tt FTR}) by exploiting their special structures. The global convergence of {\tt FTR} to the second-order necessary conditions points is established, and numerical results for both small and large size examples with comparison to other existing algorithms for POPs are reported to demonstrate the efficiency of our proposed algorithm.

math.CO