The Cyclically Resolvable Steiner Triple Systems of Order 57

A resolution of a Steiner triple system of order v (STS(v)) is point-cyclic if it has an automorphism permuting the points in one cycle. An STS(v) is cyclically resolvable if it has at least one point-cyclic resolution. Cyclically resolvable STS(v)s have important applications in Coding Theory. They have been classified up to v=45 and before the present work v=57 was the first open case. There are 2,353,310 cyclic STS(57)s. We establish that 155,966 of them are cyclically resolvable yielding 3,638,984 point-cyclic resolutions which we classify with respect to their automorphism groups and to the availability of some configurations.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2025-01-10
DOI
https://doi.org/10.3390/math13020212
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

The Cyclically Resolvable Steiner Triple Systems of Order 57

Svetlana Topalova, Stela Zhelezova
Mathematics
Coding theory and cryptography
article

The Cyclically Resolvable Steiner Triple Systems of Order 57

Svetlana Topalova, Stela Zhelezova
article en

Abstract

A resolution of a Steiner triple system of order v (STS(v)) is point-cyclic if it has an automorphism permuting the points in one cycle. An STS(v) is cyclically resolvable if it has at least one point-cyclic resolution. Cyclically resolvable STS(v)s have important applications in Coding Theory. They have been classified up to v=45 and before the present work v=57 was the first open case. There are 2,353,310 cyclic STS(57)s. We establish that 155,966 of them are cyclically resolvable yielding 3,638,984 point-cyclic resolutions which we classify with respect to their automorphism groups and to the availability of some configurations.

MathematicsVol. 13(2)
Bulgarian Academy of Sciences (BG), Institute of Mathematics and Informatics (BG)
Bulgarian National Science Fund
Openalex Percentile: Top 100%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

The Cyclically Resolvable Steiner Triple Systems of Order 57 — Svetlana Topalova, Stela Zhelezova · Mathematics (2025) | TGRS Research Map | TGRS