On Compact Hermitian Manifolds with Flat Gauduchon Connections

Given a Hermitian manifold(M~n, g), the Gauduchon connections are the one parameter family of Hermitian connections joining the Chern connection and the Bismut connection. We will call▽~s=(1-s/2)▽~c+s/2▽~b the s-Gauduchon connection of M, where ▽~c and ▽~b are respectively the Chern and Bismut connections. It is natural to ask when a compact Hermitian manifold could admit a flat s-Gauduchon connection. This is related to a question asked by Yau. The cases with s = 0(a flat Chern connection) or s = 2(a flat Bismut connection) are classified respectively by Boothby in the1950 s or by the authors in a recent joint work with Q. Wang. In this article, we observe that if either s ≥ 4 + 2×3~(1/2) ≈ 7.46 or s ≤ 4-2×3~(1/2) ≈ 0.54 and s ≠ 0, then g is K?hler. We also show that, when n = 2,g is always K?hler unless s = 2. Therefore non-K?hler compact Gauduchon flat surfaces are exactly isosceles Hopf surfaces.     

Hermitian generalization of the Rarita-Schwinger operators

We introduce two new linear differential operators which are invariant with respect to the unitary group SU（n）. They constitute analogues of the twistor and the Rarita-Schwinger operator in the orthogonal case. The natural setting for doing this is Hermitian Clifford Analysis. Such operators are constructed by twisting the two versions of the Hermitian Dirac operator 6z_ and 6z_ and then projecting on irreducible modules for the unitary group. We then study some properties of their spaces of nullsolutions and we find a formulation of the Hermitian Rarita-Schwinger operators in terms of Hermitian monogenic polynomials.     

关于复对称矩阵特征根的补注

This note investigates the relationship of eigenvalues of Hermitian matrices P and UPU+ with UU+ = Ik and k ≤ n. We present several equivalent conditions for λi(UPU+) = λi(P) (i ≤ k ≤ n).     

A generalized preconditioned HSS method for non-Hermitian positive definite linear systems

Based on the HSS (Hermitian and skew-Hermitian splitting) and preconditioned HSS methods, we will present a generalized preconditioned HSS method for the large sparse non-Hermitian positive definite linear system. Our method is essentially a two-parameter iteration which can extend the possibility to optimize the iterative process. The iterative sequence produced by our generalized preconditioned HSS method can be proven to be convergent to the unique solution of the linear system. An exact parameter region of convergence for the method is strictly proved. A minimum value for the upper bound of the iterative spectrum is derived, which is relevant to the eigensystem of the products formed by inverse preconditioner and splitting. An efficient preconditioner based on incremental unknowns is presented for the actual implementation of the new method. The optimality and efficiency are effectively testified by some comparisons with numerical results.     

Extremal ranks of matrix expression of A − BXC with respect to Hermitian matrix

The extremal ranks of matrix expression of A − BXC with respect to X^H = X have been discussed by applying the quotient singular value decomposition Q-SVD and some rank equalities of matrices in this paper.     

Covering and radius-covering arrays: Constructions and classification

The minimum number of rows in covering arrays (equivalently, surjective codes) and radius-covering arrays (equivalently, surjective codes with a radius) has been determined precisely only in special cases. In this paper, explicit constructions for numerous best known covering arrays (upper bounds) are found by a combination of combinatorial and computational methods. For radius-covering arrays, explicit constructions from covering codes are developed. Lower bounds are improved upon using connections to orthogonal arrays, partition matrices, and covering codes, and in specific cases by computation. Consequently for some parameter sets the minimum size of a covering array is determined precisely. For some of these, a complete classification of all inequivalent covering arrays is determined, again using computational techniques. Existence tables for up to 10 columns, up to 8 symbols, and all possible strengths are presented to report the best current lower and upper bounds, and classifications of inequivalent arrays.     

LDPC码在量子密钥分配多维协商算法中的应用

密钥协商是量子密钥分配(QKD)的重要环节,影响着QKD的密钥率和安全距离.作为一种低信噪比时较为高效的密钥协商方案,多维协商算法被很好地应用在高斯调制连续变量QKD中,延长了通信距离.本文研究了二进制LDPC码在多维协商算法中的应用方案,进而扩展到多进制LDPC码.仿真表明,相比二进制LDPC码,利用多进制LDPC码能够使多维协商性能获得明显增益.     

The dual geometry of Hermitian two-point codes

In this paper, we study the algebraic geometry of any two-point code on the Hermitian curve and reveal the purely geometric nature of their dual minimum distance. We describe the minimum-weight codewords of many of their dual codes through an explicit geometric characterization of their supports. In particular, we show that they appear as sets of collinear points in many cases.     

Fully Ramified Characters and Clifford Codes

In this article we study relations between groups and quantum error correcting codes. Groups of central type are used to construct quantum error correcting codes. Both stabilizer and Clifford codes can be derived from a construction involving this kind of groups. A more general construction of Clifford codes will be given and their correcting properties will be examined using group theoretical techniques.