A Method for Classification of Doubly Resolvable Designs and Its Application

Zhelezova, Stela. "A Method for Classification of Doubly Resolvable Designs and Its Application." Serdica Journal of Computing 5.3 (2011): 273-308. <http://eudml.org/doc/219609>.

@article{Zhelezova2011,
abstract = {This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical Modeling on 22 February 2010.The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property - they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications.Therefore the classification of doubly resolvable designs and their sets of mutually orthogonal resolutions might be very important. We develop a method for classification of doubly resolvable designs. Using this method and extending it with some theoretical restrictions we succeed in obtaining a classification of doubly resolvable designs with small parameters. Also we classify 1-parallelisms and 2-parallelisms of PG(5,2) with automorphisms of order 31 and find the first known transitive 2-parallelisms among them. The content of the paper comprises the essentials of the author’s Ph.D. thesis.},
author = {Zhelezova, Stela},
journal = {Serdica Journal of Computing},
keywords = {Classification; Resolvable Design; Orthogonal Resolution; T-parallelism},
language = {eng},
number = {3},
pages = {273-308},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {A Method for Classification of Doubly Resolvable Designs and Its Application},
url = {http://eudml.org/doc/219609},
volume = {5},
year = {2011},
}

TY - JOUR
AU - Zhelezova, Stela
TI - A Method for Classification of Doubly Resolvable Designs and Its Application
JO - Serdica Journal of Computing
PY - 2011
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 5
IS - 3
SP - 273
EP - 308
AB - This article presents the principal results of the Ph.D. thesis Investigation and classification of doubly resolvable designs by Stela Zhelezova (Institute of Mathematics and Informatics, BAS), successfully defended at the Specialized Academic Council for Informatics and Mathematical Modeling on 22 February 2010.The resolvability of combinatorial designs is intensively investigated because of its applications. This research focuses on resolvable designs with an additional property - they have resolutions which are mutually orthogonal. Such designs are called doubly resolvable. Their specific properties can be used in statistical and cryptographic applications.Therefore the classification of doubly resolvable designs and their sets of mutually orthogonal resolutions might be very important. We develop a method for classification of doubly resolvable designs. Using this method and extending it with some theoretical restrictions we succeed in obtaining a classification of doubly resolvable designs with small parameters. Also we classify 1-parallelisms and 2-parallelisms of PG(5,2) with automorphisms of order 31 and find the first known transitive 2-parallelisms among them. The content of the paper comprises the essentials of the author’s Ph.D. thesis.
LA - eng
KW - Classification; Resolvable Design; Orthogonal Resolution; T-parallelism
UR - http://eudml.org/doc/219609
ER -