Constructions and bounds for (m, t)-splitting systems
نویسندگان
چکیده
Let m and t be positive integers with t ≥ 2. An (m, t)-splitting system is a pair (X,B) where |X| = m and B is a collection of subsets of X called blocks, such that, for every Y ⊆ X with |Y | = t, there exists a block B ∈ B such that |B ∩ Y | = ⌊ t 2 ⌋ . An (m, t)-splitting system is uniform if every block has size ⌊ m 2 ⌋ . In this paper, we give several constructions and bounds for splitting systems, concentrating mainly on the case t = 3. We consider uniform splitting systems as well as other splitting systems with special properties, including disjunct and regular splitting systems. Some of these systems have interesting connections with other types of set systems.
منابع مشابه
Comparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملConstructions for uniform (m, 3)-splitting systems
Suppose m and t are integers such that 0 < t ≤ m. An (m, t)-splitting system is a pair (X,B), where |X| = m and B is a set of subsets of X, called blocks, such that for every Y ⊆ X and |Y | = t, there exists a block B ∈ B such that |B ∩Y | = bt/2c. An (m, t)splitting system is uniform if every block has size bm/2c. We present new construction methods of uniform splitting systems for t = 3 that ...
متن کاملOn the modified iterative methods for $M$-matrix linear systems
This paper deals with scrutinizing the convergence properties of iterative methods to solve linear system of equations. Recently, several types of the preconditioners have been applied for ameliorating the rate of convergence of the Accelerated Overrelaxation (AOR) method. In this paper, we study the applicability of a general class of the preconditioned iterative methods under certain conditio...
متن کاملUPPER BOUNDS FOR FINITENESS OF GENERALIZED LOCAL COHOMOLOGY MODULES
Let $R$ be a commutative Noetherian ring with non-zero identity and $fa$ an ideal of $R$. Let $M$ be a finite $R$--module of finite projective dimension and $N$ an arbitrary finite $R$--module. We characterize the membership of the generalized local cohomology modules $lc^{i}_{fa}(M,N)$ in certain Serre subcategories of the category of modules from upper bounds. We define and study the properti...
متن کاملLinear Programming Bounds for Ordered Orthogonal Arrays and (T;M;S)-nets
A recent theorem of Schmid and Lawrence establishes an equivalence between (T; M; S)-nets and ordered orthogonal arrays. This leads naturally to a search both for constructions and for bounds on the size of an ordered orthogonal array. Subsequently, Martin and Stinson used the theory of association schemes to derive such a bound via linear programming. In practice, this involves large-scale com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 307 شماره
صفحات -
تاریخ انتشار 2007