We are already familiar with Γ°v v; k; Γ-difference sets and Γ°v v; k; Γ-designs. In this paper, we will introduce a new class of difference sets and designs: Γ°v v; k; Β½ 1 ; 2 ; . . . ; m Γdifference sets and Γ°v v; k; Β½ 1 ; 2 ; . . . ; m Γ-designs. We will mainly study designs with a relationship we c
β¦ LIBER β¦
A new type of combinatorial design
β Scribed by Craig M Cordes
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 355 KB
- Volume
- 25
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
New type of block design
β
N. S. Mendelsohn; M. Liang
π
Article
π
2002
π
John Wiley and Sons
π
English
β 186 KB
ChemInform Abstract: Rational Combinator
β
W. ZHENG; S. J. CHO; A. TROPSHA
π
Article
π
2010
π
John Wiley and Sons
β 26 KB
π 3 views
A combinatorial design approach to MAXCU
β
Thomas Hofmeister; Hanno Lefmann
π
Article
π
1996
π
John Wiley and Sons
π
English
β 710 KB
The k-MAXCUT problem for undirected graphs C = (V, E ) consists of finding a partition V = V , U . . . U V, such that the number of edges with endpoints in two different sets V, is maximized. We offer a new approach to this problem by showing that the combinatorial notion of block designs can be use
Design expressions for a new type of com
β
K.M. Yee; H. Shakir-Khalil; R. Taylor
π
Article
π
1982
π
Elsevier Science
π
English
β 550 KB
New combinatorial designs and their appl
β
K.A. Bush; W.T. Federer; H. Pesotan; D. Raghavarao
π
Article
π
1984
π
Elsevier Science
π
English
β 494 KB
Combinatorial designs - a tribute to Hai
β
Alan Hartman
π
Article
π
1989
π
Elsevier Science
π
English
β 209 KB