Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
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...
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...
CLINICOPATHOLOGICAL STUDY IN TRIPLE NEGATIVE BREAST CANCER
CLINICOPATHOLOGICAL STUDY IN TRIPLE NEGATIVE BREAST CANCER
Background and Objectives: - Carcinoma Breast is most common malignancy in females in USA and second among cases deaths in females (after lung cancer). There is considerable geogra...
Childhood Hyperdiploid Acute Lymphoblastic Leukemia
Childhood Hyperdiploid Acute Lymphoblastic Leukemia
Abstract Background: Acute lymphoblastic leukemias (ALL) with 51-67 chromosomes in leukemic cells are defined as high-hyperdiploid (HHD). In childhood...
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs
We propose polynomial-time algorithms that sparsify planar and bounded-genus graphs while preserving optimal or near-optimal solutions to Steiner problems. Our main contribution is...

Back to Top