Displaying similar documents to “The simple 7-(33, 8, 10)-designs with automorphism group P-Gamma-L(2, 23).”

Conjugates for Finding the Automorphism Group and Isomorphism of Design Resolutions

Topalova, Svetlana (2016)

Serdica Journal of Computing

Similarity:

Consider a combinatorial design D with a full automorphism group G D. The automorphism group G of a design resolution R is a subgroup of G D. This subgroup maps each parallel class of R into a parallel class of R. Two resolutions R 1 and R 2 of D are isomorphic if some automorphism from G D maps each parallel class of R 1 to a parallel class of R 2. If G D is very big, the computation of the automorphism group of a resolution and the check for isomorphism of two resolutions might be...

New Symmetric (61,16,4) Designs Invariant Under the Dihedral Group of Order 10

Landjev, Ivan, Topalova, Svetlana (1998)

Serdica Mathematical Journal

Similarity:

∗ This work has been partially supported by the Bulgarian NSF under Contract No. I-506/1995. In this note we construct five new symmetric 2-(61,16,4) designs invariant under the dihedral group of order 10. As a by-product we obtain 25 new residual 2-(45,12,4) designs. The automorphism groups of all new designs are computed.

A Method for Classification of Doubly Resolvable Designs and Its Application

Zhelezova, Stela (2011)

Serdica Journal of Computing

Similarity:

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...

Use ofα-resolvable designs in the construction of two-factor experiments of split-plot type

Kazuhiro Ozawa, Shinji Kuriki, Stanisław Mejza (2016)

Biometrical Letters

Similarity:

We consider an incomplete split-plot design (ISPD) with two factors generated by the semi-Kronecker product of two α-resolvable designs. We use an α-resolvable design for the whole plot treatments and an affine α-resolvable design for the subplot treatments. We characterize the ISPDs with respect to the general balance property, and we give the stratum efficiency factors for the ISPDs.

Some observations on the constructions of chemical balance weighing designs

Ratnakaram Nava Mohan, Bronisław Ceranka, Sanpei Kageyama (2001)

Discussiones Mathematicae Probability and Statistics

Similarity:

The construction of some optimum chemical balance weighing designs from affine μ-resolvable balanced incomplete block (BIB) designs are discussed in the light of a characterization theorem on the parameters of affine μ-resolvable BIB designs as given by Mohan and Kageyama (1982), for the sake of practical use of researchers who need some selective designs for the construction of chemical balance weighing designs.

Adaptive biased-coin designs for clinical trials with several treatments

Anthony C. Atkinson (2004)

Discussiones Mathematicae Probability and Statistics

Similarity:

Adaptive designs are used in phase III clinical trials for skewing the allocation pattern towards the better treatments. We use optimum design theory to provide a skewed biased-coin procedure for sequential designs with continuous responses. The skewed designs are used to provide adaptive designs, the performance of which is studied numerically for designs with three treatments. Important properties are loss and the proportion of allocation to inferior treatments. Regularisation to provide...