Dear Label_Name,

Greetings! I hope you are well.

I am writing on behalf of an international publishing house, Science and Education Publishing, USA (http://www.sciepub.com).

Science and Education Publishing (SciEP) is a multidisciplinary open access publisher of Journals covering the fields of Science, Technology and Medicine. All SciEP publications are subject to high-quality peer review, editorial and production processes and are freely available online.

Welcome to the April, 2013 edition of SciEP newsletter, providing monthly summaries of articles on science & education related topics of interest to scientist and professionals. The mission of our journals is to provide an open access forum for publishing new findings on issues pertinent to scientific and academic field. We also invite you to submit original research papers, review articles, short reports, or case studies are considered for publication in our Multidisciplinary Journals.

American Journal of Public Health Research
DOI: 10.12691/ajphr-1-1-3

The Implementation of a Tele-Homecare System with Service Oriented Architecture and HL7 Message Transmission Standard
Ching-Sung Wang

American Journal of Medical and Biological Research
DOI: 10.12691/ajmbr-1-1-2

The Influence of Ethanol on Pyruvate Kinases Activity in Vivo, in Vitro, in Silico
Lelevich Sergey Vladimirovich, Khrustalev Vladislav Victorovich, Barkovsky Eugene Victorovich, Shedogubova Tatyana Aleksandrovna

American Journal of Medical Sciences and Medicine
DOI: 10.12691/ajmsm-1-1-1

Clinical and Histological Features in Wegener Granulomatosis
Li Cavoli Gioacchino, Passantino Rita, Bono Luisa, Tortorici Calogera, Ferrantelli Angelo, Giammarresi Carlo, Rotolo Ugo

American Journal of Infectious Diseases and Microbiology
DOI: 10.12691/ajidm-1-1-2

The Curse of Lymphatic Filariasis: Would the Continual Use of Diethylcarbamazine Eliminate this Scourge in Papua New Guinea?
Anne Lanham, Lillian Mwanri

We have released issues of some journals on February 2013.
American Journal of Public Health Research
American Journal of Medical Sciences and Medicine
American Journal of Medical and Biological Research
American Journal of Pharmacological Sciences
American Journal of Clinical Medicine Research
American Journal of Nursing Research
American Journal of Cancer Prevention
American Journal of Medicine Studies
American Journal of Infectious Diseases and Microbiology
American Journal of Cardiovascular Disease Research
American Journal of Biomedical Research
American Journal of Mechanical Engineering
American Journal of Microbiological Research
Journal of Preventive Medicine
American Journal of Food and Nutrition
American Journal of Hypertension Research
American Journal of Sports Science and Medicine
Journal of Cancer Research and Treatment
American Journal of Zoological Research
Journal of Biomedical Engineering and Technology
American Journal of Microbiological Research
Biomedical Science and Engineering

We are pleased to announce that submissions are now being accepted for peer review for all the journals across all our subject areas in SciEP.

Please submit your manuscript via our online submission system:
http://www.sciepub.com/author/signin

To unsubscribe from our mailing list, please click on the following link: unsubscribe

I am looking forward to hearing from you.

Kind regards,

David Rain
Email:join@sciepub.com
Science and Education Publishing (http://www.sciepub.com)

Some Constructions of Nearly µ-Resolvable Designs

Banerjee S., Awad R., Agrawal B.*

School of Statistics, DAVV, Indore, India

Abstract: This paper deals with general construction methods of nearly µ - resolvable balanced incomplete block designs with illustration using nearly one resolvable balanced incomplete block (BIB) designs and some known group divisible (GD) designs.

Keywords: balanced incomplete block design, symmetric balanced incomplete block design, resolvable design, μ – resolvable balanced block designs, nearly μ – resolvable balanced block designs, GD design

Citation: Banerjee S., Awad R., Agrawal B., Some Constructions of Nearly µ-Resolvable Designs. American Journal of Applied Mathematics and Statistics, 6 (2). 36-43. January 2018. doi:10.12691/ajams-6-2-1

1. Introduction

An incomplete block design (IBD) is a pair (V, D) where V is a v-set of symbols and D is a collection of k – subsets of V called blocks where k < v. A balanced incomplete block design (BIBD) is an IBD (V, D) such that each pair of V is contained in exactly λ blocks. We denote such design as a (v, k, λ) – BIBD.

A near parallel class of an IBD (V, D), with respect to a symbol s, is a set of blocks that partitions the set V–{S} into (v – 1) / k blocks of that design. We call s the missing symbol / hole of this parallel class.

A design is (near) µ-resolvable if it has a (near) resolution such that any (v – 1) treatments occur µ-times in each of the resolution sets. When µ = 1, it leads to a near resolvable design in the sense of Abel and Furino [2]. The constructions and existence results of nearly resolvable designs can be seen in literatures as Morales et al. [13], Haanpaa and Kaski [8] and Abel and Funiro [2].

The existence of group divisible (GD) designs has been of interest over the years, going back to at least the work of Bose and Shimamoto [5], who began classifying such designs. A group divisible design is a 2-associates partially balanced incomplete block design based on v = mn treatments (being m groups of n treatments each), consisting of b blocks of size k (< v), such that each treatment appears in r blocks, and any two treatments (called the first associates) belonging to the same group occur together in λ₁ blocks whereas any two treatments (called the second associates) belonging to different groups occur together in λ₂ blocks. Furthermore, group divisible (GD) designs are classified into three types: (i) Singular (S) design for which r - λ₁=0; (ii) Semi regular (SR) design for which r - λ1 > 0 and rk - vλ2 = 0; (iii) Regular (R) design for which r - λ1 > 0 and rk - vλ₂ > 0. For notations of parameters in a GD association scheme, we refer the reader to Raghavarao [17].

Bose and Nair [4] first introduced the concept of “dualisation” in the field of design of experiments. They derived a new class of block designs by interchanging the role of treatments and blocks in a block design. Shrikhande [18] applied the concept of dualisation to an asymmetric BIB design with λ = 1 or 2 to produce 2-associate PBIB designs. Dualisation of an incomplete block design with respect to unordered pairs of treatments could be found in Vanstone [19], who constructed a BIB design through symmetric BIB designs with λ ≥ 2. Using similar technique Mohan and Kageyama [14] constructed 2-associate group divisible designs. The generalization of the concept due to Vanstone [19] i.e. dualisation with respect to s-tuples could be seen in Kageyama and Mohan [10] in constructing PBIB designs for any s ≥ 1. Kageyama et al. [12] and Philip et al. [16] used the concept of “restricted dualisation” to construct some nested BIB designs and PBIB designs.

In the present paper, we have proposed some construction methods of nearly μ – resolvable BIB designs. In one section, we have proposed construction methods of getting nearly μ – resolvable balanced block designs having same parameters using two different techniques, firstly by rearrangements of blocks and secondly by using some restrictions in dualisation with respect to treatments of the blocks. In the next section we have discussed two elegant methods of getting nearly μ – resolvable balanced block designs using some known group divisible designs.

2. Method of Construction I

Consider a BIB design D with parameters (v, b, r, k, λ). Considering the r blocks containing any treatment Rearranging the r–blocks corresponding to any i-th treatment as

Now eliminate the treatment and consider the remaining structure of the r - blocks as Di, where as

[picture] | (2.1.1)

This denotes the nearly λ–resolvable block design with parameters

[picture] | (2.1.2)

Theorem 2.1: The existence of BIB design with parameters v, b, r, k and λ implies the existence of nearly λ – resolvable block designs with parameters:

Proof: Let denotes the v treatments of the chosen design D. Now rearrange the r blocks of D corresponding to any i-th treatment (i = 1, 2,3, ..., v) and then eliminate . Doing the same for all the v treatments, we will get the required nearly λ–resolvable design. The parameters are obvious by construction. As in the original BIB design any pair of treatments say occurs in λ blocks, the method produces this pair will occur in (k–2) sets of Di ; and hence the λ blocks, where occurs in the original BIB design, produce . It is now obvious to note that in , there is a natural partition of v resolution sets of r blocks each and every (v – 1) treatments occur λ times in i-th resolution set with a hole i.e the i-th resolution set do not contain . This completes the proof.

Corollary 2.2: The existence of SBIB design with parameters (v, k, λ) implies the existence of nearly λ – resolvable block designs with parameters:

Corollary 2.3: If λ = 1, then the structure define in (2.1.2) leads to a near resolvable design.

Example 2.4: Consider a SBIB design with parameters, and. Then the theorem 2.1 yields a nearly 2 – resolvable block design with parameters and ; whose blocks are given as

Table 2.1.

Example 2.5: Consider a SBIB design with parameters, and. Then the theorem 2.1 yields a nearly 2 – resolvable block designs with parameters , whose blocks are given as

Table 2.2

We can also obtained the nearly λ – resolvable block design defined in (2.1.1) with same parameters given in (2.1.2) using another technique of restricted dualisation with respect to the treatments of the blocks.

3. Method of Construction II

Consider a symmetric balanced incomplete block design D (v, k, λ) having v treatments (with replication number r) and b number of blocks (of size k). Choose any one block from it and call this chosen block as a fixed block (say Bj). Now ignore this fixed block and dualise D with respect to the treatments of this fixed block Bj. Then write the block numbers corresponding to any treatment of this fixed block. A new design so formed is called D₁. Doing this dualisation for all the v treatments, we get a required structure as follows

[picture] | (3.1.1)

This designs denotes the nearly λ – resolvable designs with parameters same as defined in (2.1.2).

Theorem 3.1: The existence of SBIB design with parameters v = b, r = k and λ implies the existence of nearly λ – resolvable block designs with parameters:

Which are same as parameters given in (2.1.2).

Remark: The restricted dualisation used in Method II when made for Non-Symmetrical BIB designs; it produces 2-association PBIB designs.

Example 3.2: Consider a SBIB design with parameters, and. Then the theorem 3.1 yields a nearly 3 – resolvable block designs with parameters and This gives six multiple solution of (11, 5, 2) design with no repeated blocks. The structure is as follows

Table 3.1.

In the next sections, we have discussed two elegant methods of construction of nearly μ – resolvable balanced incomplete block designs.

Preposition 1: Malcolm [14] proved that the two multiple of a SBIB design v = b = 4t+3, r = k = 2t+1 and λ = t; where 4t+3 is a prime or a prime power is always near one resolvable balanced incomplete block design with parameters v’ = 4t+3, b’ = 2(4t+3), r’ = 2(2t+1), k’ = 2t+1 and λ’ = 2t respectively.

4. Method of Construction III

Consider a two multiple of a SBIB (4t+3, 2t+1, t) design. This design D’ is always near one resolvable balanced incomplete block design since one treatment is missing from each resolution set. Also D’ gives column-wise BIB design Dc with parameters Vc = 4t+3, Bc = 2(4t+3), Rc = 2(2t+1), Kc = 2t+1, λc = 2t and row-wise BIB design Dr with parameters Vr = 4t+3, Br = (2t+1) (4t+3), Rr = 2(2t+1), Kr = 2, λr = 1 respectively.

If we consider rows of Dr as an association scheme, then there are (4t+3) such association schemes with (2t+1) groups of size two which meets with the association scheme of chosen GD design with parameters and The association scheme for each resolution set is given as

[picture] | (4.1.1)

Considering all the (4t+3) resolution sets, we obtained the resultant design as given below

[picture] | (4.1.2)

This gives nearly – resolvable balanced incomplete block design with parameters

Theorem 4.1: The existence of a row-wise BIB design and group divisible (GD) design with parameters Vr = 4t+3, Br = (2t+1) (4t+3), Rr = 2 (2t+1), Kr = 2, λr = 1 and respectively; implies the existence of nearly – resolvable balanced incomplete block design with parameters

Proof: Let us consider a row-wise BIB design Dr having parameters Vr = 4t+3, Br = (2t+1) (4t+3), Rr = 2(2t+1), Kr = 2, λr = 1 and considering rows of Dr as an association scheme which meets with the association scheme of chosen GD design having parameters (since one treatment is missing from each resolution set in D’), . In each resolution set, there are treatments arranged in groups of size.

There are (4t+3) resolution sets in all. For each resolution set, using the association scheme defined in (4.1.1), we construct group divisible designs Di (i = 1,2,...,v). Then their juxtaposition gives the resultant design as defined in (4.1.2).

In ; and are obvious from the construction. Under the present method of construction, since each Di (i = 1,2,...,v) contains blocks and there are (4t+3) resolution sets in . Thus in resultant design there are blocks in all.

Furthermore any treatment, say appears in blocks of Di (i = 1,2,...,v). These blocks contribute 2(2t+1) times in, since one treatment is missing in each Di (i = 1,2,...,v). Thus .

Also any pair of treatment, say, , which is first associate in Di , will contributes λ₁* times in one resolution set and in the remaining 4t resolution sets, it will contributes λ₂* times. Hence .

It can be noted that the resultant design is nearly – resolvable balanced incomplete block design as there is a natural partition of v resolution sets of r blocks each and every (v – 1) treatments occur λ times in i-th resolution set with a hole i.e the i-th resolution set do not contain . This completes the proof.

Example 4.2: Consider a SBIB design with parameters, and. A two multiple of this design yields a nearly one resolvable balanced incomplete block design D’ as given below

Here the rows of D’ forms a BIB design Dr with parameters Vr = 7, Br = 21, Rr = 6, Kr = 2, λr = 1 and considering rows of this design Dr as an association scheme as follows

Each resolution set meets with the GD design having parameters and

Then the theorem 4.1 yields a nearly 3 – resolvable balanced incomplete block design with parameters and ; whose blocks are given as

Table 4.1.

5. Method of Construction IV

Consider a two multiple of a SBIB (4t+3, 2t+1, t) design. This design D’ is always near one resolvable balanced incomplete block design since one treatment is missing from each resolution set. Also D’ gives column-wise BIB design Dc with parameters Vc = 4t+3, Bc = 2(4t+3), Rc = 2(2t+1), Kc = 2t+1, λc = 2t and row-wise BIB design Dr with parameters Vr = 4t+3, Br = (2t+1) (4t+3), Rr = 2(2t+1), Kr = 2, λr = 1 respectively.

If we consider columns of Dc as an association scheme, then there are (4t+3) such association schemes with two groups of size (2t+1) which meets with the association scheme of chosen GD design with parameters and The association scheme for each resolution set is given as

[picture] | (5.1.1)

Considering all the (4t+3) resolution sets, we obtained the resultant design is given as

[picture] | (5.1.2)

This gives nearly – resolvable balanced incomplete block design with parameters

Theorem 5.1: The existence of a column-wise BIB design and group divisible (GD) design with parameters Vc = 4t+3, Bc = 2(4t+3), Rc = 2(2t+1), Kc = 2t+1, λc = 2t and respectively, implies the existence of nearly – resolvable balanced incomplete block design with parameters

Proof: Let us consider a column-wise BIB design Dc having parameters Vc = 4t+3, Bc = 2(4t+3), Rc = 2(2t+1), Kc = 2t+1, λc = 2t and considering columns of Dc as an association scheme which meets with the association scheme of chosen GD design having parameters [since one treatment is missing from each resolution set in D’], . In each resolution set, there are treatments arranged in groups of size.

There are (4t+3) resolution sets in all. For each resolution set, using the association scheme defined in (5.1.1), we construct group divisible designs Di (i = 1,2,...,v). Then their juxtaposition gives the resultant design as defined in (5.1.2).

In ; and are obvious from the construction. Under the present method of construction, there are (4t+3) resolution sets in the resultant design and each resolution set contains blocks. Thus in resultant design there are blocks in all.

Furthermore any treatment, say appears in blocks of Di (i = 1,2,...,v). These blocks contribute 2(2t+1) times in, since one treatment is missing in each Di (i= 1,2,...,v). Thus .

Also any pair of treatment, say , which is first associate in Di , will contributes λ₁* times in 2t resolution set and in the remaining (2t+1) resolution sets, it will contributes λ₂* times. Hence

It can be noted that the resultant design is nearly – resolvable balanced incomplete block design as there is a natural partition of v resolution sets of r blocks each and every (v – 1) treatments occur λ times in i-th resolution set with a hole i.e the i-th resolution set do not contain . This completes the proof.

Example 5.2: Consider a SBIB design with parameters , and . A two multiple of this design yields a nearly one resolvable balanced incomplete block design D’ as given below

Here the columns of D’ forms a BIB design Dc with parameters Vc = 11, Bc = 22, Rc = 10, Kc = 5, λc = 4 and considering columns of this design Dc as an association scheme as follows

Each resolution set meets with the GD design having parameters and

Then the theorem 5.1 yields a nearly 10 – resolvable balanced incomplete block design with parameters; whose blocks are given as

Table 5.1.

6. Results and Discussion

The following Table 6.1 provides the list of nearly µ – resolvable incomplete block designs for Methods I, II which are obtained by using certain known SBIB designs with k ≤15.

Table 6.1.

The following Table 6.2 provides the list of nearly µ – resolvable incomplete block designs for Method III which are obtained by using nearly one-resolvable balanced incomplete block design and certain known GD designs from Clatworthy table [6].

Table 6.2.

References

[1]   | Abel R.J.R. (1994). Forty-Three Balanced Incomplete Block Designs. Journal of Combinatorial Theory, Series A 65, 252-267.
[2]   | Abel R.J.R. and Furino S.F. (2007). Resolvable and near resolvable designs, in: The CRC Handbook of Combinatorial Designs, (2nd edition), (C.J. Colbourn and J.H. Dinitz, eds.), CRC Press, Boca Raton FL, U.S.A., 87-94.
[3]   | Bose, R. C. (1942). A note on resolvability of balanced incomplete block designs. Sankhya, 6, 105-110.
[4]   | Bose, R. C. and Nair, K. R. (1939). Partially balanced block designs. Sankhya, 4, 337-372.
[5]   | Bose R.C., Shimamoto T. (1952). Classification and analysis of partially balanced incomplete block designs with two associate classes, Journal of the American Statistical Association, 47, 151-184.
[6]   | Clatworthy, W. H. (1973). Tables of two-associate class partially balanced designs. NBS Applied Mathematics, Series 63.
[7]   | Dey, A. (1986). Theory of block designs. Wiley Eastern Limited, New Delhi.
[8]   | Haanpaa H. and Kaski P. (2005). The near resolvable 2-(13,4,3) designs and thirteen-player whist tournaments. Des. Codes Cryptogr. 35, 271-285.
[9]   | Hall, M. Jr. (1986). Combinatorial Theory. John Wiley, New York.
[10]   | Kageyama, S. and Mohan, R. N. (1984). Dualizing with respect to s-tuples. Proc. Japan Acad. Ser. A 60, 266-268.
[11]   | Kageyama, S., Majumdar, A. And Pal, S. (2001). A new series of μ-resolvable BIB designs. Bull. Grad. School Educ. Hiroshima Univ., Part II, No. 50, 41-45.
[12]   | Kageyama, S., Philip, J. and Banerjee, S. (1995). Some constructions of nested BIB and 2-associate PBIB designs under restricted dualization. Bull. Fac. Sch. Educ. Hiroshima Univ., Part II, 17, 33-39.
[13]   | Luis B. Morales, Rodolfo San Agust´ın,1 Carlos Velarde (2007). Enumeration of all (2k + 1, k, k − 1)-NRBIBDs for 3 ≤ k ≤ 13. JCMCC, 60, 81-95
[14]   | Malcolm Greig, Harri Haanpaa and Petteri Kaski (2005). On the coexistence of conference matrices and near resolvable 2-(2k+1, k, k-1) designs. Journal of Combinatorial Theory, Series A, 113, 703-711.
[15]   | Mohan, R. N. and Kageyama, S. (1983). A method of construction of group divisible designs. Utilitas Math., 24, 311-316.
[16]   | Philip, J., Banerjee, S. and Kageyama, S., (1997). Constructions of nested t-associate PBIB designs under restricted dualization. Utilitas Mathematica, 51, 27-32.
[17]   | Raghavarao, D. (1971). Constructions and Combinatorial Problems in Designs of Experiments. John Wiley, New York.
[18]   | Shrikhande, S. S. (1952). On the dual of some balanced incomplete block designs. Biometrics, 8, 66-72.
[19]   | Vanstone, A. (1975). A note on a construction of BIBD’s. Utilitas Math., 7, 321-322.