Reaction of D2 with palladium fulleride C60Pd4.9

Fullerene deuteride was obtained by the reaction of deuterium with solid palladium fulleride C₆₀Pd_4.9 under fairly mild conditions. The compound was identified by FD-MS, UV-Vis and IR spectroscopies, and TLC.Translated from Izvestiya Akademii Nauk. Seriya Khimicheskaya, No. 2, pp. 483–484, February, 1996     

Countably compact topological group topologies on free Abelian groups from selective ultrafilters

Tkachenko showed in 1990 the existence of a countably compact group topology on the free Abelian group of size c using CH. Koszmider, Tomita and Watson showed in 2000 the existence of a countably compact group topology on the free Abelian group of size c² using a forcing model in which CH holds.Wallace's question from 1955, asks whether every both-sided cancellative countably compact semigroup is a topological group. A counterexample to Wallace's question has been called a Wallace semigroup. In 1996, Robbie and Svetlichny constructed a Wallace semigroup under CH. In the same year, Tomita constructed a Wallace semigroup from MAcountable.In this note, we show that the examples of Tkachenko, Robbie and Svetlichny, and Koszmider, Tomita and Watson can be obtained using a family of selective ultrafilters. As a corollary, the constructions presented here are compatible with the total failure of Martin's Axiom.     

Incomplete data problems in X-ray computerized tomography

Summary In the present paper we study truncated projections for the fanbeam geometry in computerized tomography. First we derive consistency conditions for the divergent beam transform. Then we study a singular value decomposition for the case where only the interior rays in the fan are provided, as for example in region-of-interest tomography. We show that the high angular frequency components of the searched-for densities are well determined and we present reconstructions from real data where the missing information is approximated based on the singular value decomposition.The work of the authors was supported by the Deutsche Forschungsgemeinschaft under grant Lo 310/2-4     

Approximation of infinite delay and Volterra type equations

Summary We consider a class of infinite delay equations of neutral type which includes Volterrra type integral und integrodifferential equations. Using abstract approximation results (cf. Trotter-Kato-type) for strongly continuous semigroups we develop an approximation scheme which is based on approximation of the system state by Laguerre (and Legendre) polynomials. Numerical examples demonstrate the feasibility of the scheme and show infinite order convergence for smooth data.Supported in part by the Air Force Office of Scientific Research under Contracts AFORS-84-0398 and AFORS-85-0303 and the National Aeronautics and Space Administration under NASA Grant NAG-1-517 and by NSF under Grant UINT-8521208Supported in part by the Air Force Office of Scientific Research under Contract AFORS-84-0398 and in part by the Fonds zur Förderung der wissenschaftlichen Forschung, Austria, under project No. S3206     

A complete global solution to the pressure gradient equation

We study the domain of existence of a solution to a Riemann problem for the pressure gradient equation in two space dimensions. The Riemann problem is the expansion of a quadrant of gas of constant state into the other three vacuum quadrants. The global existence of a smooth solution was established in Dai and Zhang [Z. Dai, T. Zhang, Existence of a global smooth solution for a degenerate Goursat problem of gas dynamics, Arch. Ration. Mech. Anal. 155 (2000) 277-298] up to the free boundary of vacuum. We prove that the vacuum boundary is the coordinate axes.     

类氢类氦类锂镁离子双电子复合的旁观电子角动量研究

类氢类氦类锂镁离子经中间双激发态进行的双电子复合过程在研究惯性约束聚变电子温度中占有很重要的地位.用准相对论方法计算了双电子复合经不同Rydberg态跃迁通道的复合速率系数,并给出不同离化度离子的双电子复合速率系数随电子温度的变化规律.显示出离子的相关能对峰值的电子温度有很大影响,当类氢离子跃迁通道的旁观电子角动量为1时双电子复合系数最大,而类锂离子是旁观电子角动量为3时最大. 关键词： 双电子复合 镁离子 角动量     

A new trigonometric method of summation and its application to the degree of approximation

The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder metric (see §5).     

关于PFI-代数与剩余格

本文提出了一种强FI代数-PFI代数,并且深入研究了它的性质,借此进一步揭示了FI-代数和剩余格之间更加密切的联系,进而以FI-代数为基本框架建立了R0-代数、正则剩余格等逻辑系统的结构特征(包括对隅结构)及其相互关系．这种以FI-代数为基础来统一处理剩余格和R0-代数的方法,同样适合于格蕴涵代数和MV代数等代数结构,而且从中更能清楚地看出它们之间的密切联系,也将有助于对相应形式逻辑系统与模糊推理的研究．     

On the maximum cardinality search lower bound for treewidth

The Maximum Cardinality Search (MCS) algorithm visits the vertices of a graph in some order, such that at each step, an unvisited vertex that has the largest number of visited neighbours becomes visited. A maximum cardinality search ordering (MCS-ordering) of a graph is an ordering of the vertices that can be generated by the MCS algorithm. The visited degree of a vertex v in an MCS-ordering is the number of neighbours of v that are before v in the ordering. The visited degree of an MCS-ordering ψ of G is the maximum visited degree over all vertices v in ψ. The maximum visited degree over all MCS-orderings of graph G is called its maximum visited degree. Lucena [A new lower bound for tree-width using maximum cardinality search, SIAM J. Discrete Math. 16 (2003) 345-353] showed that the treewidth of a graph G is at least its maximum visited degree.We show that the maximum visited degree is of size O(logn) for planar graphs, and give examples of planar graphs G with maximum visited degree k with O(k!) vertices, for all k∈N. Given a graph G, it is NP-complete to determine if its maximum visited degree is at least k, for any fixed k?7. Also, this problem does not have a polynomial time approximation algorithm with constant ratio, unless P=NP. Variants of the problem are also shown to be NP-complete.In this paper, we also propose some heuristics for the problem, and report on an experimental analysis of them. Several tiebreakers for the MCS algorithm are proposed and evaluated. We also give heuristics that give upper bounds on the value of the maximum visited degree of a graph, which appear to give results close to optimal on many graphs from real life applications.     

Large Discrepancy In Homogenous Quasi-Arithmetic Progressions

We prove that the class of homogeneous quasi-arithmetic progressions has unbounded discrepancy. That is, we show that given any 2-coloring of the natural numbers and any positive integer D, one can find a real number α≥1 and a set of natural numbers of the form {0, [α], [2α], [3α], . . . , [kα]} so that one color appears at least D times more than the other color. This was already proved by Beck in 1983, but the proof given here is somewhat simpler and gives a better bound on the discrepancy.