Simplicity of lie module triple systems

We analyze how certain constructions of Lie module triple systems affect the structure theory, particularly simplicity. We are thus able to show that there is no upper bound on the number of summands in a direct sum decomposition of a simple Lie module triple system as a module for its inner derivation algebra.     

Nonlinear skew lie triple derivations between factors

Let A be a factor.For A,B∈A,define by [A,B]_*=AB-BA~* the skew Lie product of A and B.In this article,it is proved that a map Φ:A→A satisfies Φ([[A,B]_*,C]_*)=[[Φ(A),B]_*,C]_w+[[A,Φ(B)]_*,C]_*+[[A,B]_*,Φ(C)]_* for all A,B,C∈A if and only if Φ is an additive *-derivation.     

The module theory of semisymmetric quasigroups,totally symmetric quasigroups,and triple systems

Journal of Algebraic Combinatorics - This paper initiates a unified module theory for four varieties of quasigroups: semisymmetric, semisymmetric idempotent, totally symmetric, and totally...     

Embedding Steiner triple systems in hexagon triple systems

A hexagon triple is the graph consisting of the three triangles (triples) {a,b,c},{c,d,e}, and {e,f,a}, where a,b,c,d,e, and f are distinct. The triple {a,c,e} is called an inside triple. A hexagon triple system of order n is a pair (X,H) where H is a collection of edge disjoint hexagon triples which partitions the edge set of K_n with vertex set X. The inside triples form a partial Steiner triple system. We show that any Steiner triple system of order n can be embedded in the inside triples of a hexagon triple system of order approximately 3n.     

Integrable systems and lie superalgebras

The point functor allows us to associate with each Lie superalgebra the class of ordinary Lie algebras, composed of its points over Grassman algebras. To these Lie algebras we extend the Alder-Kostant geometric scheme of constructing nonlinear Lax equations.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 123, pp. 92–97, 1983.     

Characterization of affine Steiner triple systems and Hall triple systems

It is known that a Steiner triple system is projective if and only if it does not contain the four-triple configuration C₁₄. We find three configurations such that a Steiner triple system is affine if and only if it does not contain any of these configurations. Similarly, we characterize Hall triple systems, a superclass of affine Steiner triple systems, using two forbidden configurations.     

Embeddings of pure mendelsohn triple systems and pure directed triple systems

It is proved in this article that the necessary and sufficient conditions for the embedding of a λ-fold pure Mendelsohn triple system of order v in λ-fold pure Mendelsohn triple of order u are λu(u ? 1) ≡ 0 (mod 3) and u ? 2v + 1. Similar results for the embeddings of pure directed triple systems are also obtained. © 1995 John Wiley & Sons, Inc.     

Directed triple systems

Directed triple systems are an example of block designs on directed graphs. A block design on a directed graph can be defined as follows. Let G be a directed graph of k vertices which contain no loops. Let S be a set of υ elements. A collection of k-subsets of S with an assignment of the elements of each k-subset to the vertices of G is called a block design on G of order υ if the following is satisfied. Any ordered pair of elements of S is assigned λ times to an edge of G.For example, if S = {a, b, c, d, e} and

and bae; cad; abc; dbe; acd; bce; adb; cde; aed; bec; is a collection of 3-subsets so written that in each subset the first element is assigned to the vertex 1, the second to 2, and the third to 3, then the collection is a block design on G with λ = 1.In this paper, it is shown that for the graph

if λ = 1, then the graph exists for all υ such that ν ? 2 mod 3.     

Translation triple systems

We prove the following result. Let S be a Steiner triple system embedded in the projective plane of order n, such that r=n+1, and such that there exists a line l of exterior to S. Let G be a collineation group of fixing S, fixing l and transitive on the blocks of S. Then n=3 and S=l=AG(2, 3), and G contains the group of translations of S with respect to l.This research was supported by NSERC Grant A3485.     

Indecomposable triple systems

A t-design (λ, t, d, n) is a system $\text{B}$ of sets of size d from an n-set S, such that each t subset of S is contained in exactly λ elements of $\text{B}$. A t-design is indecomposable (written IND(λ, t, d, n)) if there does not exist a subset $\text{B}$ ? $\text{B}$ such that $\text{B}$ is a (λ, t, d, n) for some λ, 1 ? λ < λ. A triple system is a (λ; 2, 3, n). Recursive and constructive methods (several due to Hanani) are employed to show that: (1) an IND(2; 2, 3, n) exists for n ≡ 0, 1 (mod 3), n ? 4 and n ≡ 7 (designs of Bhattacharya are used here), (2) an IND(3; 2, 3, n) exists for n odd, n ? 5, (3) if an IND(λ, 2, 3, n) exists, n odd, then there exists an infinite number of indecomposable triple systems with that λ.     

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}.     

Graph factorization,general triple systems,and cyclic triple systems

In this self-contained exposition, results are developed concerning one-factorizations of complete graphs, and incidence matrices are used to turn these factorization results into embedding theorems on Steiner triple systems. The result is a constructive graphical proof that a Steiner triple system exists for any order congruent to 1 or 3 modulo 6. A pairing construction is then introduced to show that one can also obtain triple systems which are cyclically generated.