In this paper we show that a locally connected and locally compact metric image of a generalized graph under a reflexive open mapping is a generalized graph; further, we characterize all acyclic generalized graphs X with the property that any locally one-to-one reflexive open mapping of X into a Hausdorff space is globally one-to-one. Several problems are posed and some examples are given.

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.

In this paper, it is shown that any connected, small category can be embedded in a semi-groupoid (a category in which there is at least one isomorphism between any two elements) in such a way that the embedding includes a homotopy equivalence of classifying spaces. This immediately gives a monoid whose classifying space is of the same homotopy type as that of the small category. This construction is essentially algorithmic, and furthermore, yields a finitely presented monoid whenever the small category is finitely presented. Some of these results are generalizations of ideas of McDuff.

Various continuity conditions (in norm, in measure, weakly etc.) for the nonlinear superposition operator F x(s) = f(s, x(s)) between spaces of measurable functions are established in terms of the generating function f = f(s, u). In particular, a simple proof is given for the fact that, if F is continuous in measure, then f may be replaced by a function f which generates the same superposition operator F and satisfies the Carathéodory conditions. Moreover, it is shown that integral functional associated with the function f are proved.

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.

A Neumann subgroup of the classical modular group is by definition a complement of a maximal parabolic subgroup. Recently Neumann subgroups have been studied in a series of papers by Brenner and Lyndon. There is a natural extension of the notion of a Neumann subgroup in the context of any finitely generated Fuchsian group Γ acting on the hyperbolic plane H such that Γ/H is homeomorphic to an open disk. Using a new geometric method we extend the work of Brenner and Lyndon in this more general context.

All subnormal subgroups of hypernormalizing groups have by definition subnormal normalizers. It is shown that finite soluble HN-groups belong to the class of groups of Fitting length three. Finite HN-groups are considered including those with subnormal quotient isomorphic to SL(2,5).

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.

Using various facts about principal bundles over a space, we give a unified treatment of several theorems about the structure of stable separable continuous-trace algebras, their automorphisms, and their K-theory. We also present a classification of real continuous-trace algebras from the same point of view.

Let ξ be a C*;-bundle over T with fibres {At}t∈A. Suppose that A is the C*-algebra of sections of ξ which vanish at infinity, and that (A, G, α) is a C*-dymanical system that, for each t ∈ T, the ideal It = {f ∈ A|f(t) =; 0} is G-invariant. If in addition, the stabiliser group of each P ∈ Prim(A) is amenable, then A ⋊αG is the section algebra of a C*-bundle with fibres {At ⋊αG}t∈T.

The above theorem may be used to prove a structure theorem for crossed products built from C*-dynamical systems (A, G, α) where the action of G on A is smooth. Assuming that the stabiliser groups are amenable, then A ⋊αG has a composition series such that each quotient is a section algebra of a C*-bundle where the fibres are of the form Aσ ⋊αG; moreover, the Aσ correspond to locally closed subsets of Prim(A), and G acts transitively on Prim(Aσ). In many cases, in particular when (G, A) is separable, the Aσ ⋊αG have been computed explicitly by other authors.

These results are actually proved for twisted C*dynamical systems.

We answer two conjectures suggested by Zalman Rubinstein. We prove his Conjecture 1, that is, we construct convergent iterative sequences for with an arbitrary initial point, where with m ≥ 2. We also show by several counterexamples that Rubinstein's Conjecture 2 is generally false.

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.

A method is proposed for driving degenerate feasible solutions to linear programming problems away from essential degeneracy and in particular for identifying essentially degenerate optimal solutions. An essentially degenerate cycling example is also given, so answering a question raised earlier.

Two graphs, the edge crossing graph E and the triangle graph T are associated with a simple lattice polygon. The maximal independent sets of vertices of E and T are derived including a formula for the size of the fundamental triangles. Properties of E and T are derived including a formula for the size of the maximal independent sets in E and T. It is shown that T is a factor graph of edge-disjoint 4-cycles, which gives corresponding geometric information, and is a partition graph as recently defined by the authors and F. Harary.

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.

It is shown that a so-called shortly connected combinatorial inverse semigroup is strongly lattice-determined “modulo semilattices”. One of the consequences of this theorem is the known fact that a simple inverse semigroup with modular lattice of full inverse subsemigroups is strongly lattice-determined [7]. The partial automorphism semigroup of an inverse semigroup S consists of all isomorphisms between inverse subsemigroups of S. It is proved that if S is a shortly connected combinatorial inverse semigroup, T an inverse semigroup and the partial automorphism semigroups of S and T are isomorphic, then either S and T are isomorphic or they are dually isomorphic chains (with respect to the natural partial order); moreover, any isomorphism between the partial automorphism semigroups of S and T is induced either by an isomorphism or, if S and T are dually isomorphic chains, by a dual isomorphism between S and T. Counter-examples are constructed to demonstrate that the assumptions about S being shortly connected and combinatorial are essential.

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.

We prove that in a non-isotropic Euclidean space, homogeneous Lipschitz spaces of distributions, defined in terms of (generalized) Weierstrass integrals, can be characterized by means of higher order difference operators.

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

An approximate dual is proposed for a multiobjective optimization problem. The approximate dual has a finite feasible set, and is constructed without using a perturbation. An approximate weak duality theorem and an approximate strong duality theorem are obtained, and also an approximate variational inequality condition for efficient multiobjective solutions.