𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Combinatorial problems on the existence of large submatrices II

✍ Scribed by H. Burkill; L. Mirsky

Book ID
107748237
Publisher
Elsevier Science
Year
1977
Tongue
English
Weight
495 KB
Volume
20
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorial problems on the existence
Combinatorial problems on the existence of large submatrices I
✍ H. Burkill; L. Mirsky πŸ“‚ Article πŸ“… 1973 πŸ› Elsevier Science 🌐 English βš– 951 KB

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 t

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

We continue the investigation of a combinatorial problem concerning multisets of equivalence relations on a finite set. ## 1999 Academic Press We denote the least such d by $(r, n). It is easy to see [2] that $(r, 2)=2 r&2 when r is even, while $(r, 2) is undefined when r is odd. Some other values