query: the number of $n\times n$ matrices of 0's and 1's such that every row and column has three 1's
positive_passages.docid: 26343
positive_passages.text: Number of certain (0,1)-matrices, Stanley's Enumerative Combinatorics
negative_passages.docid: 35515
negative_passages.text: Find the number of $(m+n)$ digit binary sequences with $m$ $0$'s and $n$ $1$'s such that no two $1$'s are adjacent
negative_passages.docid: 33955
negative_passages.text: Geometric series of matrices
negative_passages.docid: 11397
negative_passages.text: How do I write this matrix as a product of elementary row matrices.
negative_passages.docid: 77128
negative_passages.text: Necessary and Sufficient conditions for $(i \, j)$ and $(1 \, 2 \, \dotsc \, n)$ generate $S_n$.
negative_passages.docid: 123726
negative_passages.text: $2\times 2 $ matrices over $\mathbb{C}$ that satisfy $\mathrm A^3=\mathrm A$
negative_passages.docid: 37252
negative_passages.text: How can I show that $\begin{pmatrix} 1 & 1 \\ 0 & 1\end{pmatrix}^n = \begin{pmatrix} 1 & n \\ 0 & 1\end{pmatrix}$?
negative_passages.docid: 136623
negative_passages.text: Hints/ Solution in finding a formula $\phi(n)$ for a binary square matrix
negative_passages.docid: 28402
negative_passages.text: Number of bases of an n-dimensional vector space over q-element field.
negative_passages.docid: 2109
negative_passages.text: Max dimension of a subspace of singular $n\times n$ matrices
negative_passages.docid: 157899
negative_passages.text: Matrix problem similar to Problem 3, SEEMOUS 2019
negative_passages.docid: 63260
negative_passages.text: Matrices whose Linear Combinations are All Singular
negative_passages.docid: 22410
negative_passages.text: Find a symmetric matrix $B$ such that for every $3\times 1$ matrix $\text{x}$
negative_passages.docid: 87136
negative_passages.text: All matrices which commute with all $2\times 2$ matrices
negative_passages.docid: 16687
negative_passages.text: Number of Equivalence relations of $\{1,2,3\}$
negative_passages.docid: 8627
negative_passages.text: Number of equivalence classes of $w \times h$ matrices under switching rows and columns
negative_passages.docid: 29065
negative_passages.text: Encode each $n_1,n_2,n_3,...∈N^N$ by an inﬁnite sequence of 0s and 1s with inﬁnitely many 0s, and give a proof that $N^N$ is equinumerous with $R$.