In this article we give another proof of the theorem concretely without using Frobenius's formula for induced characters and we also state some comments on Brauer's induction theorem. แฎ 1998 Academic Press ## 1. Introduction Throughout this article, G, Z, and C denote a finite group, the ring of r
On a Theorem of J. Ossowski
โ Scribed by Fred Galvin
- Publisher
- Elsevier Science
- Year
- 1997
- Tongue
- English
- Weight
- 214 KB
- Volume
- 78
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
โฆ Synopsis
Consider any matrix of zeros and ones with at most n ones in each row and fewer than (k+1) n ones in all. Ossowski showed that, by deleting no more than k columns, one can get a matrix which contains no r_(n&r+1) submatrix of ones for r=1, 2, ..., n. We give a short proof of Ossowski's theorem in the slightly stronger form: any minimal set of columns, whose deletion has the desired effect, has cardinality at most k.
๐ SIMILAR VOLUMES
In this paper we study some purely mathematical considerations that arise in a paper of Cooper on the foundations of thermodynamics that was published in this journal. Connections with mathematical utility theory are studied and some errors in Cooper's paper are rectified.
1. In [ 8 ] , p. 201, P. LELONQ has shown the following theorem: "Let X be a domain in C", n 2 3, and k a fixed integer, 2 5 k 5 n -1. Then X is STEIN ii and only if lor extra assumptiong on X are needed, see e.g. GRAUERT-REMMERT, [6], p. 158, th. 1). Its equivalence with the classical LEVI problem