The product ϕ_{λ}^{(α,β)}(t_{1})ϕ_{λ}^{(α,β)}(t_{2}) of two Jacobi functions is expressed as an integral in terms of ϕ_{λ}^{(α,β)}(t_{3}) with explicit non-negative kernel, when α≧β≧−1/2. The resulting convolution structure for Jacobi function expansions is studied. For special values of α and β the results are known from the theory of symmetric spaces.

In our previous work, we studied positive representations of split real quantum groups U q q~ (g R ) restricted to their Borel part and showed that they are closed under taking tensor products. But the tensor product decomposition was only constructed abstractly using the GNS representation of a C*-algebraic version of the Drinfeld–Jimbo quantum groups. Here, using the recently discovered cluster realization of quantum groups, we write the decomposition explicitly by realizing it as a sequence of cluster mutations in the corresponding quiver diagram representing the tensor product.

This paper proposes a neural network approach to efficiently solve nonlinear convex programs with the second-order cone constraints. The neural network model is designed by the generalized FischerBurmeister function associated with second-order cone. We study the existence and convergence of the trajectory for the considered neural network. Moreover, we also show stability properties for the considered neural network, including the Lyapunov stability, the asymptotic stability and the exponential stability. Illustrative examples give a further demonstration for the effectiveness of the proposed neural network. Numerical performance based on the parameter being perturbed and numerical comparison with other neural network models are also provided. In overall, our model performs better than two comparative methods.

Multi-way data arises in many applications such as electroencephalography classification, face recognition, text mining and hyperspectral data analysis. Tensor decomposition has been commonly used to find the hidden factors and elicit the intrinsic structures of the multi-way data. This paper considers sparse nonnegative Tucker decomposition (NTD), which is to decompose a given tensor into the product of a core tensor and several factor matrices with sparsity and nonnegativity constraints. An alternating proximal gradient method is applied to solve the problem. The algorithm is then modified to sparse NTD with missing values. Per-iteration cost of the algorithm is estimated scalable about the data size, and global convergence is established under fairly loose conditions. Numerical experiments on both synthetic and real world data demonstrate its superiority over a few state-of-the-art methods for (sparse

I would like to congratulate Professor Antoniadis for successfully outlining the current state-of-art of wavelet applications in statistics. Since wavelet techniques were introduced to statistics in the early 90s, the applications of wavelet techniques have mushroomed. There is a vast forest of wavelet theory and techniques in statistics and one can find himself easily lost in the jungle. The review by Antoniadis, ranging from linear wavelets to nonlinear wavelets, addressing both theoretical issues and practical relevance, gives in-depth coverage of the wavelet applications in statistics and guides one entering easily into the realm of wavelets.