二元Schur凹copula的次对角部分

任意给定一个二元Schur 凹copula, 结合其自身和次对角部分, 利用取大和取小运算, 构造了一类新copula, 使得次对角部分相互重合, 讨论了新copula 的Schur 凹性与Schur 几何凹性.     

Schur Convexity for Two Classes of Symmetric Functions and Their Applications

For x =(x1, x2, ···, xn) ∈ Rn+∪ Rn-, the symmetric functions Fn(x, r) and Gn(x, r) are defined by r1 + xFij n(x, r) = Fn(x1, x2, ···, xn; r) =x1≤iij1i2···ir ≤n j=1and r1- xGij n(x, r) = Gn(x1, x2, ···, xn; r) =,x1≤i1i2···ir ≤n j=1ij respectively, where r = 1, 2, ···, n, and i1, i2, ···, in are positive integers. In this paper,the Schur convexity of Fn(x, r) and Gn(x, r) are discussed. As applications, by a bijective transformation of independent variable for a Schur convex function, the authors obtain Schur convexity for some other symmetric functions, which subsumes the main results in recent literature; and by use of the theory of majorization establish some inequalities. In particular, the authors derive from the results of this paper the Weierstrass inequalities and the Ky Fan's inequality, and give a generalization of Safta's conjecture in the n-dimensional space and others.     

Schur‐convexity and quadrature formulae

This paper aims to contribute to the exploration of quadrature formulae by proving that the error of a quadrature formula has the Schur‐convexity property. The emphasis is on the quadrature formulae with the maximum degree of precision. The Schur‐convexity of the error has an interesting implication – the monotonicity of the error. Namely, it turns out that the absolute value of the error is always smaller on a smaller interval (of the two which share the same midpoint).     

亚正定矩阵的Bergstrom型不等式

首先证明亚正定矩阵的一个偏序,利用该偏序得到了亚正定矩阵的一些Bergstrom型不等式,推广了近期关于亚正定矩阵行列式不等式的一些结果.     

Elementary Abelian <Emphasis Type="Italic">p</Emphasis>-groups of rank greater than or equal to 4<Emphasis Type="Italic">p</Emphasis>−2 are not CI-groups

In this paper we prove that an elementary Abelian p-group of rank 4p−2 is not a CI⁽²⁾-group, i.e. there exists a 2-closed transitive permutation group containing two non-conjugate regular elementary Abelian p-subgroups of rank 4p−2, see Hirasaka and Muzychuk (J. Comb. Theory Ser. A 94(2), 339–362, 2001). It was shown in Hirasaka and Muzychuk (loc cit) and Muzychuk (Discrete Math. 264(1–3), 167–185, 2003) that this is related to the problem of determining whether an elementary Abelian p-group of rank n is a CI-group. As a strengthening of this result we prove that an elementary Abelian p-group E of rank greater or equal to 4p−2 is not a CI-group, i.e. there exist two isomorphic Cayley digraphs over E whose corresponding connection sets are not conjugate in Aut E. This research was supported by a fellowship from the Pacific Institute for the Mathematical Sciences.     

Computational efficiency analysis of Wu et al.’s fast modular multi-exponentiation algorithm

Very recently, for speeding up the computation of modular multi-exponentiation, Wu et al. presented a fast algorithm combining the complement recoding method and the minimal weight binary signed-digit representation technique. They claimed that the proposed algorithm reduced the number of modular multiplications from 1.503k to 1.306k on average, where the value k is the maximum bit-length of two exponents. However, in this paper, we show that their claim is unwarranted. We analyze the computational efficiency of Wu et al.’s algorithm by modeling it as a Markov chain. Our main result is that Wu et al.’s algorithm requires 1.471k modular multiplications on average.     

Preconditioning the Poincaré-Steklov operator by using Green's function

This paper is concerned with the Poincaré-Steklov operator that is widely used in domain decomposition methods. It is proved that the inverse of the Poincaré-Steklov operator can be expressed explicitly by an integral operator with a kernel being the Green's function restricted to the interface. As an application, for the discrete Poincaré-Steklov operator with respect to either a line (edge) or a star-shaped web associated with a single vertex point, a preconditioner can be constructed by first imbedding the line as the diameter of a disk, or the web as a union of radii of a disk, and then using the Green's function on the disk. The proposed technique can be effectively used in conjunction with various existing domain decomposition techniques, especially with the methods based on vertex spaces (from multi-subdomain decomposition). Some numerical results are reported.

     

Computational Aspect for Function-Valued Padé-Type Approximation

The computational problems of two special determinants are investigated. Those tion for computing Fredholm integral equation of the second kind. The main tool to be used in this paper is the well-known Schur complement theorem.     

Graphs G for which both G and G¯ are Contraction Critically k-Connected

 An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. A k-connected graph with no k-contractible edge is called contraction critically k-connected. For k≥4, we prove that if both G and its complement Gˉ are contraction critically k-connected, then |V(G)|<k ^5/3+4k ^3/2. Received: October, 2001 Final version received: September 18, 2002 AMS Classification: 05C40