Frame Self-orthogonal Mendelsohn Triple Systems

A Mendelsohn triple system of order ν, MTS(ν) for short, is a pair (X, B) where X is a ν-set (of points) and B is a collection of cyclic triples on X such that every ordered pair of distinct points from X appears in exactly one cyclic triple of B. The cyclic triple (a, b, c) contains the ordered pairs (a, b), (b, c) and (c, a). An MTS(ν) corresponds to an idempotent semisymmetric Latin square (quasigroup) of order ν. An MTS(ν) is called frame self-orthogonal, FSOMTS for short, if its associated semisymmetric Latin square is frame self-orthogonal. It is known that an FSOMTS(1 ⁿ ) exists for all n≡1 (mod 3) except n=10 and for all n≥15, n≡0 (mod 3) with possible exception that n=18. In this paper, it is shown that (i) an FSOMTS(2 ⁿ ) exists if and only if n≡0,1 (mod 3) and n>5 with possible exceptions n∈{9, 27, 33, 39}; (ii) an FSOMTS(3 ⁿ ) exists if and only if n≥4, with possible exceptions that n∈{6, 14, 18, 19}. *Research supported by NSFC 10371002 *Partially supported by National Science Foundation under Grant CCR-0098093     

有向Kirkman填充设计的谱

§ 1　IntroductionLet X be a set of v points.A packing(directed packing) of X is a collection of subsets(ordered subsets) of X(called blocks) such that any pair(ordered pair) of distinct pointsfrom X occur together in atmostone block in the collection.A packing(directed packing)is called resolvable ifitsblock setadmitsa partition into parallel classes,each parallel classbeing a partition of the pointset X.A Kirkman triple system KTS(v) is a collection Tof3 -subsets of X(triples) suchthat …     

On the existence of nearly Kirkman triple systems with subsystems

It is proved in this paper that the necessary and sufficient conditions for the existence of an incomplete nearly Kirkman triple system INKTS(u, v) are u ≡ v ≡ 0 (mod 6), u ≥ 3v. As a consequence, we obtain a complete solution to the embedding problem for nearly Kirkman triple systems.      

Vector fields on the real flag manifolds ℝ<Emphasis Type="Italic">F</Emphasis>(1, 1, <Emphasis Type="Italic">n</Emphasis> − 2)

We obtain the span of the real flag manifolds ℝF(1, 1, n−2), n ≥ 3, for the cases n ≡ 2 (mod 4), n ≡ 4 (mod 8) and n ≡ 8 (mod 16) and use the results to deduce that certain Stiefel-Whitney classes of the manifold are zero.      

Tripling Construction for Large Sets of Resolvable Directed Triple Systems

In this paper, we first define a doubly transitive resolvable idempotent quasigroup （DTRIQ）, and show that aDTRIQ of order v exists if and only ifv ≡0（mod3） and v ≠ 2（mod4）. Then we use DTRIQ to present a tripling construction for large sets of resolvable directed triple systems, which improves an earlier version of tripling construction by Kang （J. Combin. Designs, 4 （1996）, 301-321）. As an application, we obtain an LRDTS（4·3^n） for any integer n ≥ 1, which provides an infinite family of even orders.     

On the embeddings of mendelsohn triple systems

It is proved in this paper that there exists an incomplete Mendelsohn triple system IMTS(u,v; λ) if and only ifλ(u-v)(u-2v-1)≡0(mod 3),u≥2v+1 and (u, v, λ) ≠ (6, 1, 1). As a consequence, it is proved that for any given λ≥1, a Mendelsohn triple system MTS (v, λ) can be embedded in an MTS (u, λ) if and only ifλu(u-1)≡0(mod 3) andu≥2v+1. Project supported by the National Natural Science Foundation of China.     

Large sets of pure directed triple systems with index λ

A directed triple system of order v with index λ, briefly by DTS（v,λ）, is a pair （X, B） where X is a v-set and B is a collection of transitive triples （blocks） on X such that every ordered pair of X belongs to λ blocks of B. A simple DTS（v, λ） is a DTS（v, λ） without repeated blocks. A simple DTS（v, ）,） is called pure and denoted by PDTS（v, λ） if （x, y, z） ∈ B implies （z, y, x）, （z, x, y）, （y, x, z）, （y, z, x）, （x, z, y） B. A large set of disjoint PDTS（v, λ）, denoted by LPDTS（v, λ）, is a collection of 3（v - 2）/λ disjoint pure directed triple systems on X. In this paper, some results about the existence for LPDTS（v, λ） are presented. Especially, we determine the spectrum of LPDTS（v, 2）.     

Minimal blocking sets of size 2p – 2 and 2p – 3 in PG(2, p), p prime and p > 5

A general construction of minimal blocking sets of size 2p – 3, where p is a prime and p ≡ 1 (mod 4), p > 5, and of size 2p – 2, where p is a prime and p ≡ 3 (mod 4), p > 5 in PG(2, p) is presented. These blocking sets are all of Rédei type.      

Mirror configurations of points and lines and algebraic surfaces of degree four

We prove that mirror nonsingular configurations of m points and n lines in ℝP ³ exist only for m≤3, n≡0 or 1 (mod 4) and for m=0 or 1 (mod 4), n≡0 (mod 2). In addition, we give an elementary proof of V. M. Kharlamov’s well-known result saying that if a nonsingular surface of degree four in ℝP ³ is noncontractible and has M≥5 components, then it is nonmirror. For the cases M=5, 6, 7 and 8, Kharlamov suggested an elementary proof using an analogy between such surfaces and configurations of M−1 points and a line. Our proof covers the remaining cases M=9, 10. Bibliography: 5 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 231, 1995, pp. 299–308. Translated by N. Yu. Netsvetaev.     

Generalized Bhaskar Rao Designs with Block Size 3 over Finite Abelian Groups

We show that if G is a finite Abelian group and the block size is 3, then the necessary conditions for the existence of a (v,3,λ;G) GBRD are sufficient. These necessary conditions include the usual necessary conditions for the existence of the associated (v,3,λ) BIBD plus λ≡ 0 (mod|G|), plus some extra conditions when |G| is even, namely that the number of blocks be divisible by 4 and, if v = 3 and the Sylow 2-subgroup of G is cyclic, then also λ≡ 0 (mod2|G|).     

On cyclic caps in 4-dimensional projective spaces

For any divisor k of q ⁴−1, the elements of a group of k th-roots of unity can be viewed as a cyclic point set C _k in PG(4,q). An interesting problem, connected to the theory of BCH codes, is to determine the spectrum A(q) of maximal divisors k of q ⁴−1 for which C _k is a cap. Recently, Bierbrauer and Edel [Edel and Bierbrauer (2004) Finite Fields Appl 10:168–182] have proved that 3(q ² + 1)∈A(q) provided that q is an even non-square. In this paper, the odd order case is investigated. It is proved that the only integer m for which m(q ² + 1)∈A(q) is m = 2 for q ≡ 3 (mod 4), m = 1 for q ≡ 1 (mod 4). It is also shown that when q ≡ 3 (mod 4), the cap is complete.      

Further Results on the Existence of Splitting BIBDs and Application to Authentication Codes

Let (v,u×c,λ)-splitting BIBD denote a (v,u×c,λ)-splitting balanced incomplete block design of order v with block size u×c and index λ. Necessary conditions for the existence of a (v,u×c,λ)-splitting BIBD are v≥uc, λ(v−1)≡0 (mod c(u−1)) and λ v(v−1)≡0 (mod (c ² u(u−1))). We show in this paper that the necessary conditions for the existence of a (v,3×3,λ)-splitting BIBD are also sufficient with possible exceptions when (1) (v,λ)∈{(55,1),(39,9k):k=1,2,…}, (2) λ≡0 (mod 54) and v≡0 (mod 2). We also show that there exists a (v,3×4,1)-splitting BIBD when v≡1 (mod 96). As its application, we obtain a new infinite class of optimal 4-splitting authentication codes.     

Hanani triple systems

Hanani triple systems onv≡1 (mod 6) elements are Steiner triple systems having (v−1)/2 pairwise disjoint almost parallel classes (sets of pairwise disjoint triples that spanv−1 elements), and the remaining triples form a partial parallel class. Hanani triple systems are one natural analogue of the Kirkman triple systems onv≡3 (mod 6) elements, which form the solution of the celebrated Kirkman schoolgirl problem. We prove that a Hanani triple system exists for allv≡1 (mod 6) except forv ∈ {7, 13}.     

Existence of Z-cyclic 3PDTWh(<Emphasis Type="Italic">p</Emphasis>) for Prime <Emphasis Type="Italic">p</Emphasis> ≡ 1 (mod 4)

A directed triplewhist tournament on p players over Z _p is said to have the three-person property if no two games in the tournament have three common players. We briefly denote such a design as a 3PDTWh(p). In this paper, we investigate the existence of a Z-cyclic 3PDTWh(p) for any prime p ≡ 1 (mod 4) and show that such a design exists whenever p ≡ 5, 9, 13 (mod 16) and p ≥ 29. This result is obtained by applying Weil’s theorem. In addition, we also prove that a Z-cyclic 3PDTWh(p) exists whenever p ≡ 1 (mod 16) and p < 10, 000 except possibly for p = 257, 769. Gennian Ge’s Research was supported by National Natural Science Foundation of China under Grant No. 10471127, Zhejiang Provincial Natural Science Foundation of China under Grant No. R604001, and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry.     

Orthogonal graphs of characteristic 2 and their automorphisms

The (singular) orthogonal graph O(2ν + δ,q) over a field with q elements and of characteristic 2 (where ν 1, and δ = 0,1 or 2) is introduced. When ν = 1, O(2 · 1,q), O(2 · 1 + 1,q) and O(2 · 1 + 2,q) are complete graphs with 2, q + 1 and q2 + 1 vertices, respectively. When ν 2, O(2ν + δ,q) is strongly regular and its parameters are computed. O(2ν + 1,q) is isomorphic to the symplectic graph Sp(2ν,q). The chromatic number of O(2ν + δ,q) except when δ = 0 and ν is odd is computed and the group of graph automo...     

On vertex-coloring edge-weighting of graphs

A k-edge-weighting w of a graph G is an assignment of an integer weight, w(e) ∈ {1,…,k}, to each edge e. An edge-weighting naturally induces a vertex coloring c by defining c(u) = Σ _e∋u w(e) for every u ∈ V (G). A k-edge-weighting of a graph G is vertex-coloring if the induced coloring c is proper, i.e., c(u) ≠ c(v) for any edge uv ∈ E(G). When k ≡ 2 (mod 4) and k ⩾ 6, we prove that if G is k-colorable and 2-connected, δ(G) ⩾ k − 1, then G admits a vertex-coloring k-edge-weighting. We also obtain several sufficient conditions for graphs to be vertex-coloring k-edge-weighting.      

Decompositions of the 3-uniform hypergraphs <Emphasis Type="Italic">K</Emphasis><Stack><Subscript>v</Subscript><Superscript>(3)</Superscript></Stack> into hypergraphs of a certain type

In this paper, we investigate a generalization of graph decomposition, called hypergraph decomposition. We show that a decomposition of a 3-uniform hypergraph K(3)v into a special kind of hypergraph K(3)4 - e exists if and only if v ≡ 0, 1, 2 (mod 9) and v ≥ 9.     

The Existence of (ν,6, λ)-Perfect Mendelsohn Designs with λ > 1

The basic necessary conditions for the existence of a (v, k, λ)-perfect Mendelsohn design (briefly (v, k, λ)-PMD) are v ≥ k and λ v(v − 1) ≡ 0 (mod k). These conditions are known to be sufficient in most cases, but certainly not in all. For k = 3, 4, 5, 7, very extensive investigations of (v, k, λ)-PMDs have resulted in some fairly conclusive results. However, for k = 6 the results have been far from conclusive, especially for the case of λ = 1, which was given some attention in papers by Miao and Zhu [34], and subsequently by Abel et al. [1]. Here we investigate the situation for k = 6 and λ > 1. We find that the necessary conditions, namely v ≥ 6 and λ v(v − 1)≡0 (mod 6) are sufficient except for the known impossible cases v = 6 and either λ = 2 or λ odd. Researcher F.E. Bennett supported by NSERC Grant OGP 0005320.     

The Spectrum of Tetrahedral Quadruple Systems

An ordered analogue of quadruple systems is tetrahedral quadruple systems. A tetrahedral quadruple system of order v and index λ, TQS(v, λ), is a pair (S, T){(S, \mathcal{T})} where S is a finite set of v elements and T{\mathcal{T}} is a family of oriented tetrahedrons of elements of S called blocks, such that every directed 3-cycle on S is contained in exactly λ blocks of T{\mathcal{T}} . When λ = 1, the spectrum problem of TQS(v, 1) has been completely determined. It is proved that a TQS(v, λ) exists if and only if λ(v − 1)(v − 2) ≡ 0 (mod 3), λv(v − 1)(v − 2) ≡ 0 (mod 4) and v ≥ 4.