Some new integral inequalities of Bellman–Bihari type with delay for discontinuous functions

In this article we investigate some integral functional inequalities of Bellman–Bihari type for piecewise-continuous functions with some fixed points of discontinuity. We also prove a new analogy and generalization of results which were obtained by Bellman and Bihari to integro-sum inequalities with delay and discontinuities that do not belong to Lipschitz’s type.     

A convergent approach to the formal total synthesis of hemibrevetoxin B

A convergent synthesis of the key synthetic intermediate of hemibrevetoxin B was achieved via the intramolecular allylation of an α-chloroacetoxy ether and subsequent ring-closing metathesis.     

小分子硫原子团簇正离子的结构稳定性

用分子图形软件设计出 4 9种硫原子团簇Sn+ (n =3～ 13)的结构 ,使用B3LYP密度泛函进行几何构型优化和振动频率计算 ,根据分子的总能量得出最稳定的同分异构体 .在硫原子团簇正离子中 ,大部分原子为二配位成键 .带有一、三配位的原子结构的总能量较高 .部分最稳定硫原子团簇正离子的构型与最稳定的中性硫原子团簇的构型完全不同 .     

A two-step biomimetic synthesis of antimalarial robustadials A and B

The antimalarial robustadials A and B have been synthesized in two steps starting from commercially available phloroglucinol comprising a key biomimetic three-component reaction that involves in situ generation of an o-quinone methide via Knoevenagel condensation and subsequent Diels-Alder cycloaddition with (−)-β-pinene.     

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.     

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