A computer-assisted proof of Saari's conjecture for the planar three-body problem

The five relative equilibria of the three-body problem give rise to solutions where the bodies rotate rigidly around their center of mass. For these solutions, the moment of inertia of the bodies with respect to the center of mass is clearly constant. Saari conjectured that these rigid motions are the only solutions with constant moment of inertia. This result will be proved here for the planar problem with three nonzero masses with the help of some computational algebra and geometry.

     

一类NLS-mKdV方程族的扩展可积系统

利用代数变换，构造了与文献［５］中的loop代数₂的子代数等价的loop代数1的一个子 代数₁.再将₁扩展为一个高维的loop代数.利用设计了一个等谱问题 ，结合子代数间的直 和运算和同构关系，得到了NLS_mKdV方程族的一类扩展可积系统.作为约化情形，求得了著 名的Schrdinger方程与mKdV方程的可积耦合系统. 关键词： loop代数 可积系统 等谱问题     

Extensions of Modules over Schur Algebras, Symmetric Groups and Hecke Algebras

We study the relation between the cohomology of general linear and symmetric groups and their respective quantizations, using Schur algebras and standard homological techniques to build appropriate spectral sequences. As our methods fit inside a much more general context within the theory of finite-dimensional algebras, we develop our results first in that general setting, and then specialize to the above situations. From this we obtain new proofs of several known results in modular representation theory of symmetric groups. Moreover, we reduce certain questions about computing extensions for symmetric groups and Hecke algebras to questions about extensions for general linear groups and their quantizations.     

广义Sierpinski集

本文考察了包括平面上的各种广义 Cantor集 ,Sierpinski集和包括某些连续不可微曲线在内的广义 Sierpinski集 .由相似变换 ,导出了它们的级数表达式 ,并利用它和字符串空间的对应关系 ,计算出它们的Hausdorff维数     

矩阵方程AXB=D的最小二乘Hermite解及其加权最佳逼近

本中,我们讨论了矩阵方程AXB=D的最小二乘Hermite解,通过运用广义奇异值分解(GSVD)，获得了解的通式。此外,对于给定矩阵F，也得到了它的加权最佳逼近表达式。     

On the structure of the optimal server control for fluid networks

This paper derives the optimal trajectories in a general fluid network with server control. The stationary optimal policy in the complete state space is constructed. The optimal policy is constant on polyhedral convex cones. An algorithm is derived that computes these cones and the optimal policy. Generalized Klimov indices are introduced, they are used for characterizing myopic and time-uniformly optimal policies.Received: November 2004 / Revised: February 2005The research of this author has been supported by the project ‘‘Stochastic Networks’’ of the Netherlands Organisation for Scientific Research NWO.     

Geometric quadrisection in linear time, with application to VLSI placement

We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.

This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.

This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips.     

Gorenstein代数上的Hopf代数作用

令H是有限维Hopf代数，A是左H-模代数。本文证明了A是Gorenstein代数的充分必要条件。A^H也是Gorenstein代数的条件。它是Enochs EE,GarciaJJ和del RioA关于群作用相应的理论的推广，同时给出A/A^H是Frobenius扩张的条件。     

On many‐sorted algebraic closure operators

A theorem of Birkhoff‐Frink asserts that every algebraic closure operator on an ordinary set arises, from some algebraic structure on the set, as the corresponding generated subalgebra operator. However, for many‐sorted sets, i.e., indexed families of sets, such a theorem is not longer true without qualification. We characterize the corresponding many‐sorted closure operators as precisely the uniform algebraic operators. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An algorithm for the divisors of monic polynomials over a commutative ring

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R₀ ⊕ … ⊕ R_m (m ≤ deg f), associated to a fundamental system of idempotents e₀, … , e_m, such that the component of f in each R_i[X] has degree coefficient which is a unit of R_i. We propose to give an algorithm to explicitly find such a decomposition. Moreover, we extend this result to divisors of doubly monic Laurent polynomials.