{"title":"On the number of small Steiner triple systems with Veblen points","authors":"","doi":"10.1016/j.disc.2024.114294","DOIUrl":null,"url":null,"abstract":"<div><div>The concept of <em>Schreier extensions</em> of loops was introduced in the general case in <span><span>[11]</span></span> and, more recently, it has been explored in the context of Steiner loops in <span><span>[6]</span></span>. In the latter case, it gives a powerful method for constructing Steiner triple systems containing Veblen points. Counting all Steiner triple systems of order <em>v</em> is an open problem for <span><math><mi>v</mi><mo>></mo><mn>21</mn></math></span>. In this paper, we investigate the number of Steiner triple systems of order 19, 27 and 31 containing Veblen points and we present some examples.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24004254","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
The concept of Schreier extensions of loops was introduced in the general case in [11] and, more recently, it has been explored in the context of Steiner loops in [6]. In the latter case, it gives a powerful method for constructing Steiner triple systems containing Veblen points. Counting all Steiner triple systems of order v is an open problem for . In this paper, we investigate the number of Steiner triple systems of order 19, 27 and 31 containing Veblen points and we present some examples.
期刊介绍:
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.