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. Highlights? We define equivalence of STS ( v ) s under Pasch trades with a negative block. ? Any 2 STS ( v ) s equivalent under cycle trades are proved equivalent in this sense. ? Any 2 isomorphic STS ( v ) s on the same base set are proved equivalent. ? Over 100 trades on up to 10 blocks can be effected in this way. ? There are trades which cannot be effected in this way.
[1]
A. D. Forbes,et al.
Configurations and trades in Steiner triple systems
,
2004,
Australas. J Comb..
[2]
Mike J. Grannell,et al.
Some new perfect Steiner triple systems
,
1999
.
[3]
Patric R. J. Östergård,et al.
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected
,
2011,
Graphs Comb..
[4]
P. Matthews,et al.
Generating uniformly distributed random latin squares
,
1996
.
[5]
A Markov chain for Steiner triple systems
,
2002
.
[6]
Prince Camille de Polignac.
On a Problem in Combinations
,
1866
.
[7]
Peter Blundell Gibbons,et al.
Computing techniques for the construction and analysis of block designs.
,
1976
.
[8]
Anthony Duncan Forbes.
Configurations and colouring problems in block designs
,
2006
.
[9]
Vladimir D. Tonchev.
Transitive Steiner triple systems of order 25
,
1987,
Discret. Math..
[10]
A. D. Forbes,et al.
On 6-sparse Steiner triple systems
,
2007,
J. Comb. Theory, Ser. A.