It is known that the problem of settling the existence of an n × n Hadamard matrix, where n is divisible by 4, is equivalent to that of finding the cardinality of a smallest set T of 4-circuits in the complete bipartite graph Kn, n such that T contains at least one circuit of each copy of K2,3 in Kn, n. Here we investigate the case where n ≡ 2 (mod 4), and we show that the problem of finding the cardinality of T is equivalent to that of settling the existence of a certain kind of n × n matrix. Moreover, we show that the case where n ≡ 2 (mod 4) differs from that where n ≡ 0 (mod 4) in that the problem of finding the cardinality of T is not equivalent to that of maximising the determinant of an n × n (1,-1)-matrix.

We consider certain affine Kac-Moody Lie algebras. We give a Lie theoretic interpretation of the generalized Euler identities by showing that they are associated with certain filtrations of the basic representations of these algebras. In the case when the algebras have prime rank, we also give algebraic proofs of the corresponding identities.

We study weak and strong peripheral 1-acyclicity, a homology version of D. R. McMillan, Jr.'s weak cellularity criterion and cellularity criterion, for embeddings of compacta in 3-manifolds. In contrast with the two cellularity criteria we prove that the two peripheral acyclicities are equivalent and moreover, for compacta of dimension at most 1, independent of the embedding. We also give some results concerning regular neighborhoods of compact polyhedra in 3-manifolds.

This note is devoted to the question of deciding whether or not a subring of a finite-dimensional algebra over the rationals, with additive group a Butler group, is the endomorphism ring of a Butler group (a Butler group is a pure subgroup of a finite direct sum of rank-1 torsion-free abelian groups). A complete answer is given for subrings of division algebras. Several applications are included.

A periodic binary array on the sequare grid is said to be sequential if and only if each row and each column of the array contains a given periodic binary sequence or some cyclic shift or reversal of this sequence. Such arrays are of interest in connection with experimental layouts. This paper extends previous results by characterizing sequential arrays on sequences of the type (1,…,1,0,…,0) and solving the problem of equivalence of such arrays (including a computation of the number of equivalence classes).

We characterize the generalized ordered topological spaces X for which the uniformity (X) is convex. Moreover, we show that a uniform ordered space for which every compatible convex uniformity is totally bounded, need not be pseudocompact.

This paper is concerned with a vector optimization problem set in a normed space where optimality is defined through a convex cone. The vector problem can be solved using a parametrized scalar problem. Under some convexity assumptions, it is shown that dependence of optimal solutions on the parameter is Lipschitz continuous. Hence differentiable dependence on the solutions on the parameter is derived.

We show that for all n ≥ 3k + 1, n ≠ 6, there exists an incomplete self-orthogonal latin square of order n with an empty order k subarray, called an ISOLS(n;k), except perhaps when (n;k) ∈ {(6m + i;2m):i = 2, 6}.

For any two compact convex sets in a Euclidean space, the relation between the volume of the sum of the two sets and the volume of each of them is given by the Brünn-Minkowski inequality. In this note we prove an analogous relation for the one-dimensional Hausdorff measure of the one-skeleton of the above sets. Also, some counterexamples are given which show that the above results are the best possible in some special cases.

Let E be a Hausdorff topological vector space, let K be a nonempty compact convex subset of E and let f, g: K → 2E be upper semicontinuous such that for each x ∈ K, f(x) and g(x) are nonempty compact convex. Let Ω ⊂ 2E be convex and contain all sets of the form x − f(x), y − x + g(x) − f(x), for x, y ∈ K. Suppose p: K × Ω →, R satisfies: (i) for each (x, A) ∈ K × Ω and for ε > 0, there exist a neighborhood U of x in K and an open subset set G in E with A ⊂ G such that for all (y, B) ∈ K ×Ω with y ∈ U and B ⊂ G, | p(y, B) - p(x, A)| < ε, and (ii) for each fixed X ∈ K, p(x, ·) is a convex function on Ω. If p(x, x − f(x)) ≤ p(x, g(x) − f(x)) for all x ∈ K, and if, for each x ∈ K with f(x) ∩ g(x) = ø, there exists y ∈ K with p(x, y − x + g(x) − f(x)) < p(x, x − f(x)), then there exists an x0 ∈ K such that f(x0) ∩ g(x0) ≠ ø. Another coincidence theorem on a nonempty compact convex subset of a Hausdorff locally convex topological vector space is also given.

It is shown that in a Grothendieck space with the Dunford-Pettis property, the class of well-bounded operators of type (B) coincides with the class of scalar-type spectral operators with real spectrum. It turns out that in such Banach spaces, analogues of the classical theorems of Hille-Sz. Nagy and Stone concerned with the integral representation of C0-semigroups of normal operators and strongly continuous unitary groups in Hilbert spaces, respectively, are of a very special nature.

A minimal (1,3; ν) covering occurs when we have a family of proper subsets selected from ν elements with the property that every triple occurs exactly once in the family and no family of smaller cardinality possesses this property. Woodall developed a lower bound W for the quantity g(k)(1, 3; ν) which represents the cardinality of a minimal family with longest block of length k. The Woodall bound is only accurate in the region when k ≥ ν/2. We develop an expression for the excess of the true value over the Woodall bound and apply this to show that, when k ≥ ν/2, the value of g(1,3; ν) = W + 1 when k is even and W + 1 + when k is odd.