Section 15.2

Supplementary Problems

[4/0%]
LaTeX
Problem 15.2.1

How many 3×33 \times 3 binary matrices can one form which contain three 11's? Write down these matrices. Which of them are invertible?

?
Problem 15.2.2

Consider the four 8×88 \times 8 binary matrices

S0=(0000000000000000000000000001100000011000000000000000000000000000),S1=(0000000000000000001001000000000000000000001001000000000000000000), S_{0} = \begin{pmatrix} 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \end{pmatrix}, \qquad S_{1} = \begin{pmatrix} 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \end{pmatrix}, S2=(0000000001000010000000000000000000000000000000000100001000000000),S3=(1000000100000000000000000000000000000000000000000000000010000001). S_{2} = \begin{pmatrix} 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \end{pmatrix}, \qquad S_{3} = \begin{pmatrix} 1 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\ 1 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \end{pmatrix}.

Find the 8×88 \times 8 matrices Q0,Q1,Q2,Q3Q_{0}, Q_{1}, Q_{2}, Q_{3} such that

Q0S0Q0T=S1,Q1S1Q1T=S2,Q2S2Q2T=S3,Q3S3Q3T=S0. Q_{0} S_{0} Q_{0}^{T} = S_{1}, \quad Q_{1} S_{1} Q_{1}^{T} = S_{2}, \quad Q_{2} S_{2} Q_{2}^{T} = S_{3}, \quad Q_{3} S_{3} Q_{3}^{T} = S_{0}.
?
Problem 15.2.3

Consider the four 2×22 \times 2 binary matrices AA and BB with the underlying field F\mathbb {F}, char⁡(F)=2\operatorname {char}(\mathbb {F}) = 2. Find the condition on AA and BB such that A+B=ABA+B = AB.

?
Problem 15.2.4

Consider the two permutation matrices (NOT-gate and XOR-gate)

N=(0001001001001000),X=(1000010000010010). N = \begin{pmatrix} 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \\ 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 \end{pmatrix}, \qquad X = \begin{pmatrix} 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \end{pmatrix}.

Can we generate all other permutation matrices from these two permutation matrices? Note that N2=I4N^{2} = I_{4}, X2=I4X^{2} = I_{4} and

NX=(0010000101001000),XN=(0001001010000100). NX = \begin{pmatrix} 0 & 0 & 1 & 0 \\ 0 & 0 & 0 & 1 \\ 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 0 \end{pmatrix}, \qquad XN = \begin{pmatrix} 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{pmatrix}.
?