Results 1 to 10 of about 2,206 (230)

A new regular group divisible design

open access: yesExamples and Counterexamples, 2021
A regular group divisible design with parameters: v=b=39, r=k=9, λ1=0, λ2=2, m=13, n=3is obtained using balanced generalized Weighing matrix over a dihedral group of order 6.
Shyam Saurabh, Kishore Sinha
doaj   +1 more source

Existence of a new class of group divisible designs with block size four

open access: yesNantong Daxue xuebao. Ziran kexue ban, 2022
Group divisible designs are not only kinds of classical designs in combinatorial design theory, but also have extremely important applications in coding theory.
TANG Jiahao WANG Jinhua
doaj   +1 more source

Genetic susceptibility to multiple sclerosis in African Americans

open access: yesPLoS ONE, 2021
Objective To explore the nature of genetic-susceptibility to multiple sclerosis (MS) in African-Americans. Background Recently, the number of genetic-associations with MS has exploded although the MS-associations of specific haplotypes within the major ...
Douglas S. Goodin   +4 more
doaj   +2 more sources

3-Group Divisible Designs with 3 Groups and Block Size 5

open access: yesJournal of Mathematics, 2023
A 3-GDD (n, 2, k, λ1, λ2) was defined by combining the definitions of a group divisible design and a t-design. In this paper, we extend the definitions to 3 groups and block size 5, and we denote such GDD by 3-GDD (n, 3, 5, μ1, μ2).
Zebene Girma Tefera   +2 more
doaj   +1 more source

Designs for graphs with six vertices and ten edges

open access: yesElectronic Journal of Graph Theory and Applications, 2019
The design spectrum has been determined for two of the 15 graphs with six vertices and ten edges. In this paper we completely solve the design spectrum problem for a further eight of these graphs.
A. D. Forbes, T. S. Griggs, K. A. Forbes
doaj   +1 more source

On group divisible covering designs

open access: yesDiscrete Mathematics, 1999
The notion of group divisible covering design (GDCD) is introduced. The number of blocks in a minimum GDCD with block size \(k\) and group-type \(g^u\), is the covering number \( C(k,g^u)\), whose values are determined for all positive integers \(g\) and \(u\geq 3\).
Katherine Heinrich, Jianxing Yin
openaire   +1 more source

Regular A-optimal Spring Balance Weighing Designs

open access: yesRevstat Statistical Journal, 2012
The problem of indicating an A-optimal spring balance weighing design providing that the measurement errors have different variances and are uncorrelated is considered.
Małgorzata Graczyk
doaj   +1 more source

Divisible designs with dual translation group [PDF]

open access: yesDesigns, Codes and Cryptography, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sabine Giese, Ralph-Hardo Schulz
openaire   +1 more source

Highly D‑efficient Weighing Design and Its Construction

open access: yesActa Universitatis Lodziensis. Folia Oeconomica, 2017
In this paper, some aspects of design optimality on the basis of spring balance weighing designs are considered. The properties of D‑optimal and D‑efficiency designs are studied.
Bronisław Ceranka, Małgorzata Graczyk
doaj   +1 more source

Constructions of Sarvate-Beam Group Divisible Designs

open access: yesGraphs and Combinatorics, 2022
A balanced incomplete block design is a set system in which all pairs of distinct elements occur with a constant frequency. By contrast, a Sarvate-Beam design induces an interval of distinct frequencies on pairs. In this paper, we settle the existence of a Sarvate-Beam variant of group divisible designs of uniform type with block size three.
Peter J. Dukes, Joanna Niezen
openaire   +3 more sources

Home - About - Disclaimer - Privacy