In an earlier paper, we investigated for finite lattices a concept introduced by A. Slavik: Let A, B, and S be sublattices of the lattice L, A∩B = S, A∪B = L. Then L pastes A and B together over S, if every amalgamation of A and B over S contains L as a sublattice. In this paper we extend this investigation to infinite lattices. We give several characterizations of pasting; one of them directly generalizes to the infinite case the characterization theorem of A. Day and J. Ježk. Our main result is that the variety of all modular lattices and the variety of all distributive lattices are closed under pasting.

The lack of completeness with respect to the semivariation norm, of the space of Banach space valued functions, Pettis integrable with respect to a measure μ, often impedes the direct extension of results involving integral representations, true in the finite-dimensional setting, to the general vector space setting. It is shown here that the space of functions with values in a space Y, μ-Archimedes integrable in a Banach space X embedded in Y, is complete with respect to convergence in semivariation, provided the embedding from X into Y is completely summing. The result is applied to the case when Y is a conuclear space, in particular, when X is a function space continuously included in a space of distributions.

We describe several recursive constructions for designs which use designs with “holes”. As an application, we give a short new proof of the Doyen-Wilson Theorem.

An induced subgraph H of connectivity (edge-connectivity) n in a graph G is a major n-connected (major n-edge-connected) subgraph of G if H contains no subgraph with connectivity (edge- connectivity) exceeding n and H has maximum order with respect to this property. An induced subgraph is a major (major edge-) subgraph if it is a major n-connected (major n-edge-connected) subgraph for some n. Let m be the maximum order among all major subgraphs of C. Then the major connectivity set K(G) of G is defined as the set of all n for which there exists a major n-connected subgraph of G having order m. The major edge-connectivity set is defined analogously. The connectivity and the elements of the major connectivity set of a graph are compared, as are the elements of the major connectivity set and the major edge-connectivity set of a graph. It is shown that every set S of nonnegative integers is the major connectivity set of some graph G. Further, it is shown that for each positive integer m exceeding every element of S, there exists a graph G such that every major k-connected subgraph of G, where k ∈ K(G), has order m. Moreover, upper and lower bounds on the order of such graphs G are established.

In this note, for any given simple group obtained from an orthogonal or unitary group of non-zero index, by a procedure similar to the construction of Chevalley groups and twisted groups, we construct a simple group which is identified with the given simple classical group. The simple groups constructed in this note can be interpreted as generalized simple groups of Lie type. Thus all simple groups of Lie type of types An, Bn, Cn and Dn and all generalized simple groups of Lie type constructed in this note exhaust all simple classical groups with non-zero indices.

In a recent paper Chudnovsky considered the arithmetic properties of certain values of classical Siegel G-function solutions of a system of linear homogeneous differential equations without any restrictive conditions. The present paper generalizes some results of Chudnovsky in both the archimedian and the p-adic case.

The first sentence of [1, Definition 1.1] should read as follows. It is correctly given in the abstract of [1].

We say that a positive integer d has property (A) if for all positive integers m there is an integer x, depending on m, such that, setting n = m + d, x lies between m and n and x is co-prime to mn. We show that infinitely many even d and infinitely many odd d have property (A) and that infinitely many even d do not have property (A). We conjecture and provide supporting evidence that all odd d have property (A).

Following A. R. Woods [3] we then describe conditions (Au) (for each u) asserting, for a given d, the existence of a chain of at most u + 2 integers, each co-prime to its neighbours, which start with m and increase, finishing at n = m + d. Property (A) is equivalent to condition (A1), and it is easily shown that property (Ai) implies property (Ai+1). Woods showed that for some u all d have property (Au), and we conjecture and provide supporting evidence that the least such u is 2.

We prove a version of the Feller-Miyadera-Phillips theorem characterizing the infinitesimal generators of positive C0-semigroups on ordered Banach spaces with normal cones. This is done in terms of N(A) as well as the canonical half-norms of Arendt Chernoff and Kato defined by N(a) = inf{‖b‖ |b ≥ a}, where N(A) = sup{N(Aa) |N(a) ≶ 1} for operator A. A corresponding result on –semigroups is also given.

A construction for Fitting formations given by the author and C. L. Kanes is generalised. The original examples were based on the use of Fitting families of modules over algebraically closed fields. An example of Haberl and Heineken in 1984 suggested that the methods should work with modules over arbitrary fields. We show that this is indeed the case, provided we restrictthe class of groups considered.

It is shown that every boolean right near-ring R is weakly commutative, that is, that xyz = xzy for each x, y, z ∈ R. In addition, an elementary proof is given of a theorem due to S. Ligh which states that a d.g. boolean near-ring is a boolean ring. Finally, a characterization theorem is given for a boolean near-ring to be isomorphic to a particular collection of functions which form a boolean near-ring with respect to the customary operations of addition and composition of mappings.

We study real hypersurfaces of a complex projection space and show that there are no such hypersurfaces with harmonic curvature on which the structure vector is principal.

A theory of generalized gradients is presented for a class of Lipschitz vector-valued mappings from a Banach space to a locally convex order complete vector lattice. Necessary optimality conditions are obtained for nonconvex programming problems on Banach spaces with vector- valued operator constraints and/or an arbitrary set constraint. Sufficient optimality conditions are also obtained under mild convexity assumptions.

The first and last papers of Harald Bohr deal with ordinary Dirichlet series and their order (or Lindelöf) function μ(σ) (= inf{α;f(σ + it) + 0(|t|α)}). The Lindelöf hypothesis is μ(σ) = inf(0, ½ − t) when an = (−1)n. Are there ordinary Dirichlet series with −l < μ′ (σ) < 0 for some σ? A negative answer would imply Lindelöf's hypothesis. This is the last problem of Harald Bohr. This paper gives (1) a review on Bohr's results on ordinary Dinchlet series; (2) a review on results of the author and of Queffelec on “almost sure” and “quasi sure” properties of series with the solution of a previous problem of Bohr; (3) the following answer to the last problem: μ′(σ) can approach − ½, and necessarily μ(σ + μ(σ) + ½) = 0. The characterization of the order functions of ordinary Dirichlet series remains an open question.

Uniformly monotone convergent iterative methods for obtaining multiple solutions of (n + m)th order hyperbolic partial differential equations together with initial conditions are discussed. Appropriate partial differential inequalities which connect upper and lower solutions, and variation of parameters formula is developed.