On Potentially Abelian Geometric Representations

The finiteness is proved of the set of isomorphism classes of potentially abelian geometric Galois representations with a given set of data. This is a special case of the finiteness conjecture of Fontaine and Mazur.     

因素空间理论与知识表示的数学框架（Ⅷ）─—变权综合原理

本文是文［１－７］的继续，研究变权综合问题，从确定变权的经验公式入手引出了变权原理，给出了变权的公理化定义，讨论了与之有关的均衡函数及其梯度向量。     

Cochran's statistical theorem for outer inverses of matrices and matrix quadratic forms

We extend the matrix version of Cochran's statistical theorem to outer inverses of a matrix. As applications, we investigate the Wishartness and independence of matrix quadratic forms for Kronecker product covariance structures.     

The Gram Matrix of a PT-Symmetric Quantum System

The eigenstates of a diagonalizable PT-symmetric Hamiltonian satisfy unconventional completeness and orthonormality relations. These relations reflect the properties of a pair of bi-orthonormal bases associated with non-hermitean diagonalizable operators. In a similar vein, such a dual pair of bases is shown to possess, in the presence of PT symmetry, a Gram matrix of a particular structure: its inverse is obtained by simply swapping the signs of some its matrix elements.     

The Best Lower Bound for the Permanent of a Correlation Matrix of Rank Two

If 1≤k≤n, then Cor(n,k) denotes the set of all n×n real correlation matrices of rank not exceeding k. Grone and Pierce have shown that if A∈Cor (n, n-1), then per(A)≥n/(n-1). We show that if A∈Cor(n,2), then , and that this inequality is the best possible.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

因素空间理论与知识表示的数学框架(XⅢ)──描述架中概念的结构(2)

本文是［１，１２］的继续，研究描述架中概念的结构；本文讨论后半部分，内容涉及概念内涵与外延的转换，清晰关系的内投影与内变换，概念的结构＊以及有关问题的注记。     

Three-dimensional integrable models and associated tangle invariants

In this paper we show that the Boltzmann weights of the three-dimensional Baxter-Bazhanov model give representations of the braid group if some suitable spectral limits are taken. In the trigonometric case we classify all possible spectral limits which produce braid group representations. Furthermore, we prove that for some of them we get cyclotomic invariants of links and for others we obtain tangle invariants generalizing the cyclotomic ones.     

Mackey Theory for p-adic Lie Groups

This paper gives a p-adic analogue of the Mackey theory, which relates representations of a group of type G - H × t A to systems of imprimitivity.