activity
20152024
most citedUniform semi-Latin squares and their pairwise-variance aberrations

6 citations · 9 across the 4 of their papers we have counts for

collaborators

6 papers

math.GR2024

The non-synchronizing primitive groups of degree up to 624

Leonard H. Soicher

We describe the methods and results of a classification of the non-synchronizing primitive permutation groups of degree up to 624. We make use of theory and computation to determin…

math.ST2020★ 6 cited

Uniform semi-Latin squares and their pairwise-variance aberrations

R. A. Bailey, Leonard H. Soicher

For integers and , an semi-Latin square is an array of -subsets (called blocks) of an -set (of treatments), such that each treatment o…

stat.ME2019★ 1 cited

Substitutes for the non-existent square lattice designs for 36 varieties

R. A. Bailey, Peter J. Cameron, L. H. Soicher +1

Square lattice designs are often used in trials of new varieties of various agricultural crops. However, there are no square lattice designs for 36 varieties in blocks of size six…

math.CO2016

There is No McLaughlin Geometry

Patric R. J. Östergård, Leonard H. Soicher

We determine that there is no partial geometry with parameters . The existence of such a geometry has been a challenging open problem of interest to re…

math.CO2016

On the clique number of a strongly regular graph

Gary R. W. Greaves, Leonard H. Soicher

We determine new upper bounds for the clique numbers of strongly regular graphs in terms of their parameters. These bounds improve on the Delsarte bound for infinitely many feasibl…

math.CO2015★ 2 cited

The uniqueness of a distance-regular graph with intersection array {32,27,8,1;1,4,27,32} and related results

Leonard H. Soicher

It is known that, up to isomorphism, there is a unique distance-regular graph with intersection array {32,27;1,12} (equivalently, is the unique strongly regular graph with…