关于完备随机内积模中的Lax-Milgram定理的注记

设(S,X)为数域K上以σ-有限测度空间(Ω,A,μ)为基的完备的RIP-模,而且α:S×S→L(μ,K)满足如下条件:(A)存在ξ∈L (μ),使得a(p,q)ξ·X~p·X~q,p,q∈S;(B)a是coercive(即,存在η∈L (μ),使得a(p,p)η·X~p2,p∈S且μ({ωη(ω)=0})=0);(C)对每个q∈S,a(·,q):S→L(μ,K)是模同态,且对每个p∈S,a(p,ξq1 ηq2)=ξ-a(p,q1) η-a(p,q2),q1,q2∈S及ξ,η∈L(μ,K).则存在唯一的连续模同态A:S→S使A-1存在且μ-a.s.有界,还满足:(1)a(p,q)=XA(p),q,p,q∈S;(2)X~A-1(p)1ηX~p,p∈S.     

非平稳ρ混合序列的完全收敛性

本文进一步研究了ρ－混合序列的完全收敛性，讨论了无界非平稳情形完全收敛性成立的充分和必要条件，获得了理想的结果．     

An Infinite Family of Hadamard Matrices with Fourth Last Pivot n /2

We show that the equivalence class of Sylvester Hadamard matrices give an infinite family of Hadamard matrices in which the fourth last pivot is n /2. Analytical examples of completely pivoted Hadamard matrices of order n having as fourth last pivot n /2 are given for n = 16 and 32. In each case this distinguished case with the fourth pivot n /2 arose in the equivalence class of the Sylvester Hadamard matrices.     

On Resolvable Multipartite G-Designs II

In this paper, it has been proved that and are factorable, where ⊗ denotes wreath product of graphs. As a consequence, a resolvable (k,n,k,2λ) multipartite –design exists for even k. These results generalize the results of Ushio on –factorizations of complete tripartite graphs.     

-Decompositions of and D v ∪P where P is a 2-Regular Subgraph of D v

In this paper, we extend the study of C₄-decompositions of the complete graph with 2-regular leaves and paddings to directed versions. Mainly, we prove that if P is a vertex-disjoint union of directed cycles in a complete digraph D_v, then and D_v∪P can be decomposed into directed 4-cycles, respectively, if and only if v(v−1)−|E(P)|≡0(mod 4) and v(v−1)+|E(P)|≡0(mod 4) where |E(P)| denotes the number of directed edges of P, and v≥8.     

Characterization of modules of finite projective dimension over complete intersections

Let be a finitely generated module over a local complete intersection of characteristic . The property that has finite projective dimension can be characterized by the vanishing of for some and for some .

     

High order quadratures for the evaluation of interfacial velocities in axi-symmetric Stokes flows

We propose new high order accurate methods to compute the evolution of axi-symmetric interfacial Stokes flow. The velocity at a point on the interface is given by an integral over the surface. Quadrature rules to evaluate these integrals are developed using asymptotic expansions of the integrands, both locally about the point of evaluation, and about the poles, where the interface crosses the axis of symmetry. The local expansions yield methods that converge to the chosen order pointwise, for fixed evaluation point. The pole expansions yield corrections that remove maximal errors of low order, introduced by singular behaviour of the integrands as the evaluation point approaches the poles. An interesting example of roundoff error amplification due to cancellation is also addressed. The result is a uniformly accurate fifth order method. Second order, pointwise fifth order, and uniform fifth order methods are applied to compute three sample flows, each of which presents a different computational difficulty: an initially bar-belled drop that pinches in finite time, a drop in a strain flow that approaches a steady state, and a continuously extending drop. In each case, the fifth order methods significantly improve the ability to resolve the flow. The examples furthermore give insight into the effect of the corrections needed for uniformity. We determine conditions under which the pointwise method is sufficient to obtain resolved results, and others under which the corrections significantly improve the results.     

On the number of rainbow spanning trees in edge-colored complete graphs

A spanning tree of a properly edge-colored complete graph, $K_n$, is rainbow provided that each of its edges receives a distinct color. In 1996, Brualdi and Hollingsworth conjectured that if $K_{2m}$ is properly $(2m?1)$-edge-colored, then the edges of $K_{2m}$ can be partitioned into $m$ rainbow spanning trees except when $m=2$. By means of an explicit, constructive approach, in this paper we construct $?\sqrt{6m+9}∕3?$ mutually edge-disjoint rainbow spanning trees for any positive value of $m$. Not only are the rainbow trees produced, but also some structure of each rainbow spanning tree is determined in the process. This improves upon best constructive result to date in the literature which produces exactly three rainbow trees.     

Equivalent Conditions of Complete Convergence and Complete Moment Convergence for END Random Variables

In this paper, the complete convergence and the complete moment convergence for extended negatively dependent (END, in short) random variables without identical distribution are investigated. Under some suitable conditions, the equivalence between the moment of random variables and the complete convergence is established. In addition, the equivalence between the moment of random variables and the complete moment convergence is also proved. As applications, the Marcinkiewicz-Zygmund-type strong law of large numbers and the Baum-Katz-type result for END random variables are established. The results obtained in this paper extend the corresponding ones for independent random variables and some dependent random variables.     

Strong regularizing effect of a gradient term in the heat equation with the Hardy potential

We deal with the following parabolic problem,