Eliminating graphs by means of parallel knock-out schemes

In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex eliminates exactly one of its neighbors. The parallel knock-out number of a graph is the minimum number of rounds after which all vertices have been eliminated (if possible). The parallel knock-out number is related to well-known concepts like perfect matchings, hamiltonian cycles, and 2-factors.We derive a number of combinatorial and algorithmic results on parallel knock-out numbers: for families of sparse graphs (like planar graphs or graphs of bounded tree-width), the parallel knock-out number grows at most logarithmically with the number n of vertices; this bound is basically tight for trees. Furthermore, there is a family of bipartite graphs for which the parallel knock-out number grows proportionally to the square root of n. We characterize trees with parallel knock-out number at most 2, and we show that the parallel knock-out number for trees can be computed in polynomial time via a dynamic programming approach (whereas in general graphs this problem is known to be NP-hard). Finally, we prove that the parallel knock-out number of a claw-free graph is either infinite or less than or equal to 2.     

Barycentric systems and stretchability

Using a general resolution of barycentric systems we give a generalization of Tutte's theorem on convex drawing of planar graphs. We deduce a characterization of the edge coverings into pairwise non-crossing paths which are stretchable: such a system is stretchable if and only if each subsystem of at least two paths has at least three free vertices (vertices of the outer face of the induced subgraph which are internal to none of the paths of the subsystem). We also deduce that a contact system of pseudo-segments is stretchable if and only if it is extendible.     

57Fe Mössbauer spectroscopic study of (25−x)MnO–xZnO–15Fe2O3–60B2O3 glasses

The ⁵⁷Fe Mössbauer technique has been used to investigate the effect of zinc oxide substitution in (25???x)MnO–xZnO–15Fe₂O₃–60B₂O₃ glass system (x?=?0, 5, 10, 15 and 20 mol% of ZnO ). Mössbauer absorption spectra for all the samples recorded at room temperature suggest the existence of the two paramagnetic quadrupole doublets. The observed variations in hyperfine parameters have been explained on the basis of cations distribution and exchange interaction at the lattice sites and it is concluded that B–B interaction increases while the metal–metal interaction decreases due to replacement of manganese oxide by zinc oxide. These results suggest that the present glass system exhibits a paramagnetic behaviour that changes towards the weak paramagnetic when manganese oxide was replaced with zinc oxide.     

正丁基苝四羧酸二酰亚胺的晶型和性能研究

文章合成了N,N'-二正丁基苝四羧酸二酰亚胺,并纯化、调晶,进行了IR、元素分析、X射线等测定.分析该化合物在DMF中的紫外光谱(最大吸收波长524.80 nm)、荧光光谱(最大发射波长539.0 nm)、Stokes位移(数值15 nm)等光谱性质.在400～700 nm范围内,α晶型薄膜紫外-可见吸收出现很强的吸收峰,且由β型变为α型,最大吸收波长有明显的红移(545 nm变为580 nm).X射线粉末衍射也反映出α晶型的2θ在26.0°处衍射峰CPS为2 508,β型在25.2°为1 891.α,β晶型作为电荷产生材料制得的功能分离型有机光导体,在光源滤波波长λ=532 nm曝光下,测得含α,β感光体达到饱和电位的时间分别为46,93.98 s,光衰电位(5.3千伏电压负充电电晕,1～2 s后的表面电位)分别为727和525 V,半衰曝光量分别为4.32,4.34μJ·cm-2,残余电位分别为30和45 V等光导性能数值.     

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     

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.     

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     

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     

Invariant measures for equicontinuous semigroups of continuous transformations of a compact Hausdorff space

Equicontinuous semigroups of transformations of a compact Hausdorff space and their sets of all invariant (Borel, regular and probabilistic) measures are studied. Conditions equivalent to the existence of at least one invariant measure are given. The (algebraic and topological) structure of the set of invariant measures is researched.     

Group symmetry in tensor categories and duality for orbifolds

A duality for orbifolds is presented as an application of group extensions in tensor categories.