Existence of 1-Rotational <Emphasis Type="Italic">k</Emphasis>-Cycle Systems of the Complete Graph

We explicitly solve the existence problem for 1-rotational k-cycle systems of the complete graph K_v with v1 or k (mod 2k). For v1 (mod 2k) we have existence if and only if k is an odd composite number. For any odd k and vk (mod 2k), (except k3 and v15, 21 (mod 24)) a 1-rotational k-cycle system of K_v exists.Final version received: June 18, 2003     

Generalized Steiner Systems GS(2, 4, v, 2) with v a Prime Power ≡ 7 (mod 12)

Generalized Steiner systems GS(2, 4, v, g) were first introduced by Etzion and were used to construct optimal constant weight codes over an alphabet of size g + 1 with minimum Hamming distance 5, in which each codeword has length v and weight 4. Etzion conjectured that the necessary conditions v 1 (mod 3) and v ; 7 are also sufficient for the existence of a GS(2,4,v,2). Except for the example of a GS(2,4,10,2) and some recursive constructions given by Etzion, nothing else is known about this conjecture. In this paper, Weil's theorem on character sum estimates is used to show that the conjecture is true for any prime power v 7 (mod 12) except v = 7, for which there does not exist a GS(2,4,7,2).     

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.     

Some properties of the riesz charge associated with a δ-subharmonic function

The first property is a refinement of earlier results of Ch. de la Vallée Poussin, M. Brelot, and A. F. Grishin. Let w=u–v with u, v superharmonic on a suitable harmonic space (for example an open subset of R ⁿ ), and let [w]=[u]–[v] denote the associated Riesz charge. If w0, and if E denotes the set of those points of at which the lim inf of w in thefine topology is 0, then the restriction of [w] to E is 0. Another property states that, if e denotes a polar subset of such that the fine lim inf of |w| at each point of e is finite, then the restriction of [w] to e is 0.     

Incomplete idempotent Schröder quasigroups and related packing designs

Summary In this paper it is proved that, for any positive integern 2, 3 (mod 4),n 7, there exists an incomplete idempotent Schröder quasigroup with one hole of size two IISQ(n, 2) except forn = 10. It is also proved that for any positive integern 0, 1 (mod 4), there exists an idempotent Schröder quasigroup ISQ(n) except forn = 5 and 9. These results completely determine the spectrum of ISQ(n) and provide an application to the packing of a class of edge-coloured block designs.Research supported by NSERC grant A-5320.Research supported by NSFC grant 19231060-2.     

Cyclic Steiner Quadruple Systems and Köhler's orbit graphs

In this article we are concerned with the problem of the existence of strictly cyclic Steiner Quadruple Systems sSQS(v), where v 2, 10 (24). E. Köhler (cf. (Köhler 1978)) used an orbit graph approach to handle such systems and obtained the result that in case p is a prime number with p 53, 77 (120) then sSQS(v) exists provided that the associated orbit graph OKG(p) is bridgeless. We continue these investigations by classifying the orbit graphs OKG(p) with p 5 (12), where the ones with p 53, 77 (120) constitute one out of four classes and thus show that sSQS(2p), p 5 (12) exists if OKG(p) or a reduced graph of it is bridgeless by discussing the four classes separately. Subsequent to this discussion we use the proof of Theorem 2 (Siemon 1991) to state that the bridgelessness of the graphs in all classes is equivalent to the number theoretic claim (3.1).Dedicated to Hanfried Lenz on the occasion of his 75th birthday.     

Symmetric balanced ternary designs with ϱ1 = 1 or 2

Summary We prove the following two non-existence theorems for symmetric balanced ternary designs. If ₁ = 1 and 0 (mod 4) then eitherV = + 1 or 4₂ – + 1 is a square and (4₂ – + 1) divides ² – 1. If ₁ = 2 thenV = ((m + 1)/2) ² + 2,K = (m ² + 7)/4 and = ((m – 1)/2)² + 1 wherem 3 (mod 4). An example belonging to the latter series withV = 18 is constructed.     

Two combinatorial problems on posets

Bialostocki proposed the following problem: Let nk2 be integers such that k|n. Let p(n, k) denote the least positive integer having the property that for every poset P, |P|p(n, k) and every Z _k -coloring f: P Z _k there exists either a chain or an antichain A, |A|=n and _aA f(a) 0 (modk). Estimate p(n, k). We prove that there exists a constant c(k), depends only on k, such that (n+k–2)²–c(k) p(n, k) (n+k–2)²+1. Another problem considered here is a 2-dimensional form of the monotone sequence theorem of Erdös and Szekeres. We prove that there exists a least positive integer f(n) such that every integral square matrix A of order f(n) contains a square submatrix B of order n, with all rows monotone sequences in the same direction and all columns monotone sequences in the same direction (direction means increasing or decreasing).     

Semiregular Large Sets

We develop the notion of t-homogeneous, G-semiregular large sets of t-designs, show that there are infinitely many 3-homogeneous PSL(2, q)-semiregular large sets when q 3 mod 4, two sporadic 3-homogeneous AL(1,32)-semiregular large sets, and no other interesting t-homogeneous G-semiregular large sets for t 3.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

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.     

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     

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.     

A survey of pseudo (v,k, λ)-designs

This work is an attempt to give a complete survey of all known results about pseudo (v, k, )-designs. In doing this, the author hopes to bring more attention to his conjecture given in Section 6; an affirmative answer to this conjecture would settle completely the existence and construction problem for a pseudo (v, k, )-design in terms of the existence of an appropriate (v, k, )-design.     

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     

Zur Aufllösung linearer homogener Differentialgleichungen 2. Ordnung

Summary By the transformationy(x)=v(u),u = exp (–G(x) dx) dx the differential equationDy+G(x)y+H(x)y=0 turns toT(u) ² v ^**+H v=0, wherev ^** signifiesd ² v/du ², andu=du/dx andH=H(x) should be expressed as functions ofu.From the solutionv(u) ofT follows immediately the solutiony(x) ofD, and vice versa.In this paper there are treated some of the types of differential equations, that may be solved by this method.     

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.     

Dense graphs and edge reconstruction

By a well-known result of Nash-Williams if a graphG is not edge reconstructible, then for all ,|A||E(G)| mod 2 we have a permutation ofV(G) such thatE(G)E(G)=A. Here we construct infinitely many graphsG having this curious property and more than edges.Research (partially) supported by Hungarian National Foundation for Scientific Research Grant No.T016389.     

Weakly union-free maximum packings

Frankl and Füredi [11] established that the largest number of 3-subsets of ann-set, for which no four distinct setsA,B,D satisfyAB=CD, is at most . Chee, Colbourn, and Ling [6] established that this upper bound is met with few exceptions whenn0, 1 (mod 3). In this paper, it is established that the upper bound is also met with few exceptions whenn2 (mod 3).The research was supported in part by the US Army Research Office under Grant DAAG55-98-1-0272.