Subset representations and eigenvalues of the universal intertwining matrix

We solve a combinatorial question concerning eigenvalues of the universal intertwining endomorphism of a subset representation.     

Springer basic sets and modular Springer correspondence for classical types

We define the notion of basic set data for finite groups (building on the notion of basic set, but including an order on the irreducible characters as part of the structure), and we prove that the Springer correspondence provides basic set data for Weyl groups. Then we use this to determine explicitly the modular Springer correspondence for classical types (defined over a base field of odd characteristic $p$, and with coefficients in a field of odd characteristic $?\ne p$): the modular case is obtained as a restriction of the ordinary case to a basic set. In order to do so, we compare the order on bipartitions introduced by Dipper and James with the order induced by the Springer correspondence. We provide a quick proof, by sorting characters according to the dimension of the corresponding Springer fibre, an invariant which is directly computable from symbols.     

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.     

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

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

An Analogue of Distributivity for Ungraded Lattices

In this paper, we study lattices that posess both the properties of being extremal (in the sense of Markowsky) and of being left modular (in the sense of Blass and Sagan). We call such lattices trim and show that they posess some additional appealing properties, analogous to those of a distributive lattice. For example, trimness is preserved under taking intervals and suitable sublattices. Trim lattices satisfy a weakened form of modularity. The order complex of a trim lattice is contractible or homotopic to a sphere; the latter holds exactly if the maximum element of the lattice is a join of atoms. Any distributive lattice is trim, but trim lattices need not be graded. The main example of ungraded trim lattices are the Tamari lattices and generalizations of them. We show that the Cambrian lattices in types A and B defined by Reading are trim; we conjecture that all Cambrian lattices are trim.     

Clifford分析中无界域上正则函数的边值问题

在引入修正Cauchy核的基础上,讨论了无界域上正则函数的带共轭值的边值问题：a(t)Φ (t) b(t)Φ (t) c(t)Φ-(t) d(t)Φ=g(t)．首先给出了无界域上正则函数的Plemelj公式,然后利用积分方程方法和压缩不动点原理证明了问题解的存在唯一性．     

线性分式规划最优解集的求法

本文使用多面集的表示定理，导出了线性分式规划最优解集的结构，并给出确定全部最优解的计算步骤。