𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial problems on the existence of large submatrices I

✍ Scribed by H. Burkill; L. Mirsky

Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
951 KB
Volume
6
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

Let M be a class of matrices, M* a proper subclass of M, and $(n) = $(y6; M, M*) the largest integer k with the property that every n x n matrix of class M possesses a k x k submatrix of class M*. In the present paper we seek to estimate $(n) when n is large for two particular specifications of the pair of classes M, M*.

'l?O

πŸ“œ SIMILAR VOLUMES

On a Combinatorial Problem from the Mode
On a Combinatorial Problem from the Model Theory of Wreath Products, I
✍ Dan Saracino πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 181 KB

We prove some conjectures concerning a combinatorial problem that arises in the model-theoretic investigation of wreath products. ## 1999 Academic Press We denote the least such d by $(r, n). The above problem arises in connection with the study of what is called the arity of a finite permutation

Some results on the existence of large s
Some results on the existence of large sets of t-designs
✍ G. B. Khosrovshahi; R. Tayfeh-Rezaie πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 96 KB πŸ‘ 1 views

## Abstract A set of trivial necessary conditions for the existence of a large set of __t__‐designs, __LS__[N](__t,k,__Ξ½), is $N\big | {{\nu \hskip -3.1 \nu}-i \choose k-i}$ for __i__ = 0,…,__t__. There are two conjectures due to Hartman and Khosrovshahi which state that the trivial necessary condi