On the pivot structure for the weighing matrix W(12,11)

In the present article we concentrate our study on the growth problem for the weighing matrix W(12,11) and show that the unique W(12,11) has three pivot structures. An improved algorithm for extending a k × k (0,+,-) matrix to a W(n,n-1), if possible, has been developed to simplify the proof. For the implementation of the algorithm special emphasis is given to the notions of data structures and parallel processing.     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Characterization of supercommuting matrices

For a given n-by-n matrix A, we consider the set of matrices which commute with A and all of whose principal submatrices commute with the corresponding principal submatrices of A. The properties of this set are examined, with particular attention to its dimension.     

A local characterization of the johnson scheme

Within the Johnson schemeI(m, d) we find the graphK(m, d) ofd-subsets of anm-set, two such adjacent when disjoint. Among all connected graphs,K(m, d) is characterized by the isomorphism type of its vertex neighborhoods providedm is sufficiently large compared tod. Partial support provided by NSF (USA), SERC (UK), ZWO (NL).     

A characterization of the \Sigma_1-definable functions of KP\omega + (uniform\; AC)

The subject of this paper is a characterization of the -definable set functions of Kripke-Platek set theory with infinity and a uniform version of axiom of choice: . This class of functions is shown to coincide with the collection of set functionals of type 1 primitive recursive in a given choice functional and . This goal is achieved by a G?del Dialectica-style functional interpretation of and a computability proof for the involved functionals. Received October 9, 1996     

A remark on partial linear spaces of girth 5 with an application to strongly regular graphs

We derive a lower bound on the number of points of a partial linear space of girth 5. As an application, certain strongly regular graphs with=2 are ruled out by observing that the first subconstituents are partial linear spaces.     

Elliptic semiplanes and group divisible designs with orthogonal resolutions

In this paper we prove that there exists an elliptic semiplaneS(v, k, m) withk –m 2 if and only if there exists a group divisible design GDD _k ((k –m)(k – 1);k –m; 0, 1) withm pairwise orthogonal resolutions. As an example of this theorem, we construct an elliptic semiplaneW(45, 7, 3) and show thatW is isomorphic to the elliptic semiplaneS(45, 7, 3) given by R. D. Baker.     

Why is space three-dimensional and how may groups be seen?

First we propose a model of visual perception essentially based on the Keldysh-Chernavsky-Sossinsky three-channel theorem, from which three-dimensionality of space follows. Second, we associate with a system of subgroups H ₁, ..., H_s of a given group G a geometric object, called a group crystal, in order to visualize G. How this notion works is illustrated via the Burnside problem.     

Large deviations for martingales with some applications

Let(X _i ) be a martingale difference sequence. LetY be a standard normal random variable. We investigate the rate of uniform convergence