In this article we prove the following statement. For any positive integers k 2 3 and A, let &A) =exp{exp{k'\*}}. If Av(v -1) = 0 (mod k(k -I)) and A(v -1) = 0 (mod k -1) and v > c ( k , A), then a B(v, k , A) exists. o 1996 John Wiley & Sons, Inc. ## 1. Introduction A painvise balanced design (or
A bound for Wilson’s general theorem
✍ Scribed by Yanxun Chang
- Publisher
- SP Science China Press
- Year
- 2000
- Tongue
- English
- Weight
- 704 KB
- Volume
- 43
- Category
- Article
- ISSN
- 1674-7283
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this article we prove the following theorem. For any ) ) and v -1 = 0 (mod k-1) and v > c ( k , l), then a B ( v , k , 1) exists.
In 1975, Richard M. Wilson proved: Given any positive integers k 2 3 and A, there exists a constant vo = vo(k,A) such that v E B(k,A) for every integer v 2 YO that satisfies The proof given by Wilson does not provide an explicit value of VO. We try to find such a value vo(k,A). In this article we c
For every integer tz we denote by n the set {O, 1, . . . , n -1). We denote by En]" the collection of subsets of with exactly k elements. We call the elements of [n]" k-tuples and write thein dlown as (a,, . . . , a,) in the natural order: a, < a, c l . l < ak < n. A colouting 04 [nlk by r colours i
Let K = {Itl,. . . , k,} and L ={I1,. . . , Z,} be two sets of non-negative integers and assume ki > l j for every i , j . Let T be an L-intersecting family of subsets of a set of n elements. Assume the size of every set in T is a number from K. We conjecture that 1 ' f l 5 (: ). We prove that our c