Abstract
A formula is found for the total number of distinct Steiner triple systems on 2n−1 points whose 2-rank is one higher than the possible minimum 2n−n−1. The formula can be used for deriving bounds on the number of pairwise nonisomorphic systems for large n, and for the classification of all nonisomorphic systems of small orders. It is proved that the number of nonisomorphic Steiner triple systems on 2n−1 points of 2-rank 2n−n grows exponentially.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
