Biembedding a Steiner Triple System With a Hamilton Cycle Decomposition of a Complete Graph

We construct a face two‐colourable, blue and green say, embedding of the complete graph in a nonorientable surface in which there are blue faces each of which have a hamilton cycle as their facial walk and green faces each of which have a triangle as their facial walk; equivalently a biembedding of a Steiner triple system of order n with a hamilton cycle decomposition of , for all and . Using a variant of this construction, we establish the minimum genus of nonorientable embeddings of the graph , for where and .     

Small Embeddings of Partial Steiner Triple Systems

It was proved in 2009 that any partial Steiner triple system of order u has an embedding of order v for each admissible . This result is best possible in the sense that, for each , there exists a partial Steiner triple system of order u that does not have an embedding of order v for any . Many partial Steiner triple systems do have embeddings of orders smaller than , but much less is known about when these embeddings exist. In this paper, we detail a method for constructing such embeddings. We use this method to show that each member of a wide class of partial Steiner triple systems has an embedding of order v for at least half (or nearly half) of the orders for which an embedding could exist. For some members of this class we are able to completely determine the set of all orders for which the member has an embedding.     

A Construction of Almost Steiner Systems

Let n, k, and t be integers satisfying . A Steiner system with parameters t, k, and n is a k‐uniform hypergraph on n vertices in which every set of t distinct vertices is contained in exactly one edge. An outstanding problem in Design Theory is to determine whether a nontrivial Steiner system exists for . In this note we prove that for every and sufficiently large n, there exists an almost Steiner system with parameters t, k, and n; that is, there exists a k‐uniform hypergraph on n vertices such that every set of t distinct vertices is covered by either one or two edges.     

On the Possible Automorphism Groups of a Steiner Quintuple System of Order 21

A Steiner system is called a Steiner quintuple systems of order v. The smallest order for which the existence, or otherwise, of a Steiner quintuple system is unknown is 21. In this article, we prove that, if an S(4, 5, 21) exists, the order of its full automorphism group is 1, 2, 3, 4, 5, 6, 7, or 10.     

On reductions for the Steiner Problem in Graphs

Several authors have demonstrated how reductions can be used to improve the efficiency with which the Steiner Problem in Graphs can be solved. Previous reduction algorithms have been largely ad hoc in nature. This paper uses a theory of confluence to show that, in many cases, all maximal reduction sequences are equivalent, gaining insights into the design of reduction algorithms that obtain a maximum degree of reduction.     

Nilpotent Steiner loops of class 2

We describe Steiner loops of nilpotency class 2 and establish the classification of finite 3-generated nilpotent Steiner loops of nilpotency class 2.     

Tight Heffter Arrays Exist for all Possible Values

A tight Heffter array is an matrix with nonzero entries from such that (i) the sum of the elements in each row and each column is 0, and (ii) no element from appears twice. We prove that exist if and only if both m and n are at least 3. If H has the property that all entries are integers of magnitude at most , every row and column sum is 0 over the integers, and H also satisfies ), we call H an integer Heffter array. We show integer Heffter arrays exist if and only if . Finally, an integer Heffter array is shiftable if each row and column contains the same number of positive and negative integers. We show that shiftable integer arrays exists exactly when both are even.     

SET-VALUED EXTENSION OF OPERATORS VIA STEINER SELECTIONS(Ⅱ)-APPLICATIONS TO APPROXIMATION

ＩｎｔｒｏｄｕｃｔｉｏｎＩｎＰａｒｔⅠｏｆｔｈｉｓｓｅｒｉｅｓ (ｓｅｅ [1 ] )ｗｅｐｒｏｐｏｓｅａｍｅｔｈｏｄｔｏｅｘｔｅｎｄａｎｏｐｅｒａｔｏｒＴｄｅｆｉｎｅｄｉｎａｓｐａｃｅｏｆｃｏｎｔｉｎｕｏｕｓｆｕｎｃｔｉｏｎｓｔｏａｎｏｐｅｒａｔｏｒＴ ｄｅｆｉｎｅｄｉｎａｓｐａｃｅｏｆｃｏｎｔｉｎｕｏｕｓｓｅｔ＿ｖａｌｕｅｄｆｕｎｃｔｉｏｎｓ ,ｖｉａＳｔｅｉｎｅｒｓｅｌｅｃｔｉｏｎｓ.Ｗｅｓｔｕｄｙｓｏｍｅｐｒｏｐｅｒｔｉｅｓｏｆｔｈｉｓｅｘｔｅｎｓｉｏｎａｎｄａｌｓｏｗｅａｎａｌｙｚｅｓｏｍｅｒｅｌ…     

GENERALIZATION OF STEINER FORMULAFOR THE HOMOTHETIC MOTIONS ONTHE PLANAR KINEMATICS

The Steiner formula and the mixture area formula given by M(U|¨)ller were expressed under the one-parameter closed planar homothetic motions in the complex sense . Also, using the generalization of Steiner formula, the result of Holditch theorem for homothetic motions is got. In the case of the homothetic scale h≡1 the results given by M(U|¨)ller are obtained as a special case.     

Pasch trades with a negative block

A Steiner triple system of order v, STS(v), may be called equivalent to another STS(v) if one can be converted to the other by a sequence of three simple operations involving Pasch trades with a single negative block. It is conjectured that any two STS(v)s on the same base set are equivalent in this sense. We prove that the equivalence class containing a given system S on a base set V contains all the systems that can be obtained from S by any sequence of well over one hundred distinct trades, and that this equivalence class contains all isomorphic copies of S on V. We also show that there are trades which cannot be effected by means of Pasch trades with a single negative block.