The Nearest Bisymmetric Solutions of Linear Matrix Equations

The necessary and sufficient conditions for the existence of and the expressions for the bisymmetric solutions of the matrix equations (Ⅰ)A1X1B1 A2X2B2 ^… AkXkBk=D,(Ⅱ)A1XB1 A2XB2 … AkXBk=D and (Ⅲ) (A1XB1,A2XB2,…,AkXBk)=(D1,D2,…,Dk) are derived by using Kronecker product and Moore-Penrose generalized inverse of matrices. In addition, in corresponding solution set of the matrix equations, the explicit expression of the nearest matrix to a given matrix in the Frobenius norm is given. Numerical methods and numerical experiments of finding the neaxest solutions axe also provided.     

A multiscale Galerkin method for the hypersingular integral equation reduced by the harmonic equation

The aim of this paper is to investigate the numerical solution of the hypersingular integral equation reduced by the harmonic equation. First, we transform the hypersingular integral equation into 2π-periodic hypersingular integral equation with the map x=cot(θ/2). Second, we initiate the study of the multiscale Galerkin method for the 2π-periodic hypersingular integral equation. The trigonometric wavelets are used as trial functions. Consequently, the 2j+1 × 2j+1 stiffness matrix Kj can be partitioned j×j block matrices. Furthermore, these block matrices are zeros except main diagonal block matrices. These main diagonal block matrices are symmetrical and circulant matrices, and hence the solution of the associated linear algebraic system can be solved with the fast Fourier transform and the inverse fast Fourier transform instead of the inverse matrix. Finally, we provide several numerical examples to demonstrate our method has good accuracy even though the exact solutions are multi-peak and almost singular.     

一类特殊的对称的块循环矩阵的特征值

In this paper, the spectrum and characteristic polynomial for a special kind of symmetric block circulant matrices are given.     

Circulant Double Coverings of a Circulant Graph of Valency Five

Enumerating the isomorphism classes of several types of graph covering projections is one of the central research topics in enumerative topological graph theory. A covering of G is called circulant if its covering graph is circulant. Recently, the authors [Discrete Math., 277, 73-85 （2004）1 enumerated the isomorphism classes of circulant double coverings of a certain type, called a typical covering, and showed that no double covering of a circulant graph of valency three is circulant. Also, in [Graphs and Combinatorics, 21,386 400 （2005）], the isomorphism classes of circulant double coverings of a circulant graph of valency four are enumerated. In this paper, the isomorphism classes of circulant double coverings of a circulant graph of valency five are enumerated.     

ON BLOCK PRECONDITIONERS FOR PDE-CONSTRAINED OPTIMIZATION PROBLEMS

Recently, Bal proposed a block-counter-diagonal and a block-counter-triangular precon- ditioning matrices to precondition the GMRES method for solving the structured system of linear equations arising from the Galerkin finite-element discretizations of the distributed control problems in （Computing 91 （2011） 379-395）. He analyzed the spectral properties and derived explicit expressions of the eigenvalues and eigenvectors of the preconditioned matrices. By applying the special structures and properties of the eigenvector matrices of the preconditioned matrices, we derive upper bounds for the 2-norm condition numbers of the eigenvector matrices and give asymptotic convergence factors of the preconditioned GMRES methods with the block-counter-diagonal and the block-counter-triangular pre- conditioners. Experimental results show that the convergence analyses match well with the numerical results.     

On Enumeration of Perfect Partition

A partition of n is said to be perfect when it containe just one partition ofevery number up to n. In paper [1], Prof. Wang Efang gave some recurrenceformulas for the number of perfect n-partitions Per(n). In this paper we obtainthe explicit formula for Per(n) and discuss the condition and enumeration forperfect n-partition with the Ieast number of parts. Theorem 1. If n 1=p_1~mp_2~a…p_k~ak,p_1,p_2,…,p_k are distinc primes, a_1 a_2     

A new method for constructing infinite families of k-tight optimal double loop networks

The double loop network (DLN) is a circulant digraph with n nodes and outdegree 2. DLN has been widely used in the designing of local area networks and distributed systems. In this paper, a new method for constructing infinite families of k-tight optimal DLN is presented. For k = 0,1,…,40, the infinite families of k-tight optimal DLN can be constructed by the new method, where the number nk(t,a) of their nodes is a polynomial of degree 2 in t and contains a parameter a. And a conjecture is proposed.     

Determinant representation of Darboux transformation for the AKNS system

The n-fold Darboux transform (DT) is a 2×2 matrix for the Ablowitz-Kaup-Newell-Segur (AKNS) system. In this paper, each element of this matrix is expressed by 2n 1 ranks' determinants. Using these formulae, the determinant expressions of eigenfunctions generated by the n-fold DT are obtained. Furthermore, we give out the explicit forms of the n-soliton surface of the Nonlinear Schrodinger Equation (NLS) by the determinant of eigenfunctions.     

A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

Moments of the Time of Ruin, Surplus Before Ruin and the Deficit at Ruin in the Erlang（N） Risk Process

In this paper we consider the ＂penalty＂ function in the Erlang（n） risk model. Using the integro- differential equation we established, we obtain the explicit expressions for the moments of Erlang（2） risk model. When the claim size distribution is Light-Tailed and the penalty function is bounded, we obtain the exact representations for the moments of Erlang（n） risk model.     

交换环上上三角矩阵的李三导子

Let T(n,R) be the Lie algebra consisting of all n × n upper triangular matrices over a commutative ring R with identity 1 and M be a 2-torsion free unital T(n,R)-bimodule.In this paper,we prove that every Lie triple derivation d : T(n,R) → M is the sum of a Jordan derivation and a central Lie triple derivation.     

L_p(1≤p≤∞) APPROXIMATION BY AN n-DIMENSIONAL SUBSPACE ON A SET OF n 1 POINTS

Some new characterizations and immediate explicit expressions of best L_p(1≤p≤∞) approximation and their deviations by an n-dimensional subspace on a set of n 1 points are given.     

BILINEAR FORMS AND LINEAR CODES

Abraham Lempel et al^[1] made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.     

The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices

Let Gn（C） be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and Gc（Jr~） the set of all primitive matrices in Gn（C）. In this paper, some necessary and sufficient conditions for A in the semigroup Gn（C） to be primitive are given. We also show that Gc（Jn） is a subsemigroup of Gn（C）.     

STRUCTURES OF CIRCULANT INVERSE M-MATRICES

In this paper, we present a useful result on the structures of circulant inverse Mmatrices. It is shown that if the n × n nonnegative circulant matrix A = Circ[c0, c1,… , c（n- 1）] is not a positive matrix and not equal to c0I, then A is an inverse M-matrix if and only if there exists a positive integer k, which is a proper factor of n, such that cjk 〉 0 for j=0,1…, [n-k/k], the other ci are zero and Circ[co, ck,… , c（n-k）] is an inverse M-matrix. The result is then extended to the so-called generalized circulant inverse M-matrices.     

数有根近2-正则平面地图

The number of rooted nearly 2-regular maps with the valency of root-vertex, the number of non-rooted vertices and the valency of root-face as three parameters is obtained. Furthermore, the explicit expressions of the special cases including loopless nearly 2-regular maps and simple nearly 2-regular maps in terms of the above three parameters are derived.     

On the polynomiality and asymptotics of moments of sizes for random(n,dn ± 1)-core partitions with distinct parts

Amdeberhan’s conjectures on the enumeration,the average size,and the largest size of(n,n+1)-core partitions with distinct parts have motivated many research on this topic.Recently,Straub(2016)and Nath and Sellers(2017)obtained formulas for the numbers of(n,dn-1)-and(n,dn+1)-core partitions with distinct parts,respectively.Let X_s,t be the size of a uniform random(s,t)-core partition with distinct parts when s and t are coprime to each other.Some explicit formulas for the k-th moments E[X_n,n+1^k]and E[X_(2 n+1,2 n+3)^k]were given by Zaleski and Zeilberger(2017)when k is small.Zaleski(2017)also studied the expectation and higher moments of X_n,dn-1 and conjectured some polynomiality properties concerning them in ar Xiv:1702.05634.Motivated by the above works,we derive several polynomiality results and asymptotic formulas for the k-th moments of X_n,dn+1 and X_n,dn-1 in this paper,by studying theβ-sets of core partitions.In particular,we show that these k-th moments are asymptotically some polynomials of n with degrees at most 2 k,when d is given and n tends to infinity.Moreover,when d=1,we derive that the k-th moment E[X_n,n+1^k]of X_n,n+1 is asymptotically equal to(n²/10)^kwhen n tends to infinity.The explicit formulas for the expectations E[X_n,dn+1]and E[X_n,dn-1]are also given.The(n,dn-1)-core case in our results proves several conjectures of Zaleski(2017)on the polynomiality of the expectation and higher moments of X_n,dn-1.     

On the Classification of Arc-transitive Circulant Digraphs of Order Odd-Prime-Squared

A Cayley graph F = Cay（G, S） of a group G with respect to S is called a circulant digraph of order pk if G is a cyclic group of the same order. Investigated in this paper are the normality conditions for arc-transitive circulant （di）graphs of order p^2 and the classification of all such graphs. It is proved that any connected arc-transitive circulant digraph of order p^2 is, up to a graph isomorphism, either Kp2, G（p^2,r）, or G（p,r）[pK1], where r｜p- 1.     

Some Conditions for Matrices over an Incline To Be Invertible and General Linear Group on an Incline

Inclines are the additively idempotent semirings in which products are less than or equal to either factor. In this paper, some necessary and sufficient conditions for a matrix over L to be invertible are given, where L is an incline with 0 and 1. Also it is proved that L is an integral incline if and only if GLn（L） = PLn （L） for any n （n 〉 2）, in which GLn（L） is the group of all n × n invertible matrices over L and PLn（L） is the group of all n × n permutation matrices over L. These results should be regarded as the generalizations and developments of the previous results on the invertible matrices over a distributive lattice.     

The Fundamental Solutions of the Space, Space-Time Riesz Fractional Partial Differential Equations with Periodic Conditions

In this paper, the space-time Riesz fractional partial differential equations with periodic conditions are considered. The equations are obtained from the integral partial differential equation by replacing the time derivative with a Caputo fractional derivative and the space derivative with Riesz potential. The fundamental solutions of the space Riesz fractional partial differential equation (SRFPDE) and the space-time Riesz fractional partial differential equation (STRFPDE) are discussed, respectively. Using methods of Fourier series expansion and Laplace transform, we derive the explicit expressions of the fundamental solutions for the SRFPDE and the STRFPDE, respectively.