Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Extensions of Steiner Triple Systems
View through CrossRef
ABSTRACTIn this article, we study extensions of Steiner triple systems by means of the associated Steiner loops. We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop. We investigate extensions of Steiner loops, focusing in particular on the case of Schreier extensions, which provide a powerful method for constructing Steiner triple systems containing Veblen points.
Title: Extensions of Steiner Triple Systems
Description:
ABSTRACTIn this article, we study extensions of Steiner triple systems by means of the associated Steiner loops.
We recognize that the set of Veblen points of a Steiner triple system corresponds to the center of the Steiner loop.
We investigate extensions of Steiner loops, focusing in particular on the case of Schreier extensions, which provide a powerful method for constructing Steiner triple systems containing Veblen points.
Related Results
COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ2 METRIC SPACES
COMPUTING STEINER POINTS AND PROBABILITY STEINER POINTS IN ℓ1 AND ℓ2 METRIC SPACES
The Steiner tree problem is a well known network optimization problem which asks for a connected minimum network (called a Steiner minimum tree) spanning a given point set N. In th...
“Dari Mata Turun ke Hati”: Penggunaan Eyelash Extensions di Kalangan Siswi Sekolah Menengah
“Dari Mata Turun ke Hati”: Penggunaan Eyelash Extensions di Kalangan Siswi Sekolah Menengah
Being attractive and beautiful has its own charm which will certainly increase self-confidence. For this reason, women try to improve their appearance, one of which is by doing fac...
Dynamic Algorithms for Approximate Steiner Trees
Dynamic Algorithms for Approximate Steiner Trees
ABSTRACTThis study investigates the dynamic Steiner tree problem. The objective of the Steiner tree problem is to compute a minimum‐weight tree connecting a set of designated verti...
Bussey systems and Steiner's tactical problem
Bussey systems and Steiner's tactical problem
In 1853, Steiner posed a number of combinatorial (tactical) problems, which eventually led to a large body of research on Steiner systems.
However, solutions to Steiner's questions...
Poeticile memoriei la Paul Celan și George Steiner: literatura și culpa supraviețuitorului
Poeticile memoriei la Paul Celan și George Steiner: literatura și culpa supraviețuitorului
Both Paul Celan’s and George Steiner’s writings deal with the relationship between culture and barbarism; both originate in a terrible guilt of the survivor. In Paul Celan’s case, ...
Steiner
-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
Steiner
-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
Graph-based indexes have been widely employed to accelerate approximate similarity search of high-dimensional vectors. However, the performance of graph indexes to answer different...
Fighting for Steiner
Fighting for Steiner
Abstract
By 1938, Steiner was showing the strain of nonstop work. At home, the presence of his demanding father put strains on Max’s marriage. And although he scored...
Triple positive profile in antiphospholipid syndrome: prognosis, relapse and management from a retrospective multicentre study
Triple positive profile in antiphospholipid syndrome: prognosis, relapse and management from a retrospective multicentre study
Objective
Antiphospholipid syndrome (APS) is defined by the association of thromboembolic and/or obstetrical clinical manifestations and the presence of antiphosp...