平面分拆的矢量控制方法：列严格梯形平面分拆

作为移位平面分拆的自然拓广,本文引入了梯形平面分拆的概念.应用矢量控制技巧,建立了给定形状和行(列)分部约束的列严格梯形平面分拆集合之枚举函数的初等对称函数行列式表达式.其中之一的重要特例构成了关于循环对称平面分拆的Macdonald猜想的证明基础.     

Application of Hilbert＇s Projective Metric on Symmetric Cones

Let Ω be a symmetric cone. In this note, we introduce Hilbert＇s projective metric on Ω in terms of Jordan algebras and we apply it to prove that, given a linear invertible transformation g such that g（Ω） = Ω and a real number p, ｜p｜ 〉 1, there exists a unique element x ∈ Ω satisfying g（x） = x^p.     

The large scale topology and algebraic K-theory of arithmetic groups

New compactifications of symmetric spaces of noncompact type X are constructed using the asymptotic geometry of the Borel–Serre enlargement. The controlled K-theory associated to these compactifications is used to prove the integral Novikov conjecture for arithmetic groups.     

RSOS Models and Jantzen–Seitz Representations of Hecke Algebras at Roots of Unity

A special family of partitions occurs in two apparently unrelated contexts: the evaluation of one-dimensional configuration sums of certain RSOS models, and the modular representation theory of symmetric groups or their Hecke algebras H_m. We provide an explanation of this coincidence by showing how the irreducible H_m-modules which remain irreducible under restriction to H_{m_1} (Jantzen–Seitz modules) can be determined from the decomposition of a tensor product of representations sl_n.     

Shell effects in the symmetric-modal fission of pre-actinide nuclei

Mass distributions of fragments in the low-energy fission of nuclei from ¹⁸⁷Ir to ²¹³At have been analysed. This analysis has shown that shell effects in symmetric-mode fragment mass yields from the fission of pre-actinide nuclei could be described if one assumes the existence of two strongly deformed neutron shells in the arising fragments with neutron numbers N₁ ≈ 52 and N₂ ≈ 68. A new method has been proposed for quantitatively describing the mass distributions of the symmetric fission mode for pre-actinides with A ≈ 180–220.     

Sets of permutations that generate the symmetric group pairwise

The paper contains proofs of the following results. For all sufficiently large odd integers n, there exists a set of ²n−1 permutations that pairwise generate the symmetric group Sn. There is no set of ²n−1+1 permutations having this property. For all sufficiently large integers n with n≡2mod4, there exists a set of ²n−2 even permutations that pairwise generate the alternating group An. There is no set of ²n−2+1 permutations having this property.     

Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets

Covering numbers of precompact symmetric convex subsets of Hilbert spaces are investigated. Lower bounds are derived for sets containing orthogonal subsets with norms of their elements converging to zero sufficiently slowly. When these sets are convex hulls of sets with power-type covering numbers, the bounds are tight. The arguments exploit properties of generalized Hadamard matrices. The results are illustrated by examples from machine learning, neurocomputing, and nonlinear approximation.     

Totally Umbilical Hypersurfaces in a Locally Symmetric Manifold

In this paper we obtain some formulas for totally umbilical hypersurfaces in a locally symmetric manifold, and derive some local results on the hypersurfaces from these formulas.     

Cell transfer and monomial positivity

We give combinatorial proofs that certain families of differences of products of Schur functions are monomial-positive. We show in addition that such monomial-positivity is to be expected of a large class of generating functions with combinatorial definitions similar to Schur functions. These generating functions are defined on posets with labelled Hasse diagrams and include for example generating functions of Stanley's (P,ω)-partitions. T.L. was supported in part by NSF DMS-0600677.     

On solving energy-dependent partitioned eigenvalue problem by genetic algorithm: The case of real symmetric Hamiltonian matrices

An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of genetic algorithm. The proposed method is tested with matrices of different sizes (30 × 30 to 1000 × 1000). Comparison is made with Löwdin’s strategy for solving the problem. The relative advantages and disadvantages of the GA-based method are analyzed