Possible numbers of ones in the squares of 0–1 matrices with a given rank

For a symmetric 0–1 matrix A, we give the number of ones in A ² when rank(A) = 1, 2, and give the maximal number of ones in A ² when rank(A) = k (3 ≤ k ≤ n). The sufficient and necessary condition under which the maximal number is achieved is also obtained. For generic 0–1 matrices, we only study the cases of rank 1 and rank 2.     

Bessel-type inequalities in Hilbert C *-modules

Regarding the generalizations of the Bessel inequality in Hilbert spaces which are due to Bombieri and Boas–Bellman, we obtain a version of the Bessel inequality and some generalizations of this inequality in the framework of Hilbert C *-modules.     

Note on roots location of a symmetric polynomial with respect to the imaginary axis

In the theory of the separation of roots of algebraic equations, the well-known Routh–Hurwitz–Fujiwara theorem enables us to separate the complex roots of a polynomial with complex coefficients in terms of the inertia of a related Hermitian matrix. Unfortunately, it fails if the polynomial has a nontrivial factor which is symmetric with respect to the imaginary axis. In this article, we present a method to overcome the fault and formulate the inertia of a scalar polynomial with complex coefficients in terms of the inertia of several Hermitian matrices based on a factorization of a monic symmetric polynomial into products of monic symmetric polynomials with only simple roots in the complex plane and on computing the inertia of each factor by means of a subtle perturbation.     

Improved lower bounds on the total variation distance for the Poisson approximation

New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen–Stein method. The new bounds rely on a non-trivial modification of the analysis by Barbour and Hall (1984) which surprisingly gives a significant improvement. A use of the new lower bounds is addressed.     

The lifespan of solutions to the inviscid 3D Boussinesq system

In this paper, we consider the inviscid 3D Boussinesq system in Besov spaces and obtain the lower bound for the lifespan of solutions.     

A class of symplectic partitioned Runge–Kutta methods

This paper deals with some relevant properties of Runge–Kutta (RK) methods and symplectic partitioned Runge–Kutta (PRK) methods. First, it is shown that the arithmetic mean of a RK method and its adjoint counterpart is symmetric. Second, the symplectic adjoint method is introduced and a simple way to construct symplectic PRK methods via the symplectic adjoint method is provided. Some relevant properties of the adjoint method and the symplectic adjoint method are discussed. Third, a class of symplectic PRK methods are proposed based on Radau IA, Radau IIA and their adjoint methods. The structure of the PRK methods is similar to that of Lobatto IIIA–IIIB pairs and is of block forms. Finally, some examples of symplectic partitioned Runge–Kutta methods are presented.     

The eigenpairs of a Sylvester–Kac type matrix associated with a simple model for one-dimensional deposition and evaporation

A straightforward model for deposition and evaporation on discrete cells of a finite array of any dimension leads to a matrix equation involving a Sylvester–Kac type matrix. The eigenvalues and eigenvectors of the general matrix are determined for an arbitrary number of cells. A variety of models to which this solution may be applied are discussed.