{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:52:29Z","timestamp":1776797549273,"version":"3.51.2"},"reference-count":28,"publisher":"American Mathematical Society (AMS)","issue":"296","license":[{"start":{"date-parts":[[2016,4,7]],"date-time":"2016-04-07T00:00:00Z","timestamp":1459987200000},"content-version":"am","delay-in-days":366,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>\n                    A Steiner triple system of order\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"v\">\n                        <mml:semantics>\n                          <mml:mi>v<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">v<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    , an STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"v\">\n                        <mml:semantics>\n                          <mml:mi>v<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">v<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ), is a set of\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"3\">\n                        <mml:semantics>\n                          <mml:mn>3<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">3<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    -element subsets, called blocks, of a\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"v\">\n                        <mml:semantics>\n                          <mml:mi>v<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">v<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    -element set of points, such that every pair of distinct points occurs in exactly one block. A subsystem of order\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"w\">\n                        <mml:semantics>\n                          <mml:mi>w<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">w<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    in an STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"v\">\n                        <mml:semantics>\n                          <mml:mi>v<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">v<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ), a sub-STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"w\">\n                        <mml:semantics>\n                          <mml:mi>w<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">w<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ), is a subset of blocks that forms an STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"w\">\n                        <mml:semantics>\n                          <mml:mi>w<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">w<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ). Constructive and nonconstructive techniques for enumerating up to isomorphism the STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"v\">\n                        <mml:semantics>\n                          <mml:mi>v<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">v<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ) that admit at least one sub-STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"w\">\n                        <mml:semantics>\n                          <mml:mi>w<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">w<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ) are presented here for general parameters\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"v\">\n                        <mml:semantics>\n                          <mml:mi>v<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">v<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    and\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"w\">\n                        <mml:semantics>\n                          <mml:mi>w<\/mml:mi>\n                          <mml:annotation encoding=\"application\/x-tex\">w<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    . The techniques are further applied to show that the number of isomorphism classes of STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"21\">\n                        <mml:semantics>\n                          <mml:mn>21<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">21<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    )s with at least one sub-STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"9\">\n                        <mml:semantics>\n                          <mml:mn>9<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">9<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ) is\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"12661527336\">\n                        <mml:semantics>\n                          <mml:mn>12661527336<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">12661527336<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    and of STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"27\">\n                        <mml:semantics>\n                          <mml:mn>27<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">27<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    )s with a sub-STS(\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"13\">\n                        <mml:semantics>\n                          <mml:mn>13<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">13<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    ) is\n                    <inline-formula content-type=\"math\/mathml\">\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" alttext=\"1356574942538935943268083236\">\n                        <mml:semantics>\n                          <mml:mn>1356574942538935943268083236<\/mml:mn>\n                          <mml:annotation encoding=\"application\/x-tex\">1356574942538935943268083236<\/mml:annotation>\n                        <\/mml:semantics>\n                      <\/mml:math>\n                    <\/inline-formula>\n                    .\n                  <\/p>","DOI":"10.1090\/mcom\/2945","type":"journal-article","created":{"date-parts":[[2015,4,7]],"date-time":"2015-04-07T10:56:21Z","timestamp":1428404181000},"page":"3051-3067","source":"Crossref","is-referenced-by-count":5,"title":["Enumeration of Steiner triple systems with subsystems"],"prefix":"10.1090","volume":"84","author":[{"given":"Petteri","family":"Kaski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patric","family":"\u00d6sterg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandru","family":"Popa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2015,4,7]]},"reference":[{"issue":"7","key":"1","doi-asserted-by":"publisher","first-page":"1414","DOI":"10.1016\/j.jcta.2012.03.013","article-title":"On triple systems and strongly regular graphs","volume":"119","author":"Behbahani, Majid","year":"2012","journal-title":"J. Combin. Theory Ser. A","ISSN":"https:\/\/id.crossref.org\/issn\/0097-3165","issn-type":"print"},{"key":"2","unstructured":"G. Brunel, Sur les deux syst\u00e8mes de triades de trieze \u00e9l\u00e9ments, Journal de Math\u00e9matiques Pures et Appliqu\u00e9es, Cinqui\u00e8me S\u00e9rie 7 (1901), 305\u2013330."},{"key":"3","doi-asserted-by":"crossref","unstructured":"C. J. Colbourn, J. H. Dinitz, and I. M. Wanless, Latin squares, In C. J. Colbourn and J. H. Dinitz, editors, Handbook of Combinatorial Designs, pages 135\u2013152. Chapman & Hall\/CRC, Boca Raton, FL, 2007.","DOI":"10.1201\/9781420010541"},{"issue":"1","key":"4","doi-asserted-by":"publisher","first-page":"Research Paper 98, 30","DOI":"10.37236\/370","article-title":"Properties of the Steiner triple systems of order 19","volume":"17","author":"Colbourn, Charles J.","year":"2010","journal-title":"Electron. J. Combin."},{"issue":"1","key":"5","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1002\/(sici)1520-6610(2000)8:1<58::aid-jcd8>3.0.co;2-2","article-title":"Steiner triple systems with disjoint or intersecting subsystems","volume":"8","author":"Colbourn, Charles J.","year":"2000","journal-title":"J. Combin. Des.","ISSN":"https:\/\/id.crossref.org\/issn\/1063-8539","issn-type":"print"},{"key":"6","series-title":"Oxford Mathematical Monographs","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198535768.001.0001","volume-title":"Triple systems","author":"Colbourn, Charles J.","year":"1999","ISBN":"https:\/\/id.crossref.org\/isbn\/0198535767"},{"key":"7","doi-asserted-by":"crossref","unstructured":"F. N. Cole, L. D. Cummings, and H. S. White, The complete enumeration of triad systems in 15 elements, Proceedings of the National Academy of Sciences of the United States of America, 3 (1917), 197\u2013199.","DOI":"10.1073\/pnas.3.3.197"},{"key":"8","unstructured":"V. De Pasquale, Sui sistemi ternari di 13 elementi, Rendiconti. Reale Istituto Lombardo di Science e Lettere. Serie II. 32 (1899), 213\u2013221."},{"key":"9","unstructured":"R. D\u00e9herder, Recouvrements, PhD thesis, Universit\u00e9 Libre de Bruxelles, 1976."},{"key":"10","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(73)90139-8","article-title":"Embeddings of Steiner triple systems","volume":"5","author":"Doyen, Jean","year":"1973","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"key":"11","isbn-type":"print","first-page":"131","article-title":"Constructive enumeration of combinatorial objects","author":"Farad\u017eev, I. A.","year":"1978","ISBN":"https:\/\/id.crossref.org\/isbn\/2222020700"},{"issue":"274","key":"12","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1090\/S0025-5718-2010-02420-2","article-title":"The number of Latin squares of order 11","volume":"80","author":"Hulpke, Alexander","year":"2011","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"5","key":"13","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1002\/jcd.1016","article-title":"There exists no (15,5,4) RBIBD","volume":"9","author":"Kaski, Petteri","year":"2001","journal-title":"J. Combin. Des.","ISSN":"https:\/\/id.crossref.org\/issn\/1063-8539","issn-type":"print"},{"issue":"248","key":"14","doi-asserted-by":"publisher","first-page":"2075","DOI":"10.1090\/S0025-5718-04-01626-6","article-title":"The Steiner triple systems of order 19","volume":"73","author":"Kaski, Petteri","year":"2004","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"15","doi-asserted-by":"publisher","first-page":"Research Paper 2, 25","DOI":"10.37236\/1899","article-title":"One-factorizations of regular graphs of order 12","volume":"12","author":"Kaski, Petteri","year":"2005","journal-title":"Electron. J. Combin."},{"key":"16","series-title":"Algorithms and Computation in Mathematics","isbn-type":"print","volume-title":"Classification algorithms for codes and designs","volume":"15","author":"Kaski, Petteri","year":"2006","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540289906"},{"issue":"2","key":"17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/jcd.20188","article-title":"There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of \ud835\udc3e\u2081\u2084","volume":"17","author":"Kaski, Petteri","year":"2009","journal-title":"J. Combin. Des.","ISSN":"https:\/\/id.crossref.org\/issn\/1063-8539","issn-type":"print"},{"issue":"13","key":"18","doi-asserted-by":"publisher","first-page":"2732","DOI":"10.1016\/j.disc.2006.06.038","article-title":"Steiner triple systems of order 19 and 21 with subsystems of order 7","volume":"308","author":"Kaski, Petteri","year":"2008","journal-title":"Discrete Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0012-365X","issn-type":"print"},{"key":"19","series-title":"Algorithms and Combinatorics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-11167-3","volume-title":"Applied finite group actions","volume":"19","author":"Kerber, Adalbert","year":"1999","ISBN":"https:\/\/id.crossref.org\/isbn\/3540659412","edition":"2"},{"key":"20","unstructured":"D. E. Knuth, Dancing links, In J. Davies, B. Roscoe, and J. Woodcock, editors, Millennial Perspectives in Computer Science, pages 187\u2013214, Palgrave, Basingstoke, England, 2000."},{"key":"21","unstructured":"R. Mathon and A. Rosa, 2-(\ud835\udc63,\ud835\udc58,\ud835\udf06) designs of small order, In C. J. Colbourn and J. H. Dinitz, editors, Handbook of Combinatorial Designs, pages 25\u201358. Chapman & Hall\/CRC, Boca Raton, FL, 2007."},{"key":"22","unstructured":"B. D. McKay. nauty User\u2019s Guide (Version 1.5), Technical Report TR-CS-90-02, Computer Science Department, Australian National University, Canberra, 1990."},{"issue":"2","key":"23","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","article-title":"Isomorph-free exhaustive generation","volume":"26","author":"McKay, Brendan D.","year":"1998","journal-title":"J. Algorithms","ISSN":"https:\/\/id.crossref.org\/issn\/0196-6774","issn-type":"print"},{"issue":"2","key":"24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/jcd.20105","article-title":"Small Latin squares, quasigroups, and loops","volume":"15","author":"McKay, Brendan D.","year":"2007","journal-title":"J. Combin. Des.","ISSN":"https:\/\/id.crossref.org\/issn\/1063-8539","issn-type":"print"},{"key":"25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0167-5060(08)70325-X","article-title":"Every one a winner or how to avoid isomorphism search when cataloguing combinatorial configurations","volume":"2","author":"Read, Ronald C.","year":"1978","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"26","first-page":"3","article-title":"Equidistant \ud835\udc5e-ary codes with maximal distance and resolvable balanced incomplete block designs","volume":"4","author":"Semakov, N. V.","year":"1968","journal-title":"Problemy Pereda\\v{c}i Informacii","ISSN":"https:\/\/id.crossref.org\/issn\/0555-2923","issn-type":"print"},{"issue":"174","key":"27","doi-asserted-by":"publisher","first-page":"717","DOI":"10.2307\/2008010","article-title":"284457 Steiner triple systems of order 19 contain a subsystem of order 9","volume":"46","author":"Stinson, D. R.","year":"1986","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"28","unstructured":"H. S. White, F. N. Cole, and L. D. Cummings, Complete classification of triad systems on fifteen elements, Memoirs of the National Academy of Sciences 14 (1919) no. 2, 1\u201389."}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.ams.org\/mcom\/2015-84-296\/S0025-5718-2015-02945-7\/S0025-5718-2015-02945-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2015-84-296\/S0025-5718-2015-02945-7\/S0025-5718-2015-02945-7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T18:33:41Z","timestamp":1776796421000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2015-84-296\/S0025-5718-2015-02945-7\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,7]]},"references-count":28,"journal-issue":{"issue":"296","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["S0025-5718-2015-02945-7"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/2945","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2015,4,7]]}}}