模糊关系矩阵传递闭包的Warshall算法

通过对照关系的传递闭包和模糊关系的传递闭包，把求关系矩阵的传递闭包的算法完整地推广到模糊关系矩阵上。     

Applications of fast atom bombardment mass spectrometry (FAB MS) to organometallic and coordination chemistry

This article describes the technique of fast atom bombardment mass spectrometry (FAB MS) and its applications to the analysis of organometallic and coordination complexes. Sections on ion generation and matrices are followed by a Periodic Group-based review of FAB MS results obtained from Transition Metal and Main Group compounds, organometallic cluster carbonyls and their derivatives, and salts of poly-oxo-anions. The literature has been surveyed from 1981 to approximately mid-1986.     

新型固液双重致孔球形离子交换剂的制备及其性能研究

以甲基丙烯酸缩水甘油酯为单体 ,采用固液联合致孔方式 ,通过一步悬浮聚合制备了一种新型双孔高分子球形载体 .经化学修饰后 ,得到含二乙胺羟丙基的阴离子交换剂 (介质A) .优化了制备条件 .并与用相同方法制备的但仅含有机溶剂致孔剂的介质B进行了比较 .介质A和B均具有较高的静态吸附容量和机械强度 .由于介质A内含有流动相可以对流通过的大孔 ,因此其动态吸附容量远高于介质B ,并且在较高的流速下表现出较好的色谱流动性能     

Principal Submatrices of a Hermitian Matrix

Suppose k 1 ,<, k m and n are positive integers such that k 1 + … + k m h n . We characterize those k i × k i Hermitian matrices A i , i = 1, < , m that can appear as diagonal blocks of an n × n Hermitian matrix C with prescribed eigenvalues. The characterization will be given in terms of the eigenvalues of C and A i , i = 1, <, m . Our results extend those of Thompson and Freede, Horn, Fan and Pall.     

Schatten properties,nuclearity and minimality of phase shift invariant spaces

We extend Feichtinger's minimality property on the smallest non-trivial time-frequency shift invariant Banach space, to the quasi-Banach case. Analogous properties are deduced for certain matrix spaces.We use these results to prove that the pseudo-differential operator $\mathrm{Op}(a)$ is a Schatten-q operator from $M^{\infty }$ to $M^p$ and r-nuclear operator from $M^{\infty }$ to $M^r$ when $a\in M^r$ for suitable p, q and r in $(0,\infty ]$.     

Novel matrix invariants for characterization of changes of proteomics maps

Previous studies on mathematical characterization of proteomics maps by sets of map invariants were based on the construction of a set of distance-related matrices obtained by matrix multiplication of a single matrix by itself. Here we consider an alternative characterization of proteomics maps based on a set of matrices characterizing local features of an embedded zigzag curve over the map. It is shown that novel invariants can well characterize proteomics maps. Advantages of the novel approach are discussed.     

A bump triangular dynamic factorization algorithm for the simplex method

A dynamic factorization algorithm is developed which algebraically partitions the basis inverse in such a manner so that the simplex method can be executed from a series of small inverses and the basis itself. This partition is maintained dynamically so that the additional memory required to represent the basis inverse reduces to this series of small inverses for in-core implementations.The algorithm is intended for use in solving general large-scale linear programming problems. This new method of basis representation should permit rather large problems to be solved completely in-core.Preliminary computational experience is presented and comparisons are made with Reid's sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases. The computational experience indicated that a significant reduction in memory requirements can usually be obtained using the dynamic factorization approach with only a slight (up to about 20%) degradation of execution time.This research was supported in part by the Air Force Office of Scientific Research, Air Force System Command, USAF, under AFOSR Contract/Grant Number AFOSR-74-2715.     

Integral decomposition in polyhedra

We say that a polyhedronP satisfies weak integral decomposition if whenever an integral vector is the sum ofk vectors inP it is also the sum ofk integral vectors inP. This property is related to rounding results for packing and covering problems. We study the property and two related properties, and give results concerning integral polymatroids, totally unimodular matrices and network flows, pairs of strongly-base-orderable matroids, and branchings in directed graphs.     

Polynomials in operator space theory

The aim of this article is to start a metric theory of homogeneous polynomials in the category of operator spaces. For this purpose we take advantage of the basic fact that the space P^m(E)$P^m(E)$ of all m-homogeneous polynomials on a vector space E can be identified with the algebraic dual of the m  -th symmetric tensor product ⊗^m,sE${\otimes }^{m,s}E$. Given an operator space V, we study several different types of completely bounded polynomials on V   which form the operator space duals of ⊗^m,sV${\otimes }^{m,s}V$ endowed with related operator structures. Of special interest are what we call Haagerup, Kronecker, and Schur polynomials – polynomials associated with different types of matrix products.     

Chebyshev polynomials on symmetric matrices

In this paper we evaluate Chebyshev polynomials of the second kind on a class of symmetric integer matrices, namely on adjacency matrices of simply laced Dynkin and extended Dynkin diagrams. As an application of these results we explicitly calculate minimal projective resolutions of simple modules of symmetric algebras with radical cube zero that are of finite and tame representation type.