All Questions
4 questions
6
votes
1
answer
180
views
Smallest set of nonzero vectors in $\mathbb F_2^n$ which intersects every 2-dimensional subspace
What is the smallest set of nonzero vectors in $\mathbb F_2^n$ which intersects every 2-dimensional subspace?
For example, for n = 3, the set {001, 010, 011} does the job, and is minimal. For n = 4, {...
4
votes
1
answer
273
views
Dominating sets in subtournaments of the Paley tournament
For a tournament $T$, let $\mathrm{dom}(T)$ be the order of a smallest dominating set in $T$. Let $q$ be a prime power congruent to 3 mod 4 and let $T_q$ be the Paley tournament on $q$ vertices.
Is ...
2
votes
1
answer
362
views
Characterization of nilpotent adjacency matrices [closed]
Let $\theta$ be the adjacency matrix of a simple graph (symmetric and zeros on the diagonal). What is the characterization of those $\theta$ which satisfy $$\theta^2 \equiv 0 \pmod{2}$$ i.e. which $\...
2
votes
0
answers
111
views
Standard interpretation of permanents (of orthogonal included) over finite fields
Given a $0/1$ matrix in $\mathbb Z^{n\times n}$ the standard interpretation of permanent of the matrix is the number of perfect matchings in the underlying $2n$ vertex balanced bipartite graph with ...