Counting zero kernel pairs over a finite field

17 Mar 2016  ·  Ram Samrith ·

Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called zero kernel pairs over a finite field... We show that the problem is equivalent to certain other enumeration problems and outline a connection with some recent results of Guo and Yang on the natural density of rectangular unimodular matrices over $\Fq[x]$. We also propose a new conjecture on the density of unimodular matrix polynomials. read more

PDF Abstract
No code implementations yet. Submit your code now

Categories


Combinatorics