Reduced Idempotents in the Semigroup of Boolean Matrices
โ Scribed by Janusz Konieczny
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 368 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
โฆ Synopsis
We present an algorithm that generates all reduced idempotents in the semigroup of (n \times n) Boolean matrices. As a consequence, we obtain a method of listing all partial order relations on a finite set with (n) elements.
๐ SIMILAR VOLUMES
The application of degenerate oligonucleotides to DNA Sequencing by Hybridisation with Oligonucleotide Matrix (SHOM) is proposed. The use of degenerate oligonucleotides is regarded as an example of pooling methods that are suitable for various laboratory procedures requiring numerous samples to be a
A cutset in the poset 2 [n] , of subsets of [1, ..., n] ordered by inclusion, is a subset of 2 [n] that intersects every maximal chain. Let 0 : 1 be a real number. Is it possible to find a cutset in 2 [n] that, for each 0 i n, contains at most : ( n i ) subsets of size i ? Let :(n) be the greatest l
Let โ denote the set of generalized doubly stochastic n = n real matrices; that n is matrices whose row and column sums are 1. The research in this paper concerns finding the closest matrix B\* in โ to a given matrix A in M , the space of n = n n n