C k -factorization of complete bipartite graphs

In this paper, it is shown that a necessary and sufficient condition for the existence of aC _k-factorization ofK _m,n is (i)m = n 0 (mod 2), (ii)k 0 (mod 2),k 4 and (iii) 2n 0 (modk) with precisely one exception, namely m =n = k = 6.     

Some Multiply Derived Translation Planes with SL(2,5) as an Inherited Collineation Group in the Translation Complement

Finite translation planes having a collineation group isomorphic to SL(2,5) occur in many investigations on minimal normal non-solvable subgroups of linear translation complements. In this paper, we are looking for multiply derived translation planes of the desarguesian plane which have an inherited linear collineation group isomorphic to SL(2,5). The Hall plane and some of the planes discovered by Prohaska [10], see also [1], are translation planes of this kind of order q ²;, provided that q is odd and either q ²; 1 mod 5 or q is a power of 5. In this paper the case q ² -1 mod 5 is considered and some examples are constructed under the further hypothesis that either q 2 mod 3, or q 1 mod 3 and q 1 mod 4, or q -1 mod 4, 3 q and q 3,5 or 6 mod 7. One might expect that examples exist for each odd prime power q. But this is not always true according to Theorem 2.     

Construction of orthogonal starters and corollaries

A method is proposed for constructing a system of (v–1)/2 pairwise disjoint orthogonal starters of order v for v6k+17 (mod 12)pn²+n+1/t such that the number 3 is one of the primitive roots of the Galois field of prime order p (k is prime, k 2, and n and t are positive integers). The starters occurring in this system satisfy certain additional conditions. The construction of a series of combinatorial structures, including some not previously known, is a consequence of this result.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 5, pp. 654–662, May, 1992.     

Resolvable Mendelsohn designs with block size 4

Summary Letv andK be positive integers. A (v, k, 1)-Mendelsohn design (briefly (v, k, 1)-MD) is a pair (X,B) whereX is av-set (ofpoints) andB is a collection of cyclically orderedk-subsets ofX (calledblocks) such that every ordered pair of points ofX are consecutive in exactly one block ofB. A necessary condition for the existence of a (v, k, 1)-MD isv(v–1) 0 (modk). If the blocks of a (v, k, 1)-MD can be partitioned into parallel classes each containingv/k blocks wherev ) (modk) or (v – 1)/k blocks wherev 1 (modk), then the design is calledresolvable and denoted briefly by (v, k, 1)-RMD. It is known that a (v, 3,1)-RMD exists if and only ifv 0 or 1 (mod 3) andv 6. In this paper, it is shown that the necessary condition for the existence of a (v, 4, 1)-RMD, namelyv 0 or 1 (mod 4), is also sufficient, except forv = 4 and possibly exceptingv = 12. These constructions are equivalent to a resolvable decomposition of the complete symmetric directed graphK _v ^* onv vertices into 4-circuits.Research supported by the Natural Sciences and Engineering Research Council of Canada under Grant A-5320.     

On a property of symmetric designs of order n≡2 (mod 4)

Summary U. Ott, during his visit in Rome (spring 1985), by using the theory of even unimodular lattices, proved that a (v,k,) symmetric design of order n2 (mod 4) satisfies the congruence v ±1 (mod 8). He asked me the question whether this is a consequence of the Bruck-Ryser-Chowla's theorem or not. In this paper we prove that the answer to this question is affirmative. As a consequence of this, we have that the conjecture according to which the Bruck-Ryser-Chowla's theorem and the identity k²–v=n imply the existence of a (v,k,) symmetric design is still open.     

Non-symmetric 2-designs modulo 2

Necessary conditions are obtained for the existence of a 2 – (v, k, ) design, for which the block intersection sizess ₁,s ₂, ...,s _n satisfys ₁ s ₂ ... s _n s (mod 2 ^e ), wheree is odd. These conditions are obtained by combining restrictions on the Smith Normal Form of the incidence matrix of the design with some well known properties of self-orthogonal binary codes with all weights divisible by 4.Research done at AT&T Bell Laboratories.     

Der numerische Wert gewisser Reihen

In this paper we compute the values of series of the form if k N is add. This was done by Glaisher [4] if k1 (mod 4), but if k 3 (mod 4) the result seems to be new.     

Odd Systems of Vectors and Related Lattices

We consider uniform odd systems, i.e. sets of vectors of constant odd norm with odd inner product, and the lattice L(V) linearly generated by a uniform odd system V of odd norm 2t+1. If uu p (mod 4) for all u V, one has v² p (mod 4) if v² is odd and v² 0 (mod 4) if v² is even, for any vector v L(V). The vectors of even norm form a double even sublattice L₀(V) of L(V), i.e. is an even lattice. The closure of V, i.e. all vectors of L(V) of norm 2t+1, are minimal vectors of L(V) for t=1, and they are almost always minimal for t=2. For such t, the convex hull of vectors of the closure of V is an L-polytope of L₀V and the contact polytope of L(V). As an example, we consider closed uniform odd systems of norm 5 spanning equiangular lines.     

Blocking Sets in (υ,{2, 4}, 1)-Designs

The existence of blocking sets in (, {2, 4}, 1)-designs is examined. We show that for 0, 3, 5, 6, 7, 8, 9, 11 (mod 12>), blocking sets cannot exist. We prove that for each 1, 2, 4 (mod 12) there is a (, {2, 4}, 1)-design with a blocking set with three possible exceptions. The case 10 (mod 12) is still open; we consider the first four values of in this situation.     

On the existence of super-simple designs with block size 4

Summary We prove that forv = 1 and for allv 1 (mod 3),v 10, there is a (v, 4, 4) design with the property that no triple appears in more than one block. The proof of this result is made more difficult by the non-existence of a GDD (4, 4, 3; 15) with no triple appearing in more than one block. We also show that forv = 1 and for allv 1, 4 (mod 12),v 13, there is a (v, 4, 2) design with this property, and with the additional property that the design is the union of two (v, 4, 1) designs.     

Quasi-symmetric designs and the Smith Normal Form

We obtain necessary conditions for the existence of a 2 – (, k, ) design, for which the block intersection sizes s ₁, s ₂, ..., s _n satisfy s ₁ s ₂ ... s _n s (mod p ^e ),where p is a prime and the exponent e is odd. These conditions are obtained from restriction on the Smith Normal Form of the incidence matrix of the design. We also obtain restrictions on the action of the automorphism group of a 2 – (, k, ) design on points and on blocks.     

Extendability of Ternary Linear Codes

There are four diversities for which ternary linear codes of dimension k 3, minimum distance d with gcd(3,d) = 1 are always extendable. Moreover, three of them yield double extendability when d 1 (mod 3). All the diversities are found for ternary linear codes of dimension 3 k 6. An algorithm how to find an extension from a generator matrix is also given.This research has been partially supported by Grant-in-Aid for Scientific Research of the Ministry of Education under Contract Number 304-4508-12640137     

Isomorphismen von rechtseiträumen

Spaces called rectangular spaces were introduced in [5] as incidence spaces (P,G) whose set of linesG is equipped with an equivalence relation and whose set of point pairs P² is equipped with a congruence relation , such that a number of compatibility conditions are satisfied. In this paper we consider isomorphisms, automorphisms, and motions on the rectangular spaces treated in [5]. By an isomorphism of two rectangular spaces (P,G, , ) and (P,G, , ) we mean a bijection of the point setP onto P which maps parallel lines onto parallel lines and congruent points onto congruent points. In the following, we consider only rectangular spaces of characteristic 2 or of dimension two. According to [5] these spaces can be embedded into euclidean spaces. In case (P,G, , ) is a finite dimensional rectangular space, then every congruence preserving bijection ofP onto P is in fact an isomorphism from (P,G, , ) onto (P,G, , ) (see (2.4)). We then concern ourselves with the extension of isomorphisms. Our most important result is the theorem which states that any isomorphism of two rectangular spaces can be uniquely extended to an isomorphism of the associated euclidean spaces (see (3.2)). As a consequence the automorphisms of a rectangular space (P,G, , ) are precisely the restrictions (onP) of the automorphisms of the associated euclidean space which fixP as a whole (see (3.3)). Finally we consider the motions of a rectangular space (P,G, , ). By a motion of(P. G,, ) we mean a bijection ofP which maps lines onto lines, preserves parallelism and satisfies the condition((x), (y)) (x,y) for allx, y P. We show that every motion of a rectangular space can be extended to a motion of the associated euclidean space (see (4.2)). Thus the motions of a rectangular space (P,G, , ) are seen to be the restrictions of the motions of the associated euclidean space which mapP into itself (see (4.3)). This yields an explicit representation of the motions of any rectangular plane (see (4.4)).

---

---

Herrn Professor Burau zum 85. Geburtstag gewidmet     

Element neighbourhoods in twofold triple systems

The method of differences is used to establish that every 2-regular multigraph onv– 10,2 (mod 3) points occurs as the neighbourhood graph of an element in a twofold triple system of orderv, with two exceptions: C₂C₃and C₃C₃.Dedicated to Professor Hanfried Lenz on the occasion of his seventieth birthday     

Über die Quadratwurzel-Schranke für Quadratische-Rest-Codes

The minimal distanced of any QR-Code of lengthn 3mod4 over a prime fieldGF (p) with p3 mod4 satisfies the improved square root bound d(3d-2)4(n–1).

---

---

Helmut Karzel zum 60. Geburtstag gewidmet     

A note on the global asymptotic stability of the unreacting state in a simple model for quadratic autocatalysis with linear decay

In this note we consider a reaction-diffusion problem which describes a simple model chemical reaction scheme for quadratic autocatalysis with linear decay. We show that withk>1 (wherek is a parameter measuring the relative strength of the decay step to the autocatalytic step) the dimensionless unreacting state 1, 0 is globally asymptotically stable, with 1+0(t ^–1/2) and 0(t ^–1/2 e ^–(k–1)t) ast-. Here and are the concentrations of the reactant and the autocatalyst respectively, andt is time. The casek<1 has been considered in detail by Merkin et al. [1].     

Optimal cycles in doubly weighted graphs and approximation of bivariate functions by univariate ones

Summary The problem of finding optimal cycles in a doubly weighted directed graph (Problem A) is closely related to the problem of approximating bivariate functions by the sum of two univariate functions with respect to the supremum norm (Problem B). The close relationship between Problem A and Problem B is detected by the characterization (7.4) of the distance dist (f, t) of Problem B.In Part 1 we construct an algorithm for Problem A where the essential role is played by the minimal lengthsy _j(k) defined by (2.3). If weight functiont1 then the minimum of Problem A is computed by equality (2.4). Ift1 then the minimum is obtained by a binary search procedure, Algorithm 3.In Part 2 we construct our algorithms for solving Problem B by following exactly the ideas of Part 1. By Algorithm 4 we compute the minimal pseudolengthsh _k(y, M) defined by (7.5). If weight functiont1 then the infimum dist(f,t) of Problem B is obtained by equality (7.12) which is closely related to (2.4). Ift1 we compute the infimum dist(f,t) by the binary search procedure Algorithm 5.Additionally, Algorithm 4 leads to a constructive proof of the existence of continuous optimal solutions of Problem B (see Theorem 7.1e) which is already known in caset1 but unknown in caset1.Interesting applications to the steady-state behaviour of industrial processes with interference (Sect. 3) and the solution of integral equations (Problem C) are included.Supported by Deutsche Forschungsgemeinschaft Grant No. GO 270/3     

P 3-factorization of complete multipartite graphs

In this paper, it is shown that a necessary and sufficient condition for the existence of aP ₃-factorization ofK _m ⁿ is (i)mn 0(mod 3) and (ii) (m – 1)n 0(mod 4).     

Characterization of complete exterior sets of conics

Let be a set of exterior points of a nondegenerate conic inPG(2,q) with the property that the line joining any 2 points in misses the conic. Ifq1 (mod 4) then consists of the exterior points on a passant, ifq3 (mod 4) then other examples exist (at least forq=7, 11, ..., 31).Support from the Dutch organization for scientific Research (NWO) is gratefully acknowledged     

Zerlegung total gerichteter Graphen in Kreise

The following statements are valid:The complete directed graph ¯K_n, n1 (mod 2p), is decomposable into directed 2p-cycles.The complete directed bipartite graph ¯K_m,n is decomposable into 2p-cycles if p is a divisor of m and np.If p is a prime, then this condition is necessary, too.The complete directed graph ¯K_n, n12, is decomposable into 6-cycles if and only if 6