Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with 0-1-matrices
Search options not deleted
user 73667
Questions involving results for the special case of matrices over the integers, reals, or complex numbers in which all coefficients are 0 or 1 (e.g. permutation matrices and adjacency matrices of graphs or digraphs).
5
votes
0
answers
183
views
Number of {0,1}-matrices with an even number of 1’s in each row vs in each column
I am working on an equation that would be solved if I show the following.
Let $k \geq l$, and consider the set of $\{0,1\}$-matrices of size $k \times l$ with exactly $i$ 1’s. Consider the subset $\ma …
- 891