论文信息 - Codes, Lattices, and Steiner Systems

Codes, Lattices, and Steiner Systems

Two classication schemes for Steiner triple systems on 15 points have been proposed recently: one based on the binary code spanned by the blocks, the other on the root system attached to the lattice anely generated by the blocks. It is shown here that the two approaches are equivalent.

Patrick Solé | P. Solé

[1] Paul Erdös,et al. On an Elementary Proof of Some Asymptotic Formulas in the Theory of Partitions , 1942 .

[2] G. Szekeres,et al. SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS (II) , 1953 .

[3] Michel Deza,et al. Once more about 80 Steiner triple systems on 15 points , 1998 .

[4] Irene A. Stegun,et al. Handbook of Mathematical Functions. , 1966 .

[5] A. Odlyzko. Asymptotic enumeration methods , 1996 .

[6] E. F. Assmus. On 2-ranks of Steiner triple systems , 1995 .

[7] K. Knopp. Theory and Application of Infinite Series , 1990 .

[8] G. Hardy,et al. Asymptotic formulae in combinatory analysis , 1918 .

[9] P. Erdös,et al. The distribution of the number of summands in the partitions of a positive integer , 1941 .

[10] G. Szekeres,et al. AN ASYMPTOTIC FORMULA IN THE THEORY OF PARTITIONS , 1951 .

[11] Charles Knessl,et al. Stirling number asymptotics from recursion equations using the ray method , 1991 .

[12] Louise D. Cummings,et al. Complete classification of the triad systems on fifteen elements , 1919 .