Multiplicative infinite loop space theory

Let G be a finitely presented group given by its pre-abelian presentation <X1,…,Xm; Xe11ζ1,…,Xemmζ,ζm+1,…>, where ei≥0 for i = 1,…, m and ζj?G′ for j≥1. Let N be the subgroup of G generated by the normal subgroups [xeii, G] for i = 1,…, m. Then Dn+2(G)≡γn+2(G) (modNG′) for all n≥0, where G” is the second commutator subgroup of G,γn+2(G) is the (n+2)th term of the lower central series of G and Dn+2(G) = G∩(1+△n+2(G)) is the (n+2)th dimension subgroup of G.     

Arithmetical semigroups V: Multiplicative functions

Several classical results on multiplicative functions ℕ → ℂ are transposed to multiplicative functionsG → ℂ where (G, σ) denotes an additive arithmetical semigroup as introduced by John Knopfmacher.     

一类无穷维Hamilton算子的半群生成定理

研究了无穷维H am ilton算子生成C0半群的问题,得到了类无穷维H am ilton算子生成C0半群的一个充分条件.把结果应用在一类双曲型混合问题生成的无穷维H am ilton算子上,证明此类算子生成C0半群,并利用H ille-Y osida定理进一步说明了结果的正确性和有效性.另外,还给出了波动方程相应的无穷维H am ilton算子所生成的C0半群的具体表达式.     

Decomposition of infinite matrices

We consider the problem of decomposing a matrix of integers according to constraints on the row and column sums, in the case when the original matrix is infinite. Some necessary conditions and some sufficient conditions are found for the existence of such a decomposition, generalizing results of Ball for the finite case. Connections with the Transversal Problem for infinite sets are pointed out.     

Factorizations of infinite sequences in semigroups

It follows from the Ramsey theorem that every infinite sequence of elements of a finite semigroup has an infinite factorization of the form x, e, e, e, ..., where e is an idempotent of the semigroup. We describe all semigroups with this property and with its analog for two-sided infinite sequences.     

Eigenvalues for infinite matrices

This paper is concerned with the problem of determining the location of eigenvalues for diagonally dominant infinite matrices; upper and lower bounds for eigenvalues are established. For tridiagonal matrices, a numerical procedure for improving the bounds is given, and the approximation of the eigenvectors is also discussed. The techniques are illustrated for the solution of the well-known Mathieu's equation.     

Bounded indecomposable semigroups of non-negative matrices

A semigroup \({\mathfrak{S}}\) of non-negative n × n matrices is indecomposable if for every pair i, j ≤ n there exists \({S\in\mathfrak{S}}\) such that (S) _ij ≠ 0. We show that if there is a pair k, l such that \({\{(S)_{kl} : S\in\mathfrak{S}\}}\) is bounded then, after a simultaneous diagonal similarity, all the entries are in [0, 1]. We also provide quantitative versions of this result, as well as extensions to infinite-dimensional cases.     

Diagonalization of row-column-finite infinite matrices

A complete solution to the diagonalization problem (under equivalence) for row-column-finite infinite matrices over a general field is given Project supported by the National Natural Science Foundation of China     

On analytic Ornstein-Uhlenbeck semigroups in infinite dimensions

We extend to infinite dimensions an explicit formula of Chill, Fašangová, Metafune, and Pallara for the optimal angle of analyticity of analytic Ornstein-Uhlenbeck semigroups. The main ingredient is an abstract representation of the Ornstein-Uhlenbeck operator in divergence form. The authors are supported by the ‘VIDI subsidie’ 639.032.201 of the Netherlands Organization for Scientific Research (NWO) and by the Research Training Network HPRN-CT-2002-00281. Received: 28 June 2006 Revised: 5 January 2007     

On infinite doubly substochastic matrices

Summary An infinite matrix is said to be doubly substochastic if it has nonnegative components and each row and each column sum is at most 1. Let x and y be two real sequences which converge to 0 or which are absolutely summable. This paper introduces necessary and sufficient conditions for existence of an infinite doubly substochastic matrix A such that x=Ay concerning partial order and convex hull for sequences.