Differential operators for Siegel-Jacobi forms

For any positive integers n and m, H_(n,m):= H_n× C~(m,n) is called the Siegel-Jacobi space, with the Jacobi group acting on it. The Jacobi forms are defined on this space. We compute the Chern connection of the Siegel-Jacobi space and use it to obtain derivations of Jacobi forms. Using these results, we construct a series of invariant differential operators for Siegel-Jacobi forms. Also two kinds of Maass-Shimura type differential operators for H_(n,m) are obtained.     

Jacobi Maaß forms

In this paper, we give a new definition for the space of non-holomorphic Jacobi Maaß forms (denoted by J _k,m ^nh ) of weight k∈? and index m∈? as eigenfunctions of a degree three differential operator \(\mathcal{C}^{k,m}\). We show that the three main examples of Jacobi forms known in the literature: holomorphic, skew-holomorphic and real-analytic Eisenstein series, are contained in J _k,m ^nh . We construct new examples of cuspidal Jacobi Maaß forms F _f of weight k∈2? and index 1 from weight k?1/2 Maaß forms f with respect to Γ₀(4) and show that the map f ? F _f is Hecke equivariant. We also show that the above map is compatible with the well-known representation theory of the Jacobi group. In addition, we show that all of J _k,m ^nh can be “essentially” obtained from scalar or vector valued half integer weight Maaß forms.     

Real hypersurfaces in complex hyperbolic two-plane Grassmannians with commuting restricted normal Jacobi operators

We give a classification of Hopf real hypersurfaces in complex hyperbolic two-plane Grassmannians SU_2,m/S(U₂·U _m ) with commuting conditions between the restricted normal Jacobi operator \({\bar R_{N\varphi }}\) and the shape operator A (or the Ricci tensor S).     

The real symmetric matrices of odd order with a P-set of maximum size

Suppose that A is a real symmetric matrix of order n. Denote by m_A(0) the nullity of A. For a nonempty subset α of {1, 2,..., n}, let A(α) be the principal submatrix of A obtained from A by deleting the rows and columns indexed by α. When m_A(α)(0) = m_A(0)+|α|, we call α a P-set of A. It is known that every P-set of A contains at most ?n/2? elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As a first step to the full characterization of these graphs of odd order, we establish some conditions for such graphs G under which there is a real symmetric matrix A whose graph is G and contains a P-set of size (n ? 1)/2.     

Jacobi method for symmetric 4 × 4 matrices converges for every cyclic pivot strategy

The paper studies the global convergence of the Jacobi method for symmetric matrices of size 4. We prove global convergence for all 720 cyclic pivot strategies. Precisely, we show that inequality S(A ^[t+3]) ≤ γ S(A ^[t]), t ≥ 1, holds with the constant γ < 1 that depends neither on the matrix A nor on the pivot strategy. Here, A ^[t] stands for the matrix obtained from A after t full cycles of the Jacobi method and S(A) is the off-diagonal norm of A. We show why three consecutive cycles have to be considered. The result has a direct application on the J-Jacobi method.     

Linear preservers of row-dense matrices

Let M_m,n be the set of all m × n real matrices. A matrix A ∈ M_m,n is said to be row-dense if there are no zeros between two nonzero entries for every row of this matrix. We find the structure of linear functions T: M_m,n → M_m,n that preserve or strongly preserve row-dense matrices, i.e., T(A) is row-dense whenever A is row-dense or T(A) is row-dense if and only if A is row-dense, respectively. Similarly, a matrix A ∈ M_n,m is called a column-dense matrix if every column of A is a column-dense vector. At the end, the structure of linear preservers (strong linear preservers) of column-dense matrices is found.     

Convergence analysis of the direct extension of ADMM for multiple-block separable convex minimization

Recently, the alternating direction method of multipliers (ADMM) has found many efficient applications in various areas; and it has been shown that the convergence is not guaranteed when it is directly extended to the multiple-block case of separable convex minimization problems where there are m ≥ 3 functions without coupled variables in the objective. This fact has given great impetus to investigate various conditions on both the model and the algorithm’s parameter that can ensure the convergence of the direct extension of ADMM (abbreviated as “e-ADMM”). Despite some results under very strong conditions (e.g., at least (m ? 1) functions should be strongly convex) that are applicable to the generic case with a general m, some others concentrate on the special case of m = 3 under the relatively milder condition that only one function is assumed to be strongly convex. We focus on extending the convergence analysis from the case of m = 3 to the more general case of m ≥ 3. That is, we show the convergence of e-ADMM for the case of m ≥ 3 with the assumption of only (m ? 2) functions being strongly convex; and establish its convergence rates in different scenarios such as the worst-case convergence rates measured by iteration complexity and the globally linear convergence rate under stronger assumptions. Thus the convergence of e-ADMM for the general case of m ≥ 4 is proved; this result seems to be still unknown even though it is intuitive given the known result of the case of m = 3. Even for the special case of m = 3, our convergence results turn out to be more general than the existing results that are derived specifically for the case of m = 3.     

The real analog of the Jacobi inversion problem on a Riemann surface with boundary,its generalizations,and applications

Given a finite Riemann surface of genus h ≥ 1 with boundary composed of m+1 connected components we consider a system of m+h real congruences analogous to the classical Jacobi inversion problem. We provide a solution to this system and its applications to boundary value problems.     

Possible isolation number of a matrix over nonnegative integers

Let ?₊ be the semiring of all nonnegative integers and A an m × n matrix over ?₊. The rank of A is the smallest k such that A can be factored as an m × k matrix times a k×n matrix. The isolation number of A is the maximum number of nonzero entries in A such that no two are in any row or any column, and no two are in a 2 × 2 submatrix of all nonzero entries. We have that the isolation number of A is a lower bound of the rank of A. For A with isolation number k, we investigate the possible values of the rank of A and the Boolean rank of the support of A. So we obtain that the isolation number and the Boolean rank of the support of a given matrix are the same if and only if the isolation number is 1 or 2 only. We also determine a special type of m×n matrices whose isolation number is m. That is, those matrices are permutationally equivalent to a matrix A whose support contains a submatrix of a sum of the identity matrix and a tournament matrix.     

Generalization of the Chinese remainder theorem

Sufficient conditions for a system Ax = r to have an integral solution in the case of a basic matrix A in terms of submatrices and permanents of A are derived. Matrix A in the Chinese remainder theorem is a particular case of a basic matrix. The derivation can be extended to the case where the propositional formula that describes the sign scheme of A is a minimal unsatisfiable CNF.     

To the Spectral Theory of One-Dimensional Matrix Dirac Operators with Point Matrix Interactions

We investigate one-dimensional (2p × 2p)-matrix Dirac operators D_X,α and D_X,β with point matrix interactions on a discrete set X. Several results of [4] are generalized to the case of (p × p)-matrix interactions with p > 1. It is shown that a number of properties of the operators D_X,α and D_X,β (self-adjointness, discreteness of the spectrum, etc.) are identical to the corresponding properties of some Jacobi matrices B_X,α and B_X,β with (p × p)-matrix entries. The relationship found is used to describe these properties as well as conditions of continuity and absolute continuity of the spectra of the operators D_X,α and D_X,β. Also the non-relativistic limit at the velocity of light c → ∞ is studied.     

Schrödinger operators with δ′-interactions and the Krein-Stieltjes string

We investigate one dimensional symmetric Schrödinger operator H _{X, β} with δ′-interactions of strength β = “β _n ” _{n = 1} ^∞ ? ? on a discrete set X = “x _n ” _{n = 1} ^∞ ? [0, b), b ≤ +∞ (x _n ↑ b). We consider H _{X, β} as an extension of the minimal operator H _min:= ?d ²/dx ²?W ₀ ^2.2 (?\X) and study its spectral properties in the frame-work of the extension theory by using the technique of boundary triplets and the corresponding Weyl functions. The construction of a boundary triplet for H _min ^* is given in the case d _*:= inf_{n ∈ ?}\x _n ? x _{n ? 1}\ = 0. We show that spectral properties like self-adjointness, lower semiboundedness, nonnegativity, and discreteness of the spectrum of the operator H _{X, β} correlate with the corresponding properties of a certain Jacobi matrix. In the case β _n > 0, n ∈ ?, these matrices form a subclass of Jacobi matrices generated by the Krein-Stieltjes strings. The connection discovered enables us to obtain simple conditions for the operator H _{X, β} to be self-adjoint, lower semibounded and discrete. These conditions depend significantly not only on β but also on X. Moreover, as distinct from the case d _* > 0, the spectral properties of Hamiltonians with δ- and δ′-interactions in the case d _* = 0 substantially differ.     

Parametric AE-solution sets to the parametric linear systems with multiple right-hand sides and parametric matrix equation A(p)X = B(p)

In this paper, the parametric matrix equation A(p)X = B(p) whose elements are linear functions of uncertain parameters varying within intervals are considered. In this matrix equation A(p) and B(p) are known m-by-m and m-by-n matrices respectively, and X is the m-by-n unknown matrix. We discuss the so-called AE-solution sets for such systems and give some analytical characterizations for the AE-solution sets and a sufficient condition under which these solution sets are bounded. We then propose a modification of Krawczyk operator for parametric systems which causes reduction of the computational complexity of obtaining an outer estimation for the parametric united solution set, considerably. Then we give a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for enclosing the parametric united solution set which also enables us to reduce the computational complexity, significantly. Also some numerical approaches based on Gaussian elimination and Gauss-Seidel methods to find outer estimations for the parametric united solution set are given. Finally, some numerical experiments are given to illustrate the performance of the proposed methods.     

Rectifier Circuits of Bounded Depth

Asymptotically tight bounds are obtained for the complexity of computation of the classes of (m, n)-matrices with entries from the set {0, 1,..., q ? 1} by rectifier circuits of bounded depth d, under some relations between m, n, and q. In the most important case of q = 2, it is shown that the asymptotics of the complexity of Boolean (m, n)-matrices, log n = o(m), logm = o(n), is achieved for the circuits of depth 3.     

Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions

In this paper, we improve existing results in the field of compressed sensing and matrix completion when sampled data may be grossly corrupted. We introduce three new theorems. (1) In compressed sensing, we show that if the m×n sensing matrix has independent Gaussian entries, then one can recover a sparse signal x exactly by tractable ? ₁ minimization even if a positive fraction of the measurements are arbitrarily corrupted, provided the number of nonzero entries in x is O(m/(log(n/m)+1)). (2) In the very general sensing model introduced in Candès and Plan (IEEE Trans. Inf. Theory 57(11):7235–7254, 2011) and assuming a positive fraction of corrupted measurements, exact recovery still holds if the signal now has O(m/(log² n)) nonzero entries. (3) Finally, we prove that one can recover an n×n low-rank matrix from m corrupted sampled entries by tractable optimization provided the rank is on the order of O(m/(nlog² n)); again, this holds when there is a positive fraction of corrupted samples.     

<Emphasis Type="Italic">X</Emphasis>-decomposable finite groups for <Emphasis Type="Italic">X</Emphasis>={1, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">m</Emphasis> + 1, <Emphasis Type="Italic">m</Emphasis> + 2}

A normal subgroup N of a finite group G is called n-decomposable in G if N is the union of n distinct G-conjugacy classes. We study the structure of nonperfect groups in which every proper nontrivial normal subgroup is m-decomposable, m+1-decomposable, or m+2-decomposable for some positive integer m. Furthermore, we give classification for the soluble case.     

BTTB preconditioners for BTTB systems

In this paper, we consider solving the BTTB system \({\cal T}_{m,n}[f] {\bf{x}} = {\bf{b}}\) by the preconditioned conjugate gradient (PCG) method, where \({\cal T}_{m,n}[f]\) denotes the m × m block Toeplitz matrix with n × n Toeplitz blocks (BTTB) generated by a (2π, 2π)-periodic continuous function f(x, y). We propose using the BTTB matrix \({\cal T}_{m,n}[1/f]\) to precondition the BTTB system and prove that only O(m)?+?O(n) eigenvalues of the preconditioned matrix \({\cal T}_{m,n}[1/f] {\cal T}_{m,n}[f]\) are not around 1 under the condition that f(x, y)?>?0. We then approximate 1/f(x, y) by a bivariate trigonometric polynomial, which can be obtained in O(m n log(m n)) operations by using the fast Fourier transform technique. Numerical results show that our BTTB preconditioner is more efficient than block circulant preconditioners.     

(<Emphasis Type="Italic">m</Emphasis>,<Emphasis Type="Italic">r</Emphasis>)-central Riordan arrays and their applications

For integers m > r ≥ 0, Brietzke (2008) defined the (m, r)-central coefficients of an infinite lower triangular matrix G = (d, h) = (d_n,k)_n,k∈N as d_{mn+r,(m?1)n+r}, with n = 0, 1, 2,..., and the (m, r)-central coefficient triangle of G as

$${G^{\left( {m,r} \right)}} = {\left( {{d_{mn + r,\left( {m - 1} \right)n + k + r}}} \right)_{n,k \in \mathbb{N}}}.$$

It is known that the (m, r)-central coefficient triangles of any Riordan array are also Riordan arrays. In this paper, for a Riordan array G = (d, h) with h(0) = 0 and d(0), h′(0) ≠ 0, we obtain the generating function of its (m, r)-central coefficients and give an explicit representation for the (m, r)-central Riordan array G^(m,r) in terms of the Riordan array G. Meanwhile, the algebraic structures of the (m, r)-central Riordan arrays are also investigated, such as their decompositions, their inverses, and their recessive expressions in terms of m and r. As applications, we determine the (m, r)-central Riordan arrays of the Pascal matrix and other Riordan arrays, from which numerous identities are constructed by a uniform approach.

     

Stability of uncertain discrete systems

The uncertain system

$x_{n + 1} = A_n x_n , n = 0,1,2, \ldots ,$

is considered, where the coefficients a _ij (n) of the m×m matrix A _n are functionals of any nature subject to the constraints

$\begin{array}{*{20}c} {\left| {a_{i,i} (n)} \right| \leqslant \alpha _ * < 1,} \\ {\left| {a_{i,j} (n)} \right| \leqslant \alpha _0 for j \geqslant i + 1,} \\ {\left| {a_{i,j} (n)} \right| \leqslant \delta for j < i.} \\ \end{array} $

Such systems include, in particular, switched-type systems, whose matrix A can take values in a given finite set.By using a special Lyapunov function, a bound δ ≤ δ(α₀,α_*) ensuring the global asymptotic stability of the system is found. In particular, the system is stable if the last inequality is replaced by a _i,j (n) = 0 for j < i.It is shown that pulse-width modulated systems reduce to the uncertain systems under consideration; moreover, in the case of a pulse-width modulation of the first kind, the coefficients of the matrix A are functions of x(n), and in the case of a modulation of the second kind, they are functionals.     

Nikol’skii inequality between the uniform norm and <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">q</Emphasis></Subscript>-norm with jacobi weight of algebraic polynomials on an interval

We study the Nikol’skii inequality for algebraic polynomials on the interval [?1, 1] between the uniform norm and the norm of the space L _q ^(α,β) , 1 ≤ q < ∞, with the Jacobi weight ?(α,β)(x) = (1 ? x) ^α (1 + x) ^β , α ≥ β > ?1. We prove that, in the case α > β ≥ ?1/2, the polynomial with unit leading coefficient that deviates least from zero in the space L _q ^(α+1,,β) with the Jacobi weight ? ^(α+1,β)(x) = (1?x) ^α+1(1+x) ^β is the unique extremal polynomial in the Nikol’skii inequality. To prove this result, we use the generalized translation operator associated with the Jacobi weight. We describe the set of all functions at which the norm of this operator in the space L _q ^(α,β) for 1 ≤ q < ∞ and α > β ≥ ?1/2 is attained.