Zeros of Complete Symmetric Polynomials over Finite Fields

Wan and Zhang(2021) obtained a nontrivial lower bound for the number of zeros of complete symmetric polynomials over finite fields,and proposed a problem whether their bound can be improved.In this paper,the author improves Wan-Zhang's bound from three aspects.The proposed results are based on the estimates related to the number of certain permutations and the value sets of non-permutation polynomials associated to the complete symmetric polynomial.And the author believes that there are still possibilities to improve the bounds and hence Wan-Zhang's bound.

Rank-r decomposition of symmetric tensors

An algorithm is presented for decomposing a symmetric tensor into a sum of rank-1 symmetric tensors. For a given tensor, by using apolarity, catalecticant matrices and the condition that the mapping matrices are commutative, the rank of the tensor can be obtained by iteration. Then we can find the generating polynomials under a selected basis set. The decomposition can be constructed by the solutions of generating polynomials under the condition that the solutions are all distinct which can be guaranteed by the commutative property of the matrices. Numerical examples demonstrate the efficiency and accuracy of the proposed method.

Kernel Function-Based Primal-Dual Interior-Point Methods for Symmetric Cones Optimization

In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.

Nonisospectral Lotka–Volterra Systems as a Candidate Model for Food Chain

In this paper,we derive a generalized nonisospectral semi-infinite Lotka-Volterra equation,which possesses a determinant solution.We also give its a Lax pair expressed in terms of symmetric orthogonal polynomials.In addition,if the simplified case of the moment evolution relation is considered,that is,without the convolution term,we also give a generalized nonisospectral finite Lotka-Volterra equation with an explicit determinant solution.Finally,an application of the generalized nonisospectral continuous-time Lotka-Volterra equation in the food chain is investigated by numerical simulation.Our approach is mainly based on Hirota’s bilinear method and determinant techniques.