Exact bounds for (λ,n)–stable ۰-۱ matrices.
Publish place: Transactions on Combinatorics، Vol: 9، Issue: 3
Publish Year: 1399
نوع سند: مقاله ژورنالی
زبان: English
View: 179
This Paper With 10 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-9-3_005
تاریخ نمایه سازی: 14 اردیبهشت 1400
Abstract:
Consider a v × v (۰, ۱) matrix A with exactly k ones in each row and each column. A is (λ, n)–stable, if it does not contain any λ × n submatrix with exactly one ۰. If A is (λ, n)–stable, λ, n ≥ ۲, then under suitable conditions on A, v ≥ k k(n−۱)+(λ−۲) . The case n λ−۲ of equality leads to new and substantive connections with block designs. The previous bound and characterization of (λ, ۲)–stable matrices follows immediately as a special case.
Keywords:
Authors
Trevor Bruen
Faculté de Médecine et des sciences de la santé, Université de Sherbrooke, Sherbrooke, Canada