Constructing Random Steiner Triple Systems: An Experimental Study

Daniel Heinlein; Patric Östergård

doi:10.1007/978-3-031-48679-1_9

Constructing Random Steiner Triple Systems: An Experimental Study

Daniel Heinlein, Patric Östergård

Department of Information and Communications Engineering

Research output: Chapter in Book/Report/Conference proceeding › Chapter › Scientific › peer-review

Abstract

Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson’s hill-climbing algorithm and Cameron’s algorithm, but these are not yet completely understood. Those algorithms, as well as some variants, are here assessed for STSs of both small and large orders. For large orders, the number of occurrences of certain configurations in the constructed STSs is compared with the corresponding expected values of random hypergraphs. Modifications of the algorithms are proposed.

Original language	English
Title of host publication	New Advances in Designs, Codes and Cryptography
Publisher	Springer
Pages	155-176
Number of pages	22
ISBN (Electronic)	978-3-031-48679-1
ISBN (Print)	978-3-031-48678-4
DOIs	https://doi.org/10.1007/978-3-031-48679-1_9
Publication status	Published - 2024
MoE publication type	A3 Book section, Chapters in research books
Event	Stinson66 - New Advances in Designs, Codes and Cryptography - Toronto, Canada Duration: 13 Jun 2022 → 17 Jun 2022

Conference

Conference	Stinson66 - New Advances in Designs, Codes and Cryptography
Country/Territory	Canada
City	Toronto
Period	13/06/2022 → 17/06/2022

Access to Document

10.1007/978-3-031-48679-1_9

https://arxiv.org/pdf/2208.12057.pdf

Cite this

@inbook{52df878082f74106a2a4d379da85c8d4,

title = "Constructing Random Steiner Triple Systems: An Experimental Study",

abstract = "Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson{\textquoteright}s hill-climbing algorithm and Cameron{\textquoteright}s algorithm, but these are not yet completely understood. Those algorithms, as well as some variants, are here assessed for STSs of both small and large orders. For large orders, the number of occurrences of certain configurations in the constructed STSs is compared with the corresponding expected values of random hypergraphs. Modifications of the algorithms are proposed.",

author = "Daniel Heinlein and Patric {\"O}sterg{\aa}rd",

year = "2024",

doi = "10.1007/978-3-031-48679-1_9",

language = "English",

isbn = "978-3-031-48678-4",

pages = "155--176",

booktitle = "New Advances in Designs, Codes and Cryptography",

publisher = "Springer",

address = "Germany",

note = "Stinson66 - New Advances in Designs, Codes and Cryptography ; Conference date: 13-06-2022 Through 17-06-2022",

}

TY - CHAP

T1 - Constructing Random Steiner Triple Systems: An Experimental Study

AU - Heinlein, Daniel

AU - Östergård, Patric

PY - 2024

Y1 - 2024

N2 - Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson’s hill-climbing algorithm and Cameron’s algorithm, but these are not yet completely understood. Those algorithms, as well as some variants, are here assessed for STSs of both small and large orders. For large orders, the number of occurrences of certain configurations in the constructed STSs is compared with the corresponding expected values of random hypergraphs. Modifications of the algorithms are proposed.

AB - Several methods for generating random Steiner triple systems (STSs) have been proposed in the literature, such as Stinson’s hill-climbing algorithm and Cameron’s algorithm, but these are not yet completely understood. Those algorithms, as well as some variants, are here assessed for STSs of both small and large orders. For large orders, the number of occurrences of certain configurations in the constructed STSs is compared with the corresponding expected values of random hypergraphs. Modifications of the algorithms are proposed.

UR - http://www.scopus.com/inward/record.url?scp=85191348967&partnerID=8YFLogxK

U2 - 10.1007/978-3-031-48679-1_9

DO - 10.1007/978-3-031-48679-1_9

M3 - Chapter

SN - 978-3-031-48678-4

SP - 155

EP - 176

BT - New Advances in Designs, Codes and Cryptography

PB - Springer

T2 - Stinson66 - New Advances in Designs, Codes and Cryptography

Y2 - 13 June 2022 through 17 June 2022

ER -

Constructing Random Steiner Triple Systems: An Experimental Study

Abstract

Conference

Access to Document

Other files and links

Fingerprint

SubspaceCodes: Constructions and Classifications of Subspace Codes and Related Structures for Communication Networks

Cite this

Constructing Random Steiner Triple Systems: An Experimental Study

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Projects

SubspaceCodes: Constructions and Classifications of Subspace Codes and Related Structures for Communication Networks

Cite this