Roots,iterations and logarithms of formal automorphisms

In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups too     

Expandable network and covering properties for uniform Eberlein compacta

In this paper we characterize the class of uniform Eberlein compact spaces through a network condition and also in terms of covering properties for the square of the space.     

A Positive Doubly Power Bounded Operator with a Nonpositive Inverse Exists on any Infinite-dimensional AL-Space

In this paper we construct a positive doubly power bounded operator with a nonpositive inverse on an AL-space.     

Preemptive scheduling of interval orders is polynomial

In 1979, Papadimitriou and Yannakakis gave a polynomial time algorithm for the scheduling of jobs requiring unit completion times when the precedence constraints form an interval order. The authors solve here the corresponding problem, for preemptive scheduling (a job can be interrupted to work on more important tasks, and completed at a later time, subject to the usual scheduling constraints.) The m-machine preemptive scheduling problem is shown to have a polynomial algorithm, for both unit time and variable execution times as well, when the precedence constraints are given by an interval order.     

Complete systems, elementary submodels and the tightness of upper hyperspaces

We introduce and study some completeness properties for systems of open coverings of a given topological space. A Hausdorff space admitting a system of cardinality κ satisfying one of these properties is of type Gκ. Hence, we define several new variants of the ?ech number and use elementary submodels to determine further results. We introduce M-hulls and M-networks, for M elementary submodel. As an application, we give estimates for both the tightness and the Lindelöf number of a generic upper hyperspace. Two recent results of Costantini, Holá and Vitolo on the tightness of co-compact hyperspaces follow from ours as corollaries.     

Aldo Cossu’s Work in Finite Geometry

A survey of the contributions of Aldo Cossu in finite geometry is given. Dedicated to the memory of Professor Aldo Cossu     

Approximating the single source unsplittable min-cost flow problem

In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given graph with edge capacities and costs; the demand of each commodity must be routed along a single path so that the total flow through any edge is at most its capacity. Moreover, the total cost must not exceed a given budget. This problem has been introduced by Kleinberg [7] and generalizes several NP-complete problems from various areas in combinatorial optimization such as packing, partitioning, scheduling, load balancing, and virtual-circuit routing. Kolliopoulos and Stein [9] and Dinitz, Garg, and Goemans [4] developed algorithms improving the first approximation results of Kleinberg for the problem of minimizing the violation of edge capacities and for other variants. However, known techniques do not seem to be capable of providing solutions without also violating the cost constraint. We give the first approximation results with hard cost constraints. Moreover, all our results dominate the best known bicriteria approximations. Finally, we provide results on the hardness of approximation for several variants of the problem. Received: August 23, 2000 / Accepted: April 20, 2001?Published online October 2, 2001     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Optimality relationships forp-cyclic SOR

Summary The optimality question for blockp-cyclic SOR iterations discussed in Young and Varga is answered under natural conditions on the spectrum of the block Jacobi matrix. In particular, it is shown that repartitioning a blockp-cyclic matrix into a blockq-cyclic form,q, results in asymptotically faster SOR convergence for the same amount of work per iteration. As a consequence block 2-cyclic SOR is optimal under these conditions.Research supported in part by the US Air Force under Grant no. AFOSR-88-0285 and the National Science Foundation under grant no. DMS-85-21154 Present address: Boeing Computer Services, P.O. Box 24346, MS 7L-21, Seattle, WA 98124-0346, USA     

CuX(X=Al, Ga, In)分子的势能函数与稳定性的密度泛函研究

根据原子分子反应静力学原理导出了CuX(X=Al,Ga,In) 分子基态电子状态及其离解极限,并在B3LYP/LANL2DZ水平上计算了平衡几何、振动频率和解离能.利用Murrell-Sorbie 函数拟合出了解析势能函数,并计算出光谱参数和力常数.计算结果表明该分子体系是稳定存在的,其稳定性排序为 CuAl＞CuGa＞CuIn.